For how many positive integers is divisible by ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, we must see n 5 − n 2 = n 2 ( n 3 − 1 ) = 2 5 k for some k . See that the only possibilities are n 2 is a multiple of 25 or n 3 − 1 is a multiple of 25. The other possibilities are n 2 is a multiple of 5 with n 3 − 1 a multiple of 5 too. But if n 2 is a multiple of 5 then n 3 − 1 is not a multiple of 5 ; and the same vice versa.
Now, lets check the first case n 2 is a multiple of 25. Then, n 2 = 2 5 x for some x which implies n = 5 x . So here we obtain this sequence of solutions of n considering x as a square and n < 3 0 0
n = 1 , 5 , 1 0 , 1 5 , 2 0 , 2 5 , . . . , 3 9 5
a total of 60 solutions.
Second case, n 3 − 1 is a multiple of 25. See n 3 − 1 ≡ 0 ( m o d 2 5 ) ⇒ n 3 ≡ 1 ( m o d 2 5 ) ⇔ n ≡ 1 ( m o d 2 5 ) . So, we have te solutions n = 1 , 2 6 , 5 1 , . . . , 2 7 6 a total of 11 (because we already have the answer 1 ).
So n has a total of 7 1 solutions.