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.
2 0 1 6 n + p times 2 0 1 6 2 + 2 0 1 6 2 + … + 2 0 1 6 2 = 2 0 1 6 3 2 0 1 6 n + p ( 2 0 1 6 2 ) = 2 0 1 6 3 p ( 2 0 1 6 2 ) = 2 0 1 6 3 − 2 0 1 6 n p = 2 0 1 6 2 2 0 1 6 3 − 2 0 1 6 n p = 2 0 1 6 − 2 0 1 6 n − 2
Now, given that p is positive, we know that
2 0 1 6 − 2 0 1 6 n − 2 > 0 2 0 1 6 1 > 2 0 1 6 n − 2 1 > n − 2 n < 3
Given that p is an integer, we know that 2 0 1 6 n − 2 must be an integer. This implies that:
n − 2 ≥ 0 n ≥ 2
Combine the two conditions, we have
2 ≤ n < 3
For this range of values of n , there is only one integer value that n can take, and that is n = 2