1997 AHSME Problems/Problem 30
Revision as of 19:18, 23 August 2011 by Talkinaway (talk | contribs)
Problem
For positive integers , denote
by the number of pairs of different adjacent digits in the binary (base two) representation of
. For example,
,
, and
. For how many positive integers less than or equal
to does
?
See also
1997 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 29 |
Followed by Last Question | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |