Discuss Scratch
- Discussion Forums
- » Things I'm Reading and Playing
- » Graham's number (g64) and other extremely big numbers
- excelguru
-
1000+ posts
Graham's number (g64) and other extremely big numbers
READ THIS FIRST: don't delete this. I thought I wanted to but I changed my mind.
Superlooper notation
[a,b]1 = a^b
[a,b]c = a↑↑…↑↑b (c ↑s)
[a,b][1] = a{↑}b
Oopayu = [100,100]1
Doopayu = [100,oopayu]1
Troopayu = [100,doopayu]1
Oopayadu = [100,100]2
Doopayadu = [100,oopayadu]2
Oopayatru = [100,100]3
Fuvoogaih = [100,100][1]
Duvoogaih = [100,fuvoogaih][1]
Truvoogaih = [100,duvoogaih][1]
Fuvoodugaih = [100,100][2]
Fuvootrigaih = [100,100][3]
Fuvoogaidus = [100,100][[1]]
Duvoodugaidus = [100,[100,100][[2]]][[2]]
Truvootrigaitris = [100,[100,[100,100][[[3]]]][[[3]]]][[[3]]]
Queegalog = [100,100][1,2]
Superlooper notation
[a,b]1 = a^b
[a,b]c = a↑↑…↑↑b (c ↑s)
[a,b][1] = a{↑}b
Here is how it progresses:
1,2,3,4,...
[1],[2],[3],[4],...
[[1]],[[2]],[[3]],[[4]],...
[1,2]
[2,2]
[3,2]
[[1],2]
[[2],2]
[[1,2],2]
[[[1,2],2],2]
[1,3]
[1,4]
[1,5]
[1,1,2]
[1,1,1,2]
And the definition? This function is hard to define, but at least I understand it
And the numbers:
Oopayu = [100,100]1
Doopayu = [100,oopayu]1
Troopayu = [100,doopayu]1
Oopayadu = [100,100]2
Doopayadu = [100,oopayadu]2
Oopayatru = [100,100]3
Fuvoogaih = [100,100][1]
Duvoogaih = [100,fuvoogaih][1]
Truvoogaih = [100,duvoogaih][1]
Fuvoodugaih = [100,100][2]
Fuvootrigaih = [100,100][3]
Fuvoogaidus = [100,100][[1]]
Duvoodugaidus = [100,[100,100][[2]]][[2]]
Truvootrigaitris = [100,[100,[100,100][[[3]]]][[[3]]]][[[3]]]
Queegalog = [100,100][1,2]
Last edited by excelguru (July 15, 2015 01:57:45)
- ev3coolexit987654
-
1000+ posts
Graham's number (g64) and other extremely big numbers
What is a{↑}b
- excelguru
-
1000+ posts
Graham's number (g64) and other extremely big numbers
a↑↑…↑↑a with b arrows What is a{↑}b
- JeeJeeHogMole724
-
52 posts
Graham's number (g64) and other extremely big numbers
TREE(Graham's Number) But G(64) is huge and G(n) is fast growing but TREE(n) is faster. TREE(3) is way way way way way way bigger than graatagold so TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(3))))))))))))))))))))))))))))))))))))))))move (That number before lol) steps
play sound [Same number (gasps)] until done
- excelguru
-
1000+ posts
Graham's number (g64) and other extremely big numbers
TREE(TREE(…(TREE(TREE(Graham's number)))…)) with TREE(Graham's number) TREEsTREE(Graham's Number) But G(64) is huge and G(n) is fast growing but TREE(n) is faster. TREE(3) is way way way way way way bigger than graatagold so TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(TREE(3))))))))))))))))))))))))))))))))))))))))move (That number before lol) steps
play sound [Same number (gasps)] until done
- Vetpetmon
-
1000+ posts
Graham's number (g64) and other extremely big numbers
Pi, of course.
- MathlyCat
-
1000+ posts
Graham's number (g64) and other extremely big numbers
It's like when Cavemen smeared “paints” on cave walls, they had no clue except that they were the Picaso of 20,000 B.C. Oh look.
Humanity created something they can't comprehend again.
History Jokes, somehow this one is funny…
g64 reminds me of a conversation about the existence of us, and why did Mother Earth keep us…
- ev3coolexit987654
-
1000+ posts
Graham's number (g64) and other extremely big numbers
big number incoming (you gotta deal with the pseudocode):
Whoops sorry if nobody understood
biggestintever i = 100;
define int lelz (MathFUNCTION mf, biggestintever j){return mf(mf(...(mf(j) nummfs = mf(mf(mf(j)));}
while true{
i = lelz(TREE, lelz(TREE, lelz(TREE... lelz(TREE, i)) with lelz(19999999) layers;
whateverthatwas swap(TREE,Grahamsfunction);
}
- CatsUnited
-
1000+ posts
Graham's number (g64) and other extremely big numbers
What do you mean? G(64), Googol and even 10 are larger than pi. Pi, of course.
- BaconAndEggs1
-
1000+ posts
Graham's number (g64) and other extremely big numbers
I think they were just confused and brought it up because of its infinite decimal places. I can understand the hilarity behind the situation since the number is just three.What do you mean? G(64), Googol and even 10 are larger than pi. Pi, of course.
- excelguru
-
1000+ posts
Graham's number (g64) and other extremely big numbers
One may say “pi with the decimal point removed” but that is an infinity so it is cheating.I think they were just confused and brought it up because of its infinite decimal places. I can understand the hilarity behind the situation since the number is just three.What do you mean? G(64), Googol and even 10 are larger than pi. Pi, of course.
- excelguru
-
1000+ posts
Graham's number (g64) and other extremely big numbers
A bold italic underlined strikethrough?
- excelguru
-
1000+ posts
Graham's number (g64) and other extremely big numbers
ORCHARD(n) = TREE(TREE(…(TREE(TREE(3)))…)) with n TREEs
Then…
TREE1(n) = TREE(n)
TREE2(n) = ORCHARD(n)
TREEm+1(n) = TREEm(TREEm(…(TREEm(TREEm(3)))…)) with n TREEs
G!(n) = G(n)!!!…!!! with G(n) factorials
G!!(n) = G!(n)!!!…!!! with G!(n) factorials
G!!!(n) = G!!(n)!!!…!!! with G!!(n) factorials
…
Ultimate Grahamfactorial number:
G!!!…!!!(2352947) with G!!!…!!!(245352) factorials with G!!!!!!!!!!!(725464)!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! factorials
Even better define n# as n^n and get G#, G##, and get the ultimate Grahampowerial number!
Or define G…!(n) = G…(n)!!!…!!! with G…(n) factorials and G…#(n) = G…(n)###…### with G…(n) #'s! That's right, we're going mixed!
My ultimate Grahamfactpowerial number is G#!###!#!##!!#!!(22535353535)
Then…
TREE1(n) = TREE(n)
TREE2(n) = ORCHARD(n)
TREEm+1(n) = TREEm(TREEm(…(TREEm(TREEm(3)))…)) with n TREEs
G!(n) = G(n)!!!…!!! with G(n) factorials
G!!(n) = G!(n)!!!…!!! with G!(n) factorials
G!!!(n) = G!!(n)!!!…!!! with G!!(n) factorials
…
Ultimate Grahamfactorial number:
G!!!…!!!(2352947) with G!!!…!!!(245352) factorials with G!!!!!!!!!!!(725464)!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! factorials
Even better define n# as n^n and get G#, G##, and get the ultimate Grahampowerial number!
Or define G…!(n) = G…(n)!!!…!!! with G…(n) factorials and G…#(n) = G…(n)###…### with G…(n) #'s! That's right, we're going mixed!
My ultimate Grahamfactpowerial number is G#!###!#!##!!#!!(22535353535)
Last edited by excelguru (July 20, 2015 00:46:12)
- Discussion Forums
- » Things I'm Reading and Playing
-
» Graham's number (g64) and other extremely big numbers