Think Logically not mathematically [part-37]

How many values exist such that ( ( ( ( ( n ! ) ! ) ! ) ! ) ! ) ) ! = n ? (((((n!)!)!)!)!)\ldots)!=n ?

3 2 0 5 6 7 1 4

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

Viki Zeta
Jun 30, 2016

n ! = n , for all n 2 , 1 So it takes up 2 values n! = n\text{, for all n } \in {2, 1}\\ \text{So it takes up 2 values}

What about 2!? 2!=2 so applying factorial infinite times it will still be 2.

Damien Ashwood - 4 years, 11 months ago

Log in to reply

Yes, it works for 2. It does not work for 0. So, the final answer is srill 2 that is for 1 and 2.

Ashish Menon - 4 years, 11 months ago

Log in to reply

Yeah. Updated!

Viki Zeta - 4 years, 11 months ago

Hey vicky, maybe your answer is wrong it does not work for 0, it gives 1, it works only for 1 and 2

Ashish Menon - 4 years, 11 months ago

Correct. @soduku subbu what are the infinite parentheses for?

Ashish Menon - 4 years, 11 months ago

Log in to reply

Maybe possibly many n ! n! occur infinitely.

Viki Zeta - 4 years, 11 months ago

Log in to reply

Yh, but there are no alternating factorials and parentheses, they are only parentheses.

Ashish Menon - 4 years, 11 months ago

Log in to reply

@Ashish Menon As far as I think, he is meaning many brackets ( ) ( ) LOL

Viki Zeta - 4 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...