User:Sligocki/Goodstein sequences From Wikipedia, the free encyclopedia Goodstein sequences are very long sequences which eventually reach 0, but run for so long that Peano arithmetic cannot be used to prove that they reach 0. This article is now available on my blog: https://www.sligocki.com/2009/10/14/goodstein-sequences.html Introduction Let G ( n ) {\displaystyle G(n)} be the Goodstein sequence starting with n and ending at 0. G ( 3 ) = ( 2 + 1 , 3 , 3 , 2 , 1 , 0 ) {\displaystyle G(3)=(2+1,3,3,2,1,0)} G ( 4 ) = ( 2 2 , 2 ⋅ 3 2 + 2 ⋅ 3 + 2 , … , 2 ⋅ 23 2 , … , ( 24 ⋅ 2 24 − 1 ) 2 , … , 3 , 2 , 1 , 0 ) {\displaystyle G(4)=(2^{2},2\cdot 3^{2}+2\cdot 3+2,\dots ,2\cdot 23^{2},\dots ,(24\cdot 2^{24}-1)^{2},\dots ,3,2,1,0)} Let g n {\displaystyle g_{n}} be the base of the hereditary notation of the last term of G ( n ) {\displaystyle G(n)} (Alternatively, it is the length of the Goodstein sequence + 1). We shall call these the Goodstein numbers More information , ... n {\displaystyle n} g n {\displaystyle g_{n}} 02 13 25 37 4 3 ⋅ 2 402653211 − 1 = ( 24 ⋅ 2 24 ) 2 24 ⋅ 2 24 − 1 {\displaystyle 3\cdot 2^{402653211}-1=(24\cdot 2^{24})2^{24\cdot 2^{24}}-1} ⋮ {\displaystyle \vdots } Close Now, in fact, if f ( n ) = ( n + 1 ) 2 n + 1 − 1 {\displaystyle f(n)=(n+1)2^{n+1}-1} , then g 4 = f 3 ( 2 ) {\displaystyle g_{4}=f^{3}(2)} . I show that this function has a meaning. Growth of Goodstein Numbers Let us define a family of functions: f 0 ( B ) = B + 1 {\displaystyle f_{0}(B)=B+1} f k ( B ) = f k − 1 B + 1 ( B ) {\displaystyle f_{k}(B)=f_{k-1}^{B+1}(B)} Ah ha, f 1 ( B ) = 2 B + 1 {\displaystyle f_{1}(B)=2B+1} f 2 ( B ) = ( B + 1 ) ⋅ 2 B + 1 − 1 {\displaystyle f_{2}(B)=(B+1)\cdot 2^{B+1}-1} and f 3 ( 2 ) = f 2 3 ( 2 ) = g 4 {\displaystyle f_{3}(2)=f_{2}^{3}(2)=g_{4}} In fact: More information , ... n {\displaystyle n} g n {\displaystyle g_{n}} G ( n ) {\displaystyle G(n)} 02 1 f 0 ( 2 ) {\displaystyle f_{0}(2)} ( 2 0 , … ) {\displaystyle (2^{0},\dots )} 2 f 1 ( 2 ) {\displaystyle f_{1}(2)} ( 2 1 , … ) {\displaystyle (2^{1},\dots )} 3 f 1 ( 3 ) {\displaystyle f_{1}(3)} ( 2 1 + 1 , 3 1 , … ) {\displaystyle (2^{1}+1,3^{1},\dots )} 4 f 3 ( 2 ) {\displaystyle f_{3}(2)} ( 2 2 , 3 3 − 1 , … ) {\displaystyle (2^{2},3^{3}-1,\dots )} 5 f 4 ( 3 ) {\displaystyle f_{4}(3)} ( 2 2 + 1 , 3 3 , 4 4 − 1 , … ) {\displaystyle (2^{2}+1,3^{3},4^{4}-1,\dots )} 6 f 6 ( 5 ) {\displaystyle f_{6}(5)} ( 2 2 + 2 , 3 3 + 2 , 4 4 + 1 , 5 5 , 6 6 − 1 , … ) {\displaystyle (2^{2}+2,3^{3}+2,4^{4}+1,5^{5},6^{6}-1,\dots )} 7 f 8 ( 7 ) {\displaystyle f_{8}(7)} ( 2 2 + 2 + 1 , 3 3 + 3 , 4 4 + 3 , … , 7 7 , 8 8 − 1 , … ) {\displaystyle (2^{2}+2+1,3^{3}+3,4^{4}+3,\dots ,7^{7},8^{8}-1,\dots )} ⋮ {\displaystyle \vdots } Close Notice the pattern? If B k {\displaystyle B^{k}} appears in G ( n ) {\displaystyle G(n)} then g n = f k ( B ) {\displaystyle g_{n}=f_{k}(B)} (where B is the base and k<B). Likewise, if B B {\displaystyle B^{B}} appears, then g n = f B + 1 ( B ) {\displaystyle g_{n}=f_{B+1}(B)} . In fact, let's rename our functions (here ω {\displaystyle \omega } is a label, not a variable — in fact, it is actually an ordinal number, or generalized index, who's properties I hope to take advantage of): f ω 0 ( B ) = B + 1 {\displaystyle f_{\omega ^{0}}(B)=B+1} f ω k ( B ) = f ω k − 1 B + 1 ( B ) {\displaystyle f_{\omega ^{k}}(B)=f_{\omega ^{k-1}}^{B+1}(B)} And add a new one: f ω ω ( B ) = f ω B + 1 ( B ) {\displaystyle f_{\omega ^{\omega }}(B)=f_{\omega ^{B+1}}(B)} Thus, if we have a value of the form α {\displaystyle \alpha } at base B in G ( n ) {\displaystyle G(n)} , then g n = f α ( B ) {\displaystyle g_{n}=f_{\alpha }(B)} . Derivation of Growth Function Note: It turns out that the function I define here is a variant of the fast-growing hierarchy much like the Hardy hierarchy. Goodstein talks about the hereditary form of a number and the unique ordinal number associated with each hereditary form. For example: 266 = 2 5 + 2 3 + 2 = 2 2 2 + 1 + 2 2 + 1 + 2 {\displaystyle 266=2^{5}+2^{3}+2=2^{2^{2}+1}+2^{2+1}+2} is in form ω ω ω + 1 + ω ω + 1 + ω {\displaystyle \omega ^{\omega ^{\omega }+1}+\omega ^{\omega +1}+\omega } Let us identify the hereditary form with that ordinal number. If N has hereditary form α {\displaystyle \alpha } with base B, then let f α ( B ) {\displaystyle f_{\alpha }(B)} be the base at which the the Goodstein sequence starting at N in base B will end. For some values of α {\displaystyle \alpha } : f 0 ( B ) = B {\displaystyle f_{0}(B)=B} f 1 ( B ) = B + 1 {\displaystyle f_{1}(B)=B+1} f k ( B ) = f 1 k ( B ) = B + k {\displaystyle f_{k}(B)=f_{1}^{k}(B)=B+k} f ω ( B ) = f B ( B + 1 ) = f 1 B + 1 ( B ) = 2 B + 1 {\displaystyle f_{\omega }(B)=f_{B}(B+1)=f_{1}^{B+1}(B)=2B+1} f ω ⋅ k ( B ) = f ω k ( B ) ) = ( B + 1 ) 2 k − 1 {\displaystyle f_{\omega \cdot k}(B)=f_{\omega }^{k}(B))=(B+1)2^{k}-1} f ω 2 ( B ) = f ω ⋅ B + B ( B + 1 ) = f ω ⋅ B ( f B ( B + 1 ) ) = f ω ⋅ B ( f ω ( B ) ) = f ω ⋅ ( B + 1 ) ( B ) = f ω B + 1 ( B ) = ( B + 1 ) 2 B + 1 − 1 {\displaystyle f_{\omega ^{2}}(B)=f_{\omega \cdot B+B}(B+1)=f_{\omega \cdot B}(f_{B}(B+1))=f_{\omega \cdot B}(f_{\omega }(B))=f_{\omega \cdot (B+1)}(B)=f_{\omega }^{B+1}(B)=(B+1)2^{B+1}-1} f ω 2 ⋅ k ( B ) = f ω 2 k ( B ) ) > 2 ↑↑ k {\displaystyle f_{\omega ^{2}\cdot k}(B)=f_{\omega ^{2}}^{k}(B))>2\uparrow \uparrow k} f ω 3 ( B ) = f ω 2 ⋅ B + ω ⋅ B + B ( B + 1 ) = f ω 2 ⋅ B ( f ω 2 ⋅ B + B ( B + 1 ) ) = f ω 2 ⋅ B ( f ω 2 ( B ) ) = f ω 2 ⋅ ( B + 1 ) ( B ) = f ω 2 B + 1 ( B ) > 2 ↑↑ ( B + 1 ) {\displaystyle f_{\omega ^{3}}(B)=f_{\omega ^{2}\cdot B+\omega \cdot B+B}(B+1)=f_{\omega ^{2}\cdot B}(f_{\omega ^{2}\cdot B+B}(B+1))=f_{\omega ^{2}\cdot B}(f_{\omega ^{2}}(B))=f_{\omega ^{2}\cdot (B+1)}(B)=f_{\omega ^{2}}^{B+1}(B)>2\uparrow \uparrow (B+1)} f ω k ( B ) = f ω k − 1 ⋅ ( B + 1 ) ( B ) = f ω k − 1 B + 1 ( B ) > 2 ↑ k − 1 ( B + 1 ) {\displaystyle f_{\omega ^{k}}(B)=f_{\omega ^{k-1}\cdot (B+1)}(B)=f_{\omega ^{k-1}}^{B+1}(B)>2\uparrow ^{k-1}(B+1)} f ω ω ( B ) = f ω B + 1 ( B ) > 2 ↑ B ( B + 1 ) = 2 → B + 1 → B {\displaystyle f_{\omega ^{\omega }}(B)=f_{\omega ^{B+1}}(B)>2\uparrow ^{B}(B+1)=2\to B+1\to B} f ω ω ⋅ k ( B ) = f ω ω k ( B ) > 2 → B + 1 → k → 2 {\displaystyle f_{\omega ^{\omega }\cdot k}(B)=f_{\omega ^{\omega }}^{k}(B)>2\to B+1\to k\to 2} Note: h ( n ) = 3 ↑ n 3 < 2 ↑ n ( n − 1 ) = f ω ω ( n − 1 ) {\displaystyle h(n)=3\uparrow ^{n}3<2\uparrow ^{n}(n-1)=f_{\omega ^{\omega }}(n-1)} . So Graham's number G = h 64 ( 4 ) < f ω ω 64 ( 4 ) = f ω ω ⋅ 64 ( 4 ) {\displaystyle {\mathcal {G}}=h^{64}(4)<f_{\omega ^{\omega }}^{64}(4)=f_{\omega ^{\omega }\cdot 64}(4)} . Now G ( 12 ) = ( 2 2 + 1 + 2 2 , … , g 4 g 4 + 1 , g 4 ( g 4 + 1 ) g 4 + 1 , … ) {\displaystyle G(12)=(2^{2+1}+2^{2},\dots ,g_{4}^{g_{4}+1},g_{4}(g_{4}+1)^{g_{4}+1},\dots )} where we remember that g 4 = f ω ω ( 2 ) = 3 ⋅ 2 402653211 − 1 > 64 {\displaystyle g_{4}=f_{\omega ^{\omega }}(2)=3\cdot 2^{402653211}-1>64} . So, g 12 = f ω ω ⋅ g 4 ( g 4 + 1 ) > f ω ω ⋅ 64 ( 4 ) > G {\displaystyle g_{12}=f_{\omega ^{\omega }\cdot g_{4}}(g_{4}+1)>f_{\omega ^{\omega }\cdot 64}(4)>{\mathcal {G}}} f ω ω + 1 ( B ) = f ω ω ⋅ B + ω B ⋅ B + ⋯ + B ( B + 1 ) = f ω ω ⋅ B ( f ω B + 1 ( B ) ) = f ω ω ⋅ B ( f ω ω ( B ) ) = f ω ω ⋅ ( B + 1 ) ( B ) = f ω ω B + 1 ( B ) > 2 → B + 1 → B + 1 → 2 {\displaystyle f_{\omega ^{\omega +1}}(B)=f_{\omega ^{\omega }\cdot B+\omega ^{B}\cdot B+\cdots +B}(B+1)=f_{\omega ^{\omega }\cdot B}(f_{\omega ^{B+1}}(B))=f_{\omega ^{\omega }\cdot B}(f_{\omega ^{\omega }}(B))=f_{\omega ^{\omega }\cdot (B+1)}(B)=f_{\omega ^{\omega }}^{B+1}(B)>2\to B+1\to B+1\to 2} f ω ω + 1 ⋅ k ( B ) = f ω ω + 1 k ( B ) > 2 → B + 1 → k → 3 {\displaystyle f_{\omega ^{\omega +1}\cdot k}(B)=f_{\omega ^{\omega +1}}^{k}(B)>2\to B+1\to k\to 3} f ω ω + 2 ( B ) = f ω ω + 1 ⋅ B + ω ω ⋅ B + ω B ⋅ B + ⋯ + B ( B + 1 ) = f ω ω + 1 ⋅ B ( f ω ω + 1 ( B ) ) = f ω ω + 1 ⋅ ( B + 1 ) ( B ) = f ω ω + 1 B + 1 ( B ) > 2 → B + 1 → B + 1 → 3 {\displaystyle f_{\omega ^{\omega +2}}(B)=f_{\omega ^{\omega +1}\cdot B+\omega ^{\omega }\cdot B+\omega ^{B}\cdot B+\cdots +B}(B+1)=f_{\omega ^{\omega +1}\cdot B}(f_{\omega ^{\omega +1}}(B))=f_{\omega ^{\omega +1}\cdot (B+1)}(B)=f_{\omega ^{\omega +1}}^{B+1}(B)>2\to B+1\to B+1\to 3} f ω ω + k ( B ) = f ω ω + ( k − 1 ) ⋅ ( B + 1 ) ( B ) = f ω ω + ( k − 1 ) B + 1 ( B ) > 2 → B + 1 → B + 1 → k + 1 {\displaystyle f_{\omega ^{\omega +k}}(B)=f_{\omega ^{\omega +(k-1)}\cdot (B+1)}(B)=f_{\omega ^{\omega +(k-1)}}^{B+1}(B)>2\to B+1\to B+1\to k+1} f ω ω ⋅ 2 ( B ) = f ω ω + ( B + 1 ) ( B ) > 2 → B + 1 → B + 1 → B + 2 {\displaystyle f_{\omega ^{\omega \cdot 2}}(B)=f_{\omega ^{\omega +(B+1)}}(B)>2\to B+1\to B+1\to B+2} ... f ω ω ω ( B ) = f ω ω B + 1 ( B ) >> 2 → B + 1 → ⋯ → B + 1 ⏞ B 2 + 2 {\displaystyle f_{\omega ^{\omega ^{\omega }}}(B)=f_{\omega ^{\omega ^{B+1}}}(B)>>2\to \overbrace {B+1\to \cdots \to B+1} ^{B^{2}+2}} Now let's look back at the table: More information , ... n {\displaystyle n} g n {\displaystyle g_{n}} G ( n ) {\displaystyle G(n)} 0 f 0 ( 2 ) = 2 {\displaystyle f_{0}(2)=2} ( 0 , … ) {\displaystyle (0,\dots )} 1 f 1 ( 2 ) = f 1 ( g 0 ) = 3 {\displaystyle f_{1}(2)=f_{1}(g_{0})=3} ( 1 , … ) {\displaystyle (1,\dots )} 2 f ω ( 2 ) = f ω ( g 0 ) = 5 {\displaystyle f_{\omega }(2)=f_{\omega }(g_{0})=5} ( 2 1 , … ) {\displaystyle (2^{1},\dots )} 3 f ω + 1 ( 2 ) = f ω ( f 1 ( 2 ) ) = f ω ( g 1 ) = 7 {\displaystyle f_{\omega +1}(2)=f_{\omega }(f_{1}(2))=f_{\omega }(g_{1})=7} ( 2 1 + 1 , 3 1 , … ) {\displaystyle (2^{1}+1,3^{1},\dots )} 4 f ω ω ( 2 ) = f ω ω ( g 0 ) {\displaystyle f_{\omega ^{\omega }}(2)=f_{\omega ^{\omega }}(g_{0})} ( 2 2 , … ) {\displaystyle (2^{2},\dots )} 5 f ω ω + 1 ( 2 ) = f ω ω ( f 1 ( 2 ) ) = f ω ω ( g 1 ) {\displaystyle f_{\omega ^{\omega }+1}(2)=f_{\omega ^{\omega }}(f_{1}(2))=f_{\omega ^{\omega }}(g_{1})} ( 2 2 + 1 , 3 3 , … ) {\displaystyle (2^{2}+1,3^{3},\dots )} 6 f ω ω + ω ( 2 ) = f ω ω ( f ω ( 2 ) ) = f ω ω ( g 2 ) {\displaystyle f_{\omega ^{\omega }+\omega }(2)=f_{\omega ^{\omega }}(f_{\omega }(2))=f_{\omega ^{\omega }}(g_{2})} ( 2 2 + 2 , 5 5 , … ) {\displaystyle (2^{2}+2,5^{5},\dots )} 7 f ω ω + ω + 1 ( 2 ) = f ω ω ( f ω ( f 1 ( 2 ) ) ) = f ω ω ( g 3 ) {\displaystyle f_{\omega ^{\omega }+\omega +1}(2)=f_{\omega ^{\omega }}(f_{\omega }(f_{1}(2)))=f_{\omega ^{\omega }}(g_{3})} ( 2 2 + 2 + 1 , 3 3 + 3 , … , 7 7 , … ) {\displaystyle (2^{2}+2+1,3^{3}+3,\dots ,7^{7},\dots )} 8 f ω ω + 1 ( 2 ) = f ω ω + 1 ( g 0 ) = f ω ω g 0 + 1 ( 2 ) = f ω ω g 0 ( g 4 ) {\displaystyle f_{\omega ^{\omega +1}}(2)=f_{\omega ^{\omega +1}}(g_{0})=f_{\omega ^{\omega }}^{g_{0}+1}(2)=f_{\omega ^{\omega }}^{g_{0}}(g_{4})} ( 2 2 + 1 , … , 2 ⋅ g 4 g 4 , … ) {\displaystyle (2^{2+1},\dots ,2\cdot g_{4}^{g_{4}},\dots )} 9 f ω ω + 1 + 1 ( 2 ) = f ω ω + 1 ( f 1 ( 2 ) ) = f ω ω + 1 ( g 1 ) = f ω ω g 1 + 1 ( f 1 ( 2 ) ) = f ω ω g 1 ( g 5 ) {\displaystyle f_{\omega ^{\omega +1}+1}(2)=f_{\omega ^{\omega +1}}(f_{1}(2))=f_{\omega ^{\omega +1}}(g_{1})=f_{\omega ^{\omega }}^{g_{1}+1}(f_{1}(2))=f_{\omega ^{\omega }}^{g_{1}}(g_{5})} ( 2 2 + 1 + 1 , 3 3 + 1 , … , 3 ⋅ g 5 g 5 , … ) {\displaystyle (2^{2+1}+1,3^{3+1},\dots ,3\cdot g_{5}^{g_{5}},\dots )} 10 f ω ω + 1 + ω ( 2 ) = f ω ω + 1 ( f ω ( 2 ) ) = f ω ω + 1 ( g 2 ) = f ω ω g 2 + 1 ( g 2 ) = f ω ω g 2 ( g 6 ) {\displaystyle f_{\omega ^{\omega +1}+\omega }(2)=f_{\omega ^{\omega +1}}(f_{\omega }(2))=f_{\omega ^{\omega +1}}(g_{2})=f_{\omega ^{\omega }}^{g_{2}+1}(g_{2})=f_{\omega ^{\omega }}^{g_{2}}(g_{6})} ( 2 2 + 1 + 2 , … , 5 5 + 1 , … , 5 ⋅ g 6 g 6 , … ) {\displaystyle (2^{2+1}+2,\dots ,5^{5+1},\dots ,5\cdot g_{6}^{g_{6}},\dots )} 11 f ω ω + 1 + ω + 1 ( 2 ) = f ω ω + 1 ( f ω ( f 1 ( 2 ) ) ) = f ω ω + 1 ( g 3 ) {\displaystyle f_{\omega ^{\omega +1}+\omega +1}(2)=f_{\omega ^{\omega +1}}(f_{\omega }(f_{1}(2)))=f_{\omega ^{\omega +1}}(g_{3})} ( 2 2 + 1 + 2 + 1 , 3 3 + 1 + 3 , … , 7 7 + 1 , … , 7 ⋅ g 7 g 7 , … ) {\displaystyle (2^{2+1}+2+1,3^{3+1}+3,\dots ,7^{7+1},\dots ,7\cdot g_{7}^{g_{7}},\dots )} 12 f ω ω + 1 + ω ω ( 2 ) = f ω ω + 1 ( f ω ω ( 2 ) ) ) = f ω ω + 1 ( g 4 ) {\displaystyle f_{\omega ^{\omega +1}+\omega ^{\omega }}(2)=f_{\omega ^{\omega +1}}(f_{\omega ^{\omega }}(2)))=f_{\omega ^{\omega +1}}(g_{4})} ( 2 2 + 1 + 2 2 , … , g 4 g 4 + 1 , … , g 4 ⋅ g 8 g 8 , … ) {\displaystyle (2^{2+1}+2^{2},\dots ,g_{4}^{g_{4}+1},\dots ,g_{4}\cdot g_{8}^{g_{8}},\dots )} 13 f ω ω + 1 + ω ω + 1 ( 2 ) = f ω ω + 1 ( f ω ω ( f 1 ( 2 ) ) ) ) = f ω ω + 1 ( g 5 ) {\displaystyle f_{\omega ^{\omega +1}+\omega ^{\omega }+1}(2)=f_{\omega ^{\omega +1}}(f_{\omega ^{\omega }}(f_{1}(2))))=f_{\omega ^{\omega +1}}(g_{5})} ( 2 2 + 1 + 2 2 + 1 , 3 3 + 1 + 3 3 , … , g 5 g 5 + 1 , … , g 5 ⋅ g 9 g 9 , … ) {\displaystyle (2^{2+1}+2^{2}+1,3^{3+1}+3^{3},\dots ,g_{5}^{g_{5}+1},\dots ,g_{5}\cdot g_{9}^{g_{9}},\dots )} 14 f ω ω + 1 + ω ω + ω ( 2 ) = f ω ω + 1 ( f ω ω ( f ω ( 2 ) ) ) ) = f ω ω + 1 ( g 6 ) {\displaystyle f_{\omega ^{\omega +1}+\omega ^{\omega }+\omega }(2)=f_{\omega ^{\omega +1}}(f_{\omega ^{\omega }}(f_{\omega }(2))))=f_{\omega ^{\omega +1}}(g_{6})} ( 2 2 + 1 + 2 2 + 2 , … , 5 5 + 1 + 5 5 , … , g 6 g 6 + 1 , … , g 6 ⋅ g 10 g 10 , … ) {\displaystyle (2^{2+1}+2^{2}+2,\dots ,5^{5+1}+5^{5},\dots ,g_{6}^{g_{6}+1},\dots ,g_{6}\cdot g_{10}^{g_{10}},\dots )} 15 f ω ω + 1 + ω ω + ω + 1 ( 2 ) = f ω ω + 1 ( f ω ω ( f ω ( f 1 ( 2 ) ) ) ) ) = f ω ω + 1 ( g 7 ) {\displaystyle f_{\omega ^{\omega +1}+\omega ^{\omega }+\omega +1}(2)=f_{\omega ^{\omega +1}}(f_{\omega ^{\omega }}(f_{\omega }(f_{1}(2)))))=f_{\omega ^{\omega +1}}(g_{7})} ( 2 2 + 1 + 2 2 + 2 + 1 , … , 7 7 + 1 + 7 7 , … , g 7 g 7 + 1 , … , g 7 ⋅ g 11 g 11 , … ) {\displaystyle (2^{2+1}+2^{2}+2+1,\dots ,7^{7+1}+7^{7},\dots ,g_{7}^{g_{7}+1},\dots ,g_{7}\cdot g_{11}^{g_{11}},\dots )} 16 f ω ω ω ( 2 ) = f ω ω ω ( g 0 ) = ? {\displaystyle f_{\omega ^{\omega ^{\omega }}}(2)=f_{\omega ^{\omega ^{\omega }}}(g_{0})=?} ( 2 2 2 , … , 2 ⋅ n 2 ⋅ n 2 + 2 ⋅ n + 2 , … ) {\displaystyle (2^{2^{2}},\dots ,2\cdot n^{2\cdot n^{2}+2\cdot n+2},\dots )} ⋮ {\displaystyle \vdots } Close g 16 = f ω ω ω ( g 0 ) = f ω ω g 0 + 1 ( g 0 ) = f ω ω g 0 ⋅ ( g 0 + 1 ) ( g 0 ) = f ω ω g 0 ⋅ g 0 + g 0 + 1 ( g 0 ) = f ω ω g 0 ⋅ g 0 + g 0 g 0 + 1 ( g 0 ) = f ω ω g 0 ⋅ g 0 + g 0 g 0 ( f ω ω 2 ⋅ 2 + 2 ( g 0 ) ) = ? {\displaystyle g_{16}=f_{\omega ^{\omega ^{\omega }}}(g_{0})=f_{\omega ^{\omega ^{g_{0}+1}}}(g_{0})=f_{\omega ^{\omega ^{g_{0}}\cdot (g_{0}+1)}}(g_{0})=f_{\omega ^{\omega ^{g_{0}}\cdot g_{0}+g_{0}+1}}(g_{0})=f_{\omega ^{\omega ^{g_{0}}\cdot g_{0}+g_{0}}}^{g_{0}+1}(g_{0})=f_{\omega ^{\omega ^{g_{0}}\cdot g_{0}+g_{0}}}^{g_{0}}(f_{\omega ^{\omega ^{2}\cdot 2+2}}(g_{0}))=?} g 6 = f ω ω + ω ( 2 ) = f ω ω ( f ω ( 2 ) ) = f ω ω ( 5 ) = f ω 6 ( 5 ) = f ω 5 6 ( 5 ) = f ω 5 5 ( f ω 4 5 ( f ω 3 5 ( f ω 2 5 ( f ω 2 ( 5 ) ) ) ) ) = f ω 5 5 ( f ω 4 5 ( f ω 3 5 ( f ω 2 5 ( 2 B + 1 − 1 ) ) ) ) = f ω 5 5 ( f ω 4 5 ( f ω 3 5 ( f ω 2 4 ( 2 2 B + 1 − 1 − 1 ) ) ) ) = f ω 5 5 ( f ω 4 5 ( f ω 3 5 ( f ω 2 3 ( 2 2 2 B + 1 − 1 − 1 − 1 ) ) ) ) {\displaystyle {\begin{array}{rcl}g_{6}&=&f_{\omega ^{\omega }+\omega }(2)=f_{\omega ^{\omega }}(f_{\omega }(2))\\&=&f_{\omega ^{\omega }}(5)=f_{\omega ^{6}}(5)=f_{\omega ^{5}}^{6}(5)\\&=&f_{\omega ^{5}}^{5}(f_{\omega ^{4}}^{5}(f_{\omega ^{3}}^{5}(f_{\omega ^{2}}^{5}(f_{\omega ^{2}}(5)))))\\&=&f_{\omega ^{5}}^{5}(f_{\omega ^{4}}^{5}(f_{\omega ^{3}}^{5}(f_{\omega ^{2}}^{5}(2^{B+1}-1))))\\&=&f_{\omega ^{5}}^{5}(f_{\omega ^{4}}^{5}(f_{\omega ^{3}}^{5}(f_{\omega ^{2}}^{4}(2^{2^{B+1}-1}-1))))\\&=&f_{\omega ^{5}}^{5}(f_{\omega ^{4}}^{5}(f_{\omega ^{3}}^{5}(f_{\omega ^{2}}^{3}(2^{2^{2^{B+1}-1}-1}-1))))\\\end{array}}} Related Articles