Maths Olympiad Prep

Library / /9 of 50

Algebra Difficulty 5.0 AIME, harder Prove it Belarus

Find the least positive integer nn for which there exists a set {s1,,sn}\{s_1, \dots, s_n\} consisting of nn distinct positive integers such that
(11s1)(11s2)(11sn)=512010 \left(1 - \frac{1}{s_1}\right) \left(1 - \frac{1}{s_2}\right) \cdots \left(1 - \frac{1}{s_n}\right) = \frac{51}{2010}
(IMO-2010 Shortlist, Problem N1)

Solution

2. See IMO-2010 Shortlist, Problem N1.

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 and solution reproduced as published; topic and difficulty added by this site.