n n + n = ( n + n ) n
Find solutions where n is an integer.
Give your answer as the number of solutions.
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.
Nice use of set theory! @James Moors
0 0 + 0 = ( 0 + 0 ) 0 → 1 + 0 = ( 0 ) 0 → 1 + 0 = 1 → 1 = 1 or 0 0 + 0 = ( 0 + 0 ) 0 → 0 + 0 = ( 0 + 0 ) 0 → 0 + 0 = 0 → 0 = 0
1 1 + 1 = ( 1 + 1 ) 1 → 1 + 1 = ( 2 ) 1 → 2 = 2 1 → 2 = 2
Therefore, the answer is 2
Problem Loading...
Note Loading...
Set Loading...
We have that n ∈ Z and n n + n = ( 2 n ) n .
Before we start proper, we consider the case when n < 0 .
− 1 ≤ n n < 0 , from which n − 1 ≤ n n + n < n but − 1 < ( 2 n ) n < 0 , so no solution exists in this range.
We can rewrite the righthand side as 2 n n n and do some simple factorising to get: n ( n n − 1 − 1 ) = n ( 2 n n n − 1 ) This is clearly true if n = 0 , so consider the case when n = 0 .
We can divide through by n to get n ( n n − 1 − 1 ) = n ( 2 n n n − 1 ) . If n > 1 , then n divides the lefthand side but not the right, which means no solutions exist for the range n > 1 .
All that needs to be done is to check if n = 1 satisfies the original equation. 1 1 + 1 = 2 1 2 = 2
The only solutions are n = 0 and n = 1 . In other words, there are two solutions.