A number theory problem by A Former Brilliant Member

How many positive integers n n exist such that n 2 + 1 n^2+1 is divisible by n + 1 n+1 .

0 2 3 1

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.

3 solutions

n 2 + 1 n + 1 = ( n 1 ) ( n + 1 ) + 2 n + 1 = n 1 + 2 n + 1 \dfrac{n^{2} + 1}{n + 1} = \dfrac{(n - 1)(n + 1) + 2}{n + 1} = n - 1 + \dfrac{2}{n + 1} .

As n 1 n - 1 is an integer, we see that ( n + 1 ) ( n 2 + 1 ) (n + 1)|(n^{2} + 1) if and only if ( n + 1 ) 2 (n + 1)|2 , which for n > 0 n \gt 0 is only the case when n = 1 n = 1 , and so the number of positive integers that satisfy the given condition is 1 \boxed{1} .

We should be able to show that n + 1 ( n 2 + 1 ) ( n + 1 ) ( n 1 ) = 2 n+1 \;|\; (n^2+1)-(n+1)(n-1)=2 which says n + 1 2 n+1|2 since n n is positive the only possibility is n = 1 \boxed{n=1}

There is only one such positive integer: n = 1 n=1 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...