2010 AMC 12B Problem 9

Below is the professionally curated solution for Problem 9 of the 2010 AMC 12B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2010 AMC 12B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:prime factorizationperfect powerleast common multiple

Difficulty rating: 1520

9.

Let nn be the smallest positive integer such that nn is divisible by 20,20, n2n^2 is a perfect cube, and n3n^3 is a perfect square. What is the number of digits of n?n?

33

44

55

66

77

Solution:

To be smallest, nn uses only the primes of 20,20, so n=2a5bn=2^a\cdot5^b with a2a\ge2 and b1.b\ge1.

Since n2=22a52bn^2=2^{2a}5^{2b} is a perfect cube, 3a3\mid a and 3b.3\mid b. Since n3=23a53bn^3=2^{3a}5^{3b} is a perfect square, 2a2\mid a and 2b.2\mid b. Hence 6a6\mid a and 6b.6\mid b.

The smallest choice is a=b=6,a=b=6, so n=2656=106=1,000,000,n=2^6\cdot5^6=10^6=1{,}000{,}000, which has 77 digits.

Thus, the correct answer is E.

Problem 9 in Other Years