User blog:Cyias123/A new idea

I thought of this while I was at work and it was a bit of a mental exercise. How do we get a factorial of the largest iteration of any number? First we must decide how to compute the largest iteration of the given number.

Let n= any positive whole number, or any mathematical experssion which produces a positive whole number, and apply that number to the following formula. (It will be assumed that the ↑ formula will be followed in regards to Pentation.)

Let n= n with a numer of ↑↑ n (n→n→3), followed by a number of levels n. The number of ↑ in each level will be determined by the number produced by the previous level.

The outcome should have a pyramid shape, with each level being larger that the previous level.

n↑n with n↓ levels

10↑↑↑↑↑↑↑↑↑↑10 (level 1)

calculate this expression to the nearest whole number, call it X

Then move down to level 2, the number of arrows being determined by the number derived in Level 1

10 with an X amount of ↑ 10, (10→10→Level 1→3) call it X2

Calculate this expression, and in the same fashion move to Level 3.

10 with an X2 amount of ↑ 10 (10→10→Level 2→3)

Continue until Level 10 is reached, which will satify the requirement that everything is done according to the value of n. When the final level is calculated, find the factorial of that number. Any positive whole number can thus be used in this fomula, including large numbers such as Graham's Number, TREE(3), Loader's Number, or any other mathematical expression which produces a positive whole number.

Calculate Graham's Number, call it G. Therefore G→G→3 will be Level 1. Calculate the expression. Level 2 will be exactly G→G→(Level 1)→3, and so on until the final level is reached and the factorial can be computed.