Skip to main content

AMC 12 Mock Exam 1 Problem 11

Problem 11 of 25

For how many positive integers n≤100n\le100 is n2−1n^2-1 divisible by 4040?

Answer choices

Show solution

Solution

Since 40=8⋅540=8\cdot5 with gcd⁡(8,5)=1\gcd(8,5)=1, we need 8∣n2−18\mid n^2-1 and 5∣n2−15\mid n^2-1.

Mod 88: an odd number has n2≡1(mod8)n^2\equiv1\pmod 8, while an even number has n2≡0n^2\equiv0 or 4(mod8)4\pmod 8. So nn must be odd.

Mod 55: 5∣(n−1)(n+1)5\mid(n-1)(n+1) iff n≡±1(mod5)n\equiv\pm1\pmod5.

By the Chinese Remainder Theorem the valid nn form 4⋅2=84\cdot2=8 residue classes modulo 4040, namely 1,9,11,19,21,29,31,391,9,11,19,21,29,31,39. The numbers 11 through 8080 contain 2⋅8=162\cdot8=16 valid values, and among 81,…,10081,\dots,100 (which are ≡1,…,20\equiv1,\dots,20) the valid ones are 81,89,91,9981,89,91,99. Total: 16+4=2016+4=\boxed{20}.

Tagged: congruences and counting