AlgebraDifficulty 5.0AIME, harderProve itUnited States
Problem: Let n be an integer and m=(n−1001)(n−2001)(n−2002)(n−3001)(n−3002)(n−3003). Given that m is positive, find the minimum number of digits of m.
Solution
Solution: One can show that if m>0, then we must either have n>3003 or n<1001. If n<1001, each term other than n−1001 has absolute value at least 1000, so m>10005, meaning that m has at least 16 digits. However, if n>3003, it is clear that the minimal m is achieved at n=3004, which makes m=2002⋅1002⋅1001⋅3⋅2⋅1=12⋅1001⋅1001⋅1002 which is about 12⋅109 and thus has 11 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.