RenB
If n is a positive two-digit integer, how many different values of n allow n^3 - n to be a multiple of 12?
A. 70
B. 67
C. 63
D. 60
E. 57
\((n^3 - n) = (n-1)n(n+1)\)
Look at the first 12 two digit integers. The pattern will be repeated in each of the next 12 integers.
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21
To be divisible by 12, we need to check divisibility by 3 and 4.
If n = 10, 9*10*11 will not be divisible by 12.
If n = 11, 10*11*12 will be.
If n =12, it will be.
If n = 13, it will be.
If n = 14, 13*14*15 will not be divisible by 12.
...
We find that of the 12 numbers, 9 are divisible by 12. In every 4 numbers, the first number is not a possible value of n but other 3 are. If you are able to identify this pattern early on, you don't even need to check for all 12 numbers.
Hence 3 out of every 4 numbers will be divisible by 12.
From 10 to 99, we have 90 numbers which gives us 3* 90/4 = 3 * 22.5
The 22 complete cycles of 4 will give us 66 values of n and of the leftover 2 numbers, one will be an acceptable value of n
Hence 67 values of n.
Answer (B)RenB -
https://gmatclub.com/forum/if-an-intege ... l#p3444072