Find the number of positive integers for which is a perfect square.
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.
Plug in 1 to see that 1 does work.
Now let's assume that n > 1 .
Taking the expression mod 3, we have ( − 1 ) n + 1 ≡ p 2
This implies that n must be odd since p 2 in mod 3 can only be 0 or 1.
Taking the expression mod 4, we have 2 n + ( − 1 ) n ≡ ( − 1 ) n ≡ p 2
This implies that n must be even since p 2 in mod 4 can only be 0 or 1.
However this is a contradiction which implies that if n > 1 , there are no values.
Therefore the only value is 1, implying that there is only 1 value.
2011 USAJMO #1