TREE(1) = 1 TREE(2) = 3 TREE(3)= 'a number much greater than Grahams number.'
Remember when your high school teachers told you x^2 increased rapidly? Try that function.
I fed 2 ^ 57885161 into my phone.
handyCalc crashed.
[QUOTE=JohnnyMo1;39509822]TREE(n) shows up in Kruskal's tree theorem, and Graham's number is an upper bound for the solution of a problem in Ramsey theory.[/QUOTE]
Ah, of course!
I read almost the whole thing and if you look at every 7th digit you might note that the number is insanely fucking huge.
[QUOTE=aVoN;39510215]Lol, I just did the same when I saw the threat. While my PC was calculating I scrolled down and saw your post.[/QUOTE]
:D
Haven't seen you around for a while
But no seriously what is TREE(4)
That number would be a huge as a standard form binary number.
Sure it's big.. but not as big as a Googolplex.
[media]http://www.youtube.com/watch?v=8GEebx72-qs[/media]
Such an amazing number.
[QUOTE=Chris220;39496376]If you read back through the thread, I already commented on this.
Huge prime numbers like these are used in encryption algorithms. You know those bank details that you'd prefer were not stolen when you make a purchase online? All protected by prime numbers.[/QUOTE]
would a number this big be actually used for those
[QUOTE=Eltro102;39522305]would a number this big be actually used for those[/QUOTE]
It's possible. The bigger the number is, the harder it could potentially be to find its prime factors, for example.
I'm not an expert on how it's all done, but a general rule of thumb is "bigger = better".
Sorry, you need to Log In to post a reply to this thread.
