The number of subsets

Algebra Level pending

S = { n N n 2017 + 2 n + 1 N } S = \left \{ n \in \mathbb{N} | \frac { { n }^{ 2017 }+2 }{ n+1 } \in \mathbb{N} \right \} Determine the number of subsets of S S .


The answer is 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.

1 solution

n 2017 + 2 n + 1 = n 2017 + 1 + 1 n + 1 n 2017 + 2 n + 1 = n 2017 + 1 n + 1 + 1 n + 1 N \displaystyle \frac { { n }^{ 2017 }+2 }{ n+1 } =\frac { { n }^{ 2017 }+1+1 }{ n+1 } \\ \displaystyle \frac { { n }^{ 2017 }+2 }{ n+1 } =\frac { { n }^{ 2017 }+1 }{ n+1 } +\frac { 1 }{ n+1 } \in \mathbb{N}

1 n + 1 N \frac { 1 }{ n+1 } \in \mathbb{N} , Hence n + 1 n . . . ( ) n + 1 \le n ...(*)

The sign of the similarity of the inequality ( ) (*) will apply if n = 0 n = 0 . Though we know that n N n \in \mathbb{N} . So there is no value n n that satisfies the statement. Then we find that S = { } S = \{\} . So that many subsets of S S exist 1 1 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...