For how many integers n between 1 and 2005, inclusive, is 2⋅6⋅10⋯(4n−2) divisible by n!?
A number or a short expression. Spacing and $ signs are ignored.
Solution
Note that 2⋅6⋅10⋯(4n−2)=2n⋅1⋅3⋅5⋯(2n−1)=2n⋅2⋅4⋅6⋯2n1⋅2⋅3⋯2n=1⋅2⋅3⋯n1⋅2⋅3⋯2n that is, it is just (2n)!/n !. Therefore, since (2n)!/(n!)2=(n2n) is always an integer, the answer is 2005.
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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.