Closest number to infinity.

[santa]

I will go with pi.

 

 

13.4

 

 

lol./

[AverageJoe]

 

x = infinity;

while(1){

while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){for(;{x = x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^x)))))))))))};};};};};};};};};};};};};

while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){for(;{x = x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^x)))))))))))};};};};};};};};};};};};};

while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){for(;{x = x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^x)))))))))))};};};};};};};};};};};};};

while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){while(1){for(;{x = x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^(x^x)))))))))))};};};};};};};};};};};};};

};

how about that!

 

[mahdy]

Graham. I win.

 

And di you guys mean Googol/Googolplex?

What you put referred to a company and its main office.

 

Graham. I win.

 

And di you guys mean Googol/Googolplex?

What you put referred to a company and its main office.

 

Graham's number

 

Graham's number, named after Ronald Graham, is often described as the largest number that has ever been seriously used in a mathematical proof. It is too large to express in scientific notation so it needs special notation (G) to write down. Graham's number is much larger than other well known large numbers such as a googol and a googolplex, and even larger than Moser's number, another well-known large number.

 

 

Graham's problem

Graham's number is connected to the following problem in the branch of mathematics known as Ramsey theory:

Consider an n-dimensional hypercube, and connect each pair of vertices to obtain a complete graph on 2n vertices. Then colour each of the edges of this graph using only the colours red and black. What is the smallest value of n for which every possible such colouring must necessarily contain a single-coloured complete sub-graph with 4 vertices that lies in a plane?

 

Although the solution to this problem is not yet known, Graham's number is the smallest known upper bound for it. This bound was found by Graham and B. L. Rothschild (see (GR), corollary 12). They also provided the lower bound 6, adding the qualifying understatement: "Clearly, there is some room for improvement here."

 

In Penrose Tiles to Trapdoor Ciphers, Martin Gardner wrote, "Ramsey-theory experts believe the actual Ramsey number for this problem is probably 6, making Graham's number perhaps the worst smallest-upper-bound ever discovered." More recently Geoff Exoo of Indiana State University has shown (in 2003) that it must be at least 11 and provided evidence that it is larger.

 

 

[wwe9112]

I bet it's pie, because pie is round and never ends as is infinity; it never ends.

[santa]

that is Totally of topic man...

 

you are trying get closest-

 

 

I go with

 

math43n

 

estimated as pi...

[wwe9112]

I was meaning pi you dumbass. Didn't know that there was a special way of spelling for you geeks that are so good at math.

 

ill do this.

 

9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999

[santa]

lol your just jealous because I can use proper grammar and you can't.

 

Eat that!

[njenkins3]

quattillion

[AverageJoe]

for(spam_posts = #_of_spam_posts; spam_posts <= #_of_spam_posts, spam_posts++)

{}

std::cout<< "times spamed: " << spam_posts;

[awesomegamer]

googolplexian : )

 

googol:

imagine a "1" with 100 "0"s following it.

 

googolplex:

now imagine counting to the number googol and for every interger add a following "0"

 

Just writing it out in notepad would be a file 1x10^100 bytes long, and a gigabyte is only 1x10^9 (or more appropriately 1x2^30).

 

googolplexian

Now do that same process : )

[infinity]

Or you could just do Infinity-1. But my name is Infinity, so I win already. =D

But infinity-1 would be infinity still, and any other equation relating to infinity would either be 0, infinity, or undefined.

[Kelso]

If you live in java land, 2^31 is "infinity". Flash I think is the same. In javascript it is crashing IE.

[infinity]

Rofl @

In javascript it is crashing IE.

The closest number to infinity would actually equal the time spend pressing 9s or 0s on a keyboard. So the boardest person would be the closest. =\

[Bob the Monkey]

I was meaning pi you dumbass. Didn't know that there was a special way of spelling for you geeks that are so good at math.

 

ill do this.

 

9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999

 

 

You have already been outdone by the gogolplex and graham's number.

I'm going for a googolplex^4 googolplexi * graham's number

 

 

Also, the whole "approximating at pi" thing is rubbish. Pi isn't "round". It's a constant ffs.

 

 

I will go with pi.

 

 

13.4

 

 

lol./

 

 

Holy crap learn your basic geometrical constants. 3.14159265

 

Now I'm going to the zoo. -indignant-

[JimBOB]

Infinity -1!

 

You know that has to be the closest number, lewl!