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 "2007 AMC 12B Problems/Problem 21"

(Added Solution)
 
m
Line 2: Line 2:
 
The first <math>2007</math> positive integers are each written in base <math>3</math>. How many of these base-<math>3</math> representations are palindromes? (A palindrome is a number that reads the same forward and backward.)
 
The first <math>2007</math> positive integers are each written in base <math>3</math>. How many of these base-<math>3</math> representations are palindromes? (A palindrome is a number that reads the same forward and backward.)
  
−
<math>\mathrm {(A)} 100</math>  <math>\mathrm {(B)} 101</math>  <math>\mathrm {(C)} 102</math>  <math>\mathrm {(D)} 103</math>  <math>\mathrm {(E)} 104</math>
+
<math>\mathrm {(A)}\ 100 \qquad \mathrm {(B)}\ 101 \qquad \mathrm {(C)}\ 102 \qquad \mathrm {(D)}\ 103 \qquad \mathrm {(E)}\ 104</math>
  
 
==Solution==
 
==Solution==
Line 47: Line 47:
 
==See Also==
 
==See Also==
 
{{AMC12 box|year=2007|ab=B|num-b=20|num-a=22}}
 
{{AMC12 box|year=2007|ab=B|num-b=20|num-a=22}}
 +
[[Category:Introductory Combinatorics Problems]]

Revision as of 21:09, 21 June 2009

Problem 21

The first $2007$ positive integers are each written in base $3$. How many of these base-$3$ representations are palindromes? (A palindrome is a number that reads the same forward and backward.)

$\mathrm {(A)}\ 100 \qquad \mathrm {(B)}\ 101 \qquad \mathrm {(C)}\ 102 \qquad \mathrm {(D)}\ 103 \qquad \mathrm {(E)}\ 104$

Solution

$2007_{10} = 2202100_{3}$

All numbers of six or less digits in base 3 have been written.

The form of each palindrome is as follows

1 digit - $a$

2 digits - $aa$

3 digits - $aba$

4 digits - $abba$

5 digits - $abcba$

6 digits - $abccba$

Where $a,b,c$ are base 3 digits

Since $a \neq 0$, this gives a total of $2 + 2 + 2\cdot 3 + 2\cdot 3 + 2\cdot 3^2 + 2\cdot 3^2 = 52$ palindromes so far.

7 digits - $abcdcba$, but not all of the numbers are less than $2202100_{3}$

Case: $a=1$

All of these numbers are less than $2202100_3$ giving $3^3$ more palindromes

Case: $a=2$, $b\neq 2$

All of these numbers are also small enough, giving $2\cdot 3^2$ more palindromes

Case: $a=2$, $b=2$

It follows that $c=0$, since any other $c$ would make the value too large. This leaves the number as $220d022_3$. Checking each value of d, all of the three are small enough, so that gives $3$ more palindromes.

Summing our cases there are $52 + 3^3 + 2\cdot 3^2 + 3 = 100 \Rightarrow \mathrm{(A)}$

See Also

2007 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 20 		Followed by
Problem 22
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
All AMC 12 Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_AMC_12B_Problems/Problem_21&oldid=32169"