Inspired by Spy Koni

How many integers n n satisfy

n ( n n ) = ( n n ) n ? \Large n^{\left(n^n\right) } = (n^n) ^ n ?


Inspiration .

1 2 3 4 Infinitely many

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 solutions

Jesse Nieminen
Mar 7, 2017

n ( n n ) = ( n n ) n n n n = n n 2 n n n n n 2 = 0 n n 2 ( n n n n 2 1 ) = 0 \begin{aligned} &n^{\left(n^n\right)}={\left(n^n\right)}^n \\ &n^{n^n}=n^{n^2} \\ &n^{n^n}-n^{n^2}=0 \\ &n^{n^2}\left(n^{n^n-n^2}-1\right)=0 \\ \end{aligned}

Case 1: n n 2 = 0 n^{n^2} = 0

Clearly, n 0 n \neq 0 , because 0 0 0^0 is not defined.
Since, n n is a non-zero integer, n 2 n^2 is a positive integer.

Now, n = 0 n = 0 which has no solutions.

Case 2: n n n n 2 n^{n^n-n^2} = 1

If n n n 2 = 0 n^n - n^2 = 0 , then n 2 ( n n 2 1 ) = 0 n^2\left(n^{n-2}-1\right)=0 .
Since, n 0 n \neq 0 , n n 2 = 1 n^{n-2} = 1 .
Now if n = 2 n = 2 , we have a solution.
Now if n > 0 , n 2 n > 0, n \neq 2 , we have n = 1 n = 1 , which is also a solution.
Now if n < 0 n < 0 , n n must be even because both sides of the equation must have the same sign.
Now, there exists integer k k such that n = 2 k n = 2k .
Now n 2 k 2 = 1 n 2 = 1 n^{2k - 2}=1 \Rightarrow n^2 = 1 , which has solution n = 1 n = -1 .
However, n n must be even so it is not a solution.

Thus, if n n n 2 = 0 n^n - n^2 = 0 , n = 1 n = 1 or n = 2 n = 2 , which are also solutions to the original equation.

Now if n > 0 , n 1 , n 2 n > 0, n \neq 1, n \neq 2 , we must have n = 1 n = 1 , which has no solutions.

Now if n < 0 n < 0 , we must have 2 n n n 2 2 \mid n^n - n^2 , which means that n n n 2 n^n - n^2 must be an integer, which means that n n n^n must be and integer, because n 2 n^2 is an integer.
However, if n < 1 n < -1 , n n = 1 n n n^n = \dfrac1{n^{-n}} is not an integer, which means that n = 1 n = -1 is the only candidate and it indeed is a solution.

Hence, in case 2 2 , the solutions are n = 1 , n = 1 , n = 2 n = -1, n = 1, n = 2

Conclusion:

Now, combining the cases we have n = 1 , n = 1 n = -1, n = 1 and n = 2 n = 2 as the only solutions.

Hence, the answer is 3 \boxed{3} .

Very nicely done.

We could extend your proof to the real numbers by justifying when we can take logarithms. But I didn't want to do with complex exponentiation, which is why I restricted the problem to the integers.

Calvin Lin Staff - 4 years, 3 months ago

I will like to check with you why x^x is congruent to x mod 2?

Gambler Ho - 4 years, 2 months ago

Log in to reply

Thanks for finding a mistake in my solution.

Indeed x x x ( m o d 2 ) x^x \equiv x \pmod{2} for non-negative integers because of the Fermat's Little Theorem, but since x < 0 x < 0 , its use is not justified.

I have corrected the mistake in my solution.

Jesse Nieminen - 4 years, 2 months ago
Poonayu Sharma
Mar 2, 2017

1 and -1 can be easily seen to satisfy the equation (Note 0 cannot be a solution as 0^0 is not defined)

Assuming x to be + ve , For the other solution take log on both sides. This gives us

Log (x^x^x)= log (x^x^2)

x^x log(x)= x^2 log (x)
{ log (a^b)= b log(a) }

x^x=x^2

Thus x=2 or 1

(And the trivial solution of -1 to the original equation )

So there are 3 integer solutions to x

How did you find that (-1) is a solution? Can you prove there aren't more negative solutions?

Peleg Tsadok - 4 years, 3 months ago

For this you need to realise that left side of the equation will always be +ve if |x| is even and it might be -ve if |x| is odd.

Take absolute value on both sides

|x^x^x|=|x^x^2| This implies x^x^x=x^x^2 (which is solved above )

Or

-x^x^x=x^x^2 Thus , -x^x= x^2 Has only 1 -ve integer solution which is -1

Was this helpful and sufficient ? @Peleg Tsadok

Poonayu Sharma - 4 years, 3 months ago

I forgot x could be negative. :(

A Former Brilliant Member - 4 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...