Maths Olympiad Prep

Library / /400 of 740

, 2021

Algebra Difficulty 5.0 AIME, harder Prove it United States

Problem:
Let nn be an integer and
m=(n1001)(n2001)(n2002)(n3001)(n3002)(n3003). m=(n-1001)(n-2001)(n-2002)(n-3001)(n-3002)(n-3003) .
Given that mm is positive, find the minimum number of digits of mm.

Solution

Solution:
One can show that if m>0m>0, then we must either have n>3003n>3003 or n<1001n<1001. If n<1001n<1001, each term other than n1001n-1001 has absolute value at least 10001000, so m>10005m>1000^{5}, meaning that mm has at least 1616 digits. However, if n>3003n>3003, it is clear that the minimal mm is achieved at n=3004n=3004, which makes
m=200210021001321=12100110011002 m=2002 \cdot 1002 \cdot 1001 \cdot 3 \cdot 2 \cdot 1=12 \cdot 1001 \cdot 1001 \cdot 1002
which is about 1210912 \cdot 10^{9} and thus has 1111 digits.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.