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 "2006 AMC 10B Problems/Problem 25"

(→‎Solution 4)
m (→‎Solution 3)
Line 16: Line 16:
  
 
=== Solution 3 ===
 
=== Solution 3 ===
−
Another way to do the problem is by the process of elimination. The only possible correct choices are the highest powers of each prime, <math>2^3=8</math>, <math>3^2=9</math>, <math>5^1=5</math>, and <math>7^1=7</math>, since indivisibility by any powers lower than these means indivisibility by a higher power of the prime (for example, indivisibility by <math>2^2=4</math> means indivisibility by <math>(2^3=8)</math>. Since the number is divisible by <math>9</math>, it is not the answer, and the digits have to add up to <math>9</math>. Let <math>(a,b)</math> be the digits: since <math>2\cdot(a+b) | 9</math>, <math>(a+b)|9</math>. The only possible choices for <math>(a,b)</math> are <math>(0,9)</math>, <math>(1,8)</math>, <math>(2,7)</math>, <math>(3,6)</math>, and <math>(4,5)</math>. Since the last 2 digits are divisible by <math>4</math>, <math>(1,8)</math>, <math>(4,5)</math>, and <math>(0,9)</math> can be eliminated. Only <math>(3,6)</math> and <math>(2,7)</math> remain; since there is no <math>5</math> or <math>0</math> in either pair, the number cannot be divisible by <math>5</math>. <math>\boxed{ B }</math>
+
Another way to do the problem is by the process of elimination. The only possible correct choices are the highest powers of each prime, <math>2^3=8</math>, <math>3^2=9</math>, <math>5^1=5</math>, and <math>7^1=7</math>, since indivisibility by any powers lower than these means indivisibility by a higher power of the prime (for example, indivisibility by <math>2^2=4</math> means indivisibility by <math>(2^3=8)</math>. Since the number is divisible by <math>9</math>, it is not the answer, and the digits have to add up to <math>9</math>. Let <math>(a,b)</math> be the digits: since <math>2\cdot(a+b) | 9</math>, <math>(a+b)|9</math>. The only possible choices for <math>(a,b)</math> are <math>(0,9)</math>, <math>(1,8)</math>, <math>(2,7)</math>, <math>(3,6)</math>, and <math>(4,5)</math>. Since the last 2 digits @re divisible by <math>4</math>, <math>(1,8)</math>, <math>(4,5)</math>, and <math>(0,9)</math> can be eliminated. Only <math>(3,6)</math> and <math>(2,7)</math> remain; since there is no <math>5</math> or <math>0</math> in either pair, the number cannot be divisible by <math>5</math>. <math>\boxed{ B }</math>
  
 
== Solution 4 ==
 
== Solution 4 ==

Revision as of 15:25, 26 July 2019

Problem

Mr. Jones has eight children of different ages. On a family trip his oldest child, who is 9, spots a license plate with a 4-digit number in which each of two digits appears two times. "Look, daddy!" she exclaims. "That number is evenly divisible by the age of each of us kids!" "That's right," replies Mr. Jones, "and the last two digits just happen to be my age." Which of the following is not the age of one of Mr. Jones's children?

$\mathrm{(A) \ } 4\qquad \mathrm{(B) \ } 5\qquad \mathrm{(C) \ } 6\qquad \mathrm{(D) \ } 7\qquad \mathrm{(E) \ } 8$

Solutions

Solution 1

Let $S$ be the set of the ages of Mr. Jones' children (in other words $i \in S$ if Mr. Jones has a child who is $i$ years old). Then $|S| = 8$ and $9 \in S$. Let $m$ be the positive integer seen on the license plate. Since at least one of $4$ or $8$ is contained in $S$, we have $4 | m$.

We would like to prove that $5 \not\in S$, so for the sake of contradiction, let us suppose that $5 \in S$. Then $5\cdot 4 = 20 | m$ so the units digit of $m$ is $0$. Since the number has two distinct digits, each appearing twice, another digit of $m$ must be $0$. Since Mr. Jones can't be $00$ years old, the last two digits can't be $00$. Therefore $m$ must be of the form $d0d0$, where $d$ is a digit. Since $m$ is divisible by $9$, the sum of the digits of $m$ must be divisible by $9$ (see Divisibility rules for 9). Hence $9 | 2d$ which implies $d = 9$. But $m = 9090$ is not divisible by $4$, contradiction. So $5 \not\in S$ and $5$ is not the age of one of Mr. Jones' kids. $\boxed{ B }$

(We might like to check that there does, indeed, exist such a positive integer $m$. If $5$ is not an age of one of Mr. Jones' kids, then the license plate number must be a multiple of $lcm(1,2,3,4,6,7,8,9) = 504$. Since $11\cdot504 = 5544$ and $5544$ is the only $4$ digit multiple of $504$ that fits all the conditions of the license plate's number, the license plate's number is $5544$.)

Solution 2

Alternatively, we can see that if one of Mr.Jones' children is of the age 5, then the license plate will have to end in the digit $0$ . This means that the license plate would have to have two $0$ digits, and would either be of the form $XX00$ or $X0X0$ (X being the other digit in the license plate) . The condition $XX00$ is impossible as Mr. Jones can't be $00$ years old. If we separate the second condition, $X0X0$ into its prime factors, we get $X\cdot 10\cdot 101$. $101$ is prime, and therefore can't account for allowing $X0X0$ being evenly divisible by the childrens' ages. The $10$ accounts for the 5 and one factor of 2. This leaves $X$, but no single digit number contains all the prime factors besides 5 and 2 of the childrens ages, thus $5$ $\boxed{ B }$ can't be one of the childrens ages.

Solution 3

Another way to do the problem is by the process of elimination. The only possible correct choices are the highest powers of each prime, $2^3=8$, $3^2=9$, $5^1=5$, and $7^1=7$, since indivisibility by any powers lower than these means indivisibility by a higher power of the prime (for example, indivisibility by $2^2=4$ means indivisibility by $(2^3=8)$. Since the number is divisible by $9$, it is not the answer, and the digits have to add up to $9$. Let $(a,b)$ be the digits: since $2\cdot(a+b) | 9$, $(a+b)|9$. The only possible choices for $(a,b)$ are $(0,9)$, $(1,8)$, $(2,7)$, $(3,6)$, and $(4,5)$. Since the last 2 digits @re divisible by $4$, $(1,8)$, $(4,5)$, and $(0,9)$ can be eliminated. Only $(3,6)$ and $(2,7)$ remain; since there is no $5$ or $0$ in either pair, the number cannot be divisible by $5$. $\boxed{ B }$

Solution 4

Since 5 has the "strictest" divisibility rules of the single digit numbers, we check that case first. To be divisible by 9, the other repeating digit must be 4. Seeing that no arrangement of 2 4s and 2 5s are divisible by the other single digit numbers, the answer is $\boxed {(B) 5}$. -DragonLord

See also

2006 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 24 		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
All AMC 10 Problems and Solutions
2006 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 18 		Followed by
Problem 20
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

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=2006_AMC_10B_Problems/Problem_25&oldid=107948"