Find the largest natural number for which is divisible by .
Solution
We have .
Numbers , , and are squares of odd numbers, hence congruent to modulo . Thus , , and are congruent to modulo . Consequently, these four factors are divisible by but not by .
As , we have (mod ). Hence and are congruent to and modulo , respectively. The former thus is divisible by but not by and the latter is divisible by but not by .
Putting it all together, the exponent of in the product is .
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.