1978 AHSME Problems/Problem 27
Revision as of 19:39, 12 February 2021 by Justinlee2017 (talk | contribs) (Created page with "==Solution== Let this integer be <math>n</math>. We have <math> n\equiv 1 \mod 2</math>, <math>n \equiv 1 \mod 3</math>, <math>n \equiv 1 \mod 4</math> <math>\ldots</math> <m...")
Solution
Let this integer be . We have , , . Recall that if and then We see that since , , . We have
From to , contains the largest power of , contains the largest power of , and contains the largest power of . Thus, our lcm is equal to Since , our smallest values of are and The difference between these values is simply the value of
~JustinLee2017