Find the number of integers such that is a divisor of .
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.
We require that n + 1 n 2 + 1 = n − 1 + n + 1 2 be an integer. This will be the case when ( n + 1 ) ∣ 2 , and since 2 has four divisors, namely ± 1 , ± 2 , there will be 4 such n , namely − 3 , − 2 , 0 and 1 .