X is very excited

( ( ( ( ( x ! ) ! ) ! ) ! ) ! ) ) ! = x \large ( ((((x!)!)!)!)!)\ldots)!=x

What is the sum of solutions of x x to the equation above?

Clarification: There is an infinite amount of exclamation signs after the variable x x .


The answer is 3.

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

Let's consider the sequence ( a n ) n N {\left( a_n \right)}_{n \in \mathbb{N} } such that

{ a 1 = x n N , a n + 1 = a n ! \begin{cases} a_1=x & \\ \forall n \in \mathbb{N}, a_{n+1}=a_n! & \end{cases}

for some x N x \in \mathbb{N} .

Let's prove that:

1.) \textbf{1.)} x = 1 lim a n = 1 x=1 \implies \lim a_n=1

Proof: \textbf{Proof:}

Let's considere x = 1 x=1 . Let X = { n N : a n = 1 } X=\{n \in \mathbb{N} : a_n=1 \} .

We have that a 1 = 1 a_1=1 , which means that 1 X 1 \in X .

Let's suppose, by induction hypothesis, that n X n \in X . We have that

a n + 1 = a n ! = 1 ! = 1 a_{n+1}=a_n!=1!=1

Therefore, n + 1 X n+1 \in X , which means that X = N X= \mathbb{N} .

As n N , a n = 1 \forall n \in \mathbb{N}, a_n=1 , we conclude that

lim a n = 1 \lim a_n=1 .

QED \textbf{QED}

2.) \textbf{2.)} x = 2 lim a n = 2 x=2 \implies \lim a_n=2

Proof: \textbf{Proof:}

Let's considere x = 2 x=2 . Let X = { n N : a n = 2 } X=\{n \in \mathbb{N} : a_n=2 \} .

We have that a 1 = 2 a_1=2 , which means that 1 X 1 \in X .

Let's suppose, by induction hypothesis, that n X n \in X . We have that

a n + 1 = a n ! = 2 ! = 2 a_{n+1}=a_n!=2!=2

Therefore, n + 1 X n+1 \in X , which means that X = N X= \mathbb{N} .

As n N , a n = 2 \forall n \in \mathbb{N}, a_n=2 , we conclude that

lim a n = 2 \lim a_n=2 .

QED \textbf{QED}

3.) \textbf{3.)} x > 2 , lim a n x \forall x>2, \lim a_n \neq x

Proof: \textbf{Proof:}

Let x > 2 x>2 . Let´s prove, in first place, that ( a n ) n N {\left( a_n \right)}_{n \in \mathbb{N} } is a strictly increasing sequence.

Let Y = { n N : a n + 1 a n > 0 } Y= \{n \in \mathbb{N}: a_{n+1}-a_n>0 \} .

It is clear that 1 Y 1 \in Y , because a 2 a 1 = x ! x = x ( x 2 ) > 0 a_2-a_1= x!-x=x \cdot \left( x-2 \right) >0 .

Let's suppose, by induction hypothesis, that n Y n \in Y . We have that

a n + 2 a n + 1 = ( a n ! ) ! a n ! = a_{n+2}-a_{n+1}=\left(a_n!\right)!-a_n!=

( a n 1 ) ! ( ( a n ! ) ! ( a n 1 ) ! a n ) ( a n 1 ) ! ( a n ! a n ) > 0 \left( a_n-1 \right)! \cdot \left( \frac{\left(a_n!\right)!}{\left( a_n-1 \right)!}-a_n \right) \geq \left( a_n-1 \right)!\cdot \left( a_n!-a_n \right)>0

Therefore n + 1 Y n+1 \in Y , which means that Y = N Y= \mathbb{N} .

Let suppose, by reductio ad absurdum, that n N , a n x \forall n \in \mathbb{N}, a_n \leq x .

We have that

a 2 x a 1 ! x x ! x a_2 \leq x \implies a_1! \leq x \implies x! \leq x

which is an absurdum, because x > 2 x>2 .

As ( a n ) n N {\left( a_n \right)}_{n \in \mathbb{N} } is a strictly increasing sequence, this means that lim a n x \lim a_n \neq x .

QED \textbf{QED}

By 1.) \textbf{1.)} and 2.) \textbf{2.)} , we have that

( ( ( 1 ! ) ! ) ! ) ! . . . = 1 \left( \left( \left( 1! \right)! \right)! \right)!...=1

and

( ( ( 2 ! ) ! ) ! ) ! . . . = 2 \left( \left( \left( 2! \right)! \right)! \right)!...=2 ,

which means that 1 1 and 2 2 are solutions of the equation.

By 3.) \textbf{3.)} , we have that 1 1 and 2 2 are the only solutions. So, the answer is 1 + 2 = 3 1+2=3 .

I understood 90%

A Former Brilliant Member - 5 years, 10 months ago
Nelson Mandela
Jul 3, 2015

1 and 2.

1!=1.

Also, 2! = 2 x 1 = 2.

so for these 2 numbers infinite number of factorials will still be the number itself.

so, answer = 1+2 =3.

You presented a plausibility argument that 1 and 2 are solutions of the above equation, but you didn't prove that there are no more solutions for the equation.

Paulo Guilherme Santos - 5 years, 11 months ago

I posted a prove that the answer is, in fact, 3.

Paulo Guilherme Santos - 5 years, 11 months ago

It should be only 1&2

Deepak Kumar - 5 years, 11 months ago

Log in to reply

yeah I agree. sorry. I changed the solution. Thanks!!!!....

Nelson Mandela - 5 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...