NSEJS 2016

Number Theory Level pending

Find the number of integers n n such that 1 + n 1+ n is a divisor of 1 + n 2 1 + n^2 .


The answer is 4.

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.

1 solution

We require that n 2 + 1 n + 1 = n 1 + 2 n + 1 \dfrac{n^{2} + 1}{n + 1} = n - 1 + \dfrac{2}{n + 1} be an integer. This will be the case when ( n + 1 ) 2 (n + 1)|2 , and since 2 2 has four divisors, namely ± 1 , ± 2 \pm1, \pm2 , there will be 4 \boxed{4} such n n , namely 3 , 2 , 0 -3,-2, 0 and 1 1 .

suppose we apply remainder theorm : so, n+1 will divide n^2+1 only when n^2+1=0 when we put n = -1 but it equates to 2 so, we conclude that n+1 doesn't divide n^2+1

akarsh jain - 4 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...