2013 AMC 10B Problem 20

Below is the professionally curated solution for Problem 20 of the 2013 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2013 AMC 10B 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:factorialprime factorization

Difficulty rating: 2060

20.

The number 20132013 is expressed in the form 2013=a1!a2!...am!b1!b2!...bn!,2013 = \frac {a_1!a_2!...a_m!}{b_1!b_2!...b_n!}, where a1a2ama_1 \ge a_2 \ge \cdots \ge a_m and b1b2bnb_1 \ge b_2 \ge \cdots \ge b_n are positive integers and a1+b1a_1 + b_1 is as small as possible. What is a1b1?|a_1 - b_1|?

1 1

2 2

3 3

4 4

5 5

Solution:

The prime factorization is 2013=311612013=3\cdot11\cdot61, so the numerator must contain a factor of 6161. Hence a161a_1\ge61.

But 61!61! also contains the prime factor 5959, which is not in 20132013, so the denominator must contain a factor of 5959. Hence b159b_1\ge59.

The lower bound a1+b1120a_1+b_1\ge120 is attainable because 2013=61!11!3!59!10!5!2013=\frac{61!\,11!\,3!}{59!\,10!\,5!}.

Thus a1b1=6159=2|a_1-b_1|=61-59=2, and the correct answer is B .

Problem 20 in Other Years