Not as fast growing as the others but I like it, also a little quiz.
P(1) = 1
P(2) = 2
P(3) = 6561
P(4) = ?
P(n) for int n > 3 is too big to compute
How large exactly?
Due to (P (3)::operators) being 6561, it will have to run 4^6561, which will be insanely large to calculate. Even Google says infinity.
techinally it can still be done with some BIG BIG nums. but i dont think Snap! has that functionality.
I used a more powerful calculator and the result was 1.3049777373 × 103950
I tried calculating P(4) with the BigNums library, but Snap! was unresponsive for a while, so I gave up, closed the tab, and reopened Snap! in a new tab.
Yeah, I don’t think Snap! is gonna be able to handle numbers that big…
I decided to make a script that says the scientific notation value of 4^6561:
It says “NaNe3950”, so @pluto2023 was right about the power of ten.
However, that was only the first step, as the script calculates actually calculates P(4) as ((4^6561)^6561)^6561
So we may never know what that value is…
Recursion and an optimization:
Also, I don’t this would be considered as true recursion, as it is still iterative, although it does calls to itself. Also, you don’t need the iterator variable nor the repeat until loop. Just use a
repeat (number) {
...
}
I calculated and it’s about 101.115629318831 × 1015
That’s a number with more than one quintillion digits… thanks!