Post the largest number you can!

BB(BB(12345)) is larger than that.

Big black

-1/12

Let [math] G [/math] denote Grahams number.

Let [math] A [/math] denote the Ackerman function.

[math] \displaystyle{\Bigg((G!)^{G!^{G!}} \cdot \prod_{k = 1}^{10^9} A(k)\Bigg)!} [/math]

Any of you geniuses know the factorial of grahams number?

Let [math]G[/math] and [math]A[/math] be as in let [math]\epsilon>0[/math].
[eqn] \left((G!)^{G!^{G!}}\cdot\prod_{k=1}^{10^6}A(k)\right)!+\frac{\epsilon}{{\left((G!)^{G!^{G!}}\cdot\prod_{k=1}^{10^6}A(k)\right)!}^{\underbrace{{\left((G!)^{G!^{G!}}\cdot\prod_{k=1}^{10^6}A(k)\right)!}^{⋰^{\left((G!)^{G!^{G!}}\cdot\prod_{k=1}^{10^6}A(k)\right)!}}}}_{\quad \text{raised $\left((G!)^{G!^{G!}}\cdot\prod_{k=1}^{10^6}A(k)\right)!$ times}}} [/eqn]

0,00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001

Knuth's up-arrow notation, for anyone curious.

OP's mom's waist line.

BOOOm

the number of dicks your mom sucked in the last second

I was too slow on the mom joke

The biggest number that can be defined in a Veeky Forums post plus the biggest number that can be defined in a Veeky Forums post.

10^250

limsup(1/x, x... 0)

One of the most beautiful post on Veeky Forums so far.

Kek

157

Wait no 160

0

cause look if you consider 0 to be the set of every single number and its negative

No shit numberphile kiddo.

about tree fiddy

8

3^^^^3

[math]\mathrm{TREE}(\sum all\ the\ numbers\ in\ this\ thread)[/math]

[math]Value([/math][math]) + 1[/math]

Too soon

[eqn]
max\{\,n\in \mathbb{N} :\, (n \notin \mathbb{P})\, \wedge \, \neg(n=p+2x^2,~p \in \mathbb{P},\; x \in \mathbb{N})\}
[/eqn]

rekt

[math]\displaystyle\sum_{n=1}^{\infty} \mathbb{N}[/math]

The sum of all numbers in this thread

>The sum of all numbers in this thread
*1

2222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222

I think you meant PLUS one, multiplying it by one does nothing.

Prove it :^)

[math] 3.14 [/math]

SEVEN

1 + max {x | x has been named in this thread}

Checkmate faggotz, École Normale Supérieure ftw

Five, because without five, I couldn't even count to six

34

2 + max { x | x has been named in this thread}

-infinity - 1

you dind't say no negative infinity

Let G be grahams number [math]G\uparrow^{G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G*G)}G[/math]

is this the biggest so far itt?

These dubs

You do realize that if you just typed 9^9^9.... With the same amount of space, you'd have a way bigger number?

TREE(TREE(TREE(TREE(G(G(G(64)!)!)!)!)!)!)!

Woah

Your^mom

>No 42

ℵ^ℵ

X where X is defined as larger than any number that has been posted here and will be posted here.

+1

5000

2n, where n is equal to the current largest number posted in this thread

ℵ^ℵ^ℵ

Let [math]j[/math] be defined as the unique solution to "post the largest number you can!".
[math]j[/math]

[math]j[/math] +1

[math]\frac{1}{\epsilon}[/math]

The smallest number bigger than any finite number named by an expression in the language ofset theorywith agoogolsymbols or less.

the sum of all the numbers in this thread

Let [math]U[/math] be the set in which OPs post is based. Let [math]j'[/math] be defined as the unique solution to "post the largest number you can!" which satisfies [math]\forall x\in U(x \leq j')[/math] and that for any such number [math]j'+1[/math] we have [math]j'+1\not\in U[/math], meaning it is not a solution to OPs post

mersenne.org/primes/digits/M74207281.zip

All GETs in the history of Veeky Forums combined

How quantifiably a faggot OP is

-1
brainlets will not understand this

G=":Graham's Number:"
F[0]=F[G];
F[n]=F[n-1]!;
F[G]];

i need that scarf, it's cute

My answer is this:
plus this:
plus this:
plus this:
plus this:
plus this:
plus this

()^2

Shots fired

[math] \Big( (\text{the value of } [/math] [math] )\left.{}^{(\text{the value of })^{(\text{the value of })}}\right)\underbrace{!!!!!!!!!!!!!!\cdots!!!!!!!!!!!!!!}_{\text{(the value of ) times}} [/math]

It's not gonna look cute on you man

Sum( all numbers and algorithms mentioned in this thread)+1

Oh shit I found a loophole to my solution.

-∞
Haha fucking reggd kunt. u loose most

>operation, sum and set fags
those arent numbers

is winning so far

My answer is this
()^

The number that is greater than the one I am currently refering to.

i hope it does, and i don't know you

-1/12

You're a guy on Veeky Forums who thinks a scarf will look cute on him

>no infinity
almost infinity

>Prove it :^)
Easy. BB is monotone, so BB(BB(12345)) is larger than BB(TREE(GRAHAMS#(||...|)(TREE(GRAHAMS#))^TREE(GRAHAMS#) if and only if BB(12345) is larger than TREE(GRAHAMS#(||...|)(TREE(GRAHAMS#))^TREE(GRAHAMS#) .
Now, TREE(GRAHAMS#(||...|)(TREE(GRAHAMS#))^TREE(GRAHAMS#) is computable, and can easily be computed by a program far shorter than 12345 states. Thus, BB(12345) is larger.

doesn't exist

[eqn]x[/eqn]
[math]\text{Where }x \text{ is the largest possible number described by a Veeky Forums post}[/math]

[math]\left\{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}\right\}[/math]

it's not like i don't have any scarfs for summer

and you don't know if i'm a guy

9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9^{9}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}

ITT: branlets who cant read