Biggest number you can think of using 30 characters or less

Page 5 - Seeking answers? Join the AnandTech community: where nearly half-a-million members share solutions and discuss the latest tech.

Injury

Lifer
Jul 19, 2004
13,066
2
0
Originally posted by: mh47g
F^F^F^F^F^F^F^F^F^F^F^F^F^F^FF

/thread

not really... technically you could do

Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^ZZ

and say you are dong a base-36 number system.
 

jonessoda

Golden Member
Aug 3, 2005
1,407
1
0
Originally posted by: Injury
Originally posted by: mh47g
F^F^F^F^F^F^F^F^F^F^F^F^F^F^FF

/thread

not really... technically you could do

Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^ZZ

and say you are dong a base-36 number system.

And I'm pretty sure that'd still be smaller than hyper[g64](n) for any n greater than 1.
 

Lalakai

Golden Member
Nov 30, 1999
1,634
0
76
without reading through all the previous posts.........

"pi"

pi = C/(2r)

C = circumfrance of a circle
r = radius of same circle

to date, that equation does not repeat or end but will continue to calculate
 

Injury

Lifer
Jul 19, 2004
13,066
2
0
Originally posted by: jonessoda
Originally posted by: Injury
Originally posted by: mh47g
F^F^F^F^F^F^F^F^F^F^F^F^F^F^FF

/thread

not really... technically you could do

Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^ZZ

and say you are dong a base-36 number system.

And I'm pretty sure that'd still be smaller than hyper[g64](n) for any n greater than 1.

No doubt, but with him saying "/thread" like he was so smooth doing hexadecimal that was the best example to denounce his example as "not so smooth".
 

JTsyo

Lifer
Nov 18, 2007
11,723
880
126
Originally posted by: Injury
Originally posted by: mh47g
F^F^F^F^F^F^F^F^F^F^F^F^F^F^FF

/thread

not really... technically you could do

Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^Z^ZZ

and say you are dong a base-36 number system.

Why stop there? Why not work in base Graham's number? Sure you'll have to waste some characters defining the last digit int he base.