Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1997 AHSME Problems/Problem 30"
Line 9: Line 9:
 
If <math>D(n)</math> is even, then the binary expansion of <math>n</math> will both begin and end with a <math>1</math>, because all positive binary numbers begin with a <math>1</math>, and if you switch digits twice, you will have a <math>1</math> at the end.  Thus, we are only concerned with the <math>49</math> odd numbers between <math>1</math> and <math>98</math> inclusive.
 
If <math>D(n)</math> is even, then the binary expansion of <math>n</math> will both begin and end with a <math>1</math>, because all positive binary numbers begin with a <math>1</math>, and if you switch digits twice, you will have a <math>1</math> at the end.  Thus, we are only concerned with the <math>49</math> odd numbers between <math>1</math> and <math>98</math> inclusive.
  
−
All of these odd numbers will have an odd <math>D(n)</math>.  <math>D(n) = 0</math> will be given by the numbers <math>1, 11, 111, 1111, 11111, 111111</math>, which is a total of <math>6</math> numbers.
+
All of these odd numbers will have an even <math>D(n)</math>.  <math>D(n) = 0</math> will be given by the numbers <math>1, 11, 111, 1111, 11111, 111111</math>, which is a total of <math>6</math> numbers.
  
 
We skip <math>D(n) = 2</math> for now, and move to <math>D(n) = 4</math>, which is easier to count.  The smallest <math>D(n) = 4</math> happens when <math>n = 10101</math>.  To get another number such that <math>D(n) = 4</math>, we may extend any of the five blocks of zeros or ones by one digit.  This will form <math>110101, 100101, 101101, 101001, 101011</math>, all of which are odd numbers that have <math>D(n) = 4</math>.  To find seven digit numbers that have <math>D(n) = 4</math>, we can again extend any block by one, so long as it remains less than <math>1100001</math> or under.  There are five cases.
 
We skip <math>D(n) = 2</math> for now, and move to <math>D(n) = 4</math>, which is easier to count.  The smallest <math>D(n) = 4</math> happens when <math>n = 10101</math>.  To get another number such that <math>D(n) = 4</math>, we may extend any of the five blocks of zeros or ones by one digit.  This will form <math>110101, 100101, 101101, 101001, 101011</math>, all of which are odd numbers that have <math>D(n) = 4</math>.  To find seven digit numbers that have <math>D(n) = 4</math>, we can again extend any block by one, so long as it remains less than <math>1100001</math> or under.  There are five cases.

Revision as of 12:38, 28 January 2016

Problem

For positive integers $n$, denote $D(n)$ by the number of pairs of different adjacent digits in the binary (base two) representation of $n$. For example, $D(3) = D(11_{2}) = 0$, $D(21) = D(10101_{2}) = 4$, and $D(97) = D(1100001_{2}) = 2$. For how many positive integers less than or equal $97$ to does $D(n) = 2$?

$\textbf{(A)}\ 16\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 26\qquad\textbf{(D)}\ 30\qquad\textbf{(E)}\ 35$

Solution

If $D(n)$ is even, then the binary expansion of $n$ will both begin and end with a $1$, because all positive binary numbers begin with a $1$, and if you switch digits twice, you will have a $1$ at the end. Thus, we are only concerned with the $49$ odd numbers between $1$ and $98$ inclusive.

All of these odd numbers will have an even $D(n)$. $D(n) = 0$ will be given by the numbers $1, 11, 111, 1111, 11111, 111111$, which is a total of $6$ numbers.

We skip $D(n) = 2$ for now, and move to $D(n) = 4$, which is easier to count. The smallest $D(n) = 4$ happens when $n = 10101$. To get another number such that $D(n) = 4$, we may extend any of the five blocks of zeros or ones by one digit. This will form $110101, 100101, 101101, 101001, 101011$, all of which are odd numbers that have $D(n) = 4$. To find seven digit numbers that have $D(n) = 4$, we can again extend any block by one, so long as it remains less than $1100001$ or under. There are five cases.

1) Extending $110101$ is impossible without going over $1100001$.

2) Extending $100101$ by putting a $1$ at the beginning will go over $1100001$, but the other four extensions work, giving $1000101, 1001101, 1001001, 1001011$.

3) Extending $101101$ by putting a $1$ at the beginning will go over $1100001$, but the other four extensions give $1001101, 1011101, 1011001, 1011011$. However, $1001101$ already appeared in #2, giving only three new numbers.

4) Extending $101001$ at the first group is impossible. The other four extensions are $1001001, 1011001, 1010001, 1010011$, but the first two are repeats. Thus, there are only two new numbers.

5) Extending $101011$ at the first group is impossible. The other four extensions give $1001011, 1011011, 1010011, 1010111$, but only the last number is new.

Thus, there is $1$ five digit number, $5$ six digit numbers, and $4 + 3 + 2 + 1 = 10$ seven digit numbers under $1100001$ for which $D(n) = 4$. That gives a total of $16$ numbers.

There smallest number for which $D(n) = 6$ is $1010101$, which is under $98$. Further extensions, as well as cases where $D(n) > 6$, are not possible.

Thus, we know that there are $6$ odd numbers that have $D(n) = 0$, and $16$ odd numbers that have $D(n) = 4$, and $1$ number that has $D(n) = 6$. The remaining odd numbers must have $D(n) = 2$. This means there are $49 - 6 - 16 - 1 = 26$ numbers that have $D(n) = 2$, which is option $\boxed{C}$

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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1997_AHSME_Problems/Problem_30&oldid=74869"