๐งต Biggest number championship
Anonymous at Tue, 12 Mar 2024 12:16:43 UTC No. 16069911
Write the biggest number you can ITT. Biggest one wins. I'll go first: 10^1000
Anonymous at Tue, 12 Mar 2024 12:26:37 UTC No. 16069915
>>16069911
1+10^1000
Anonymous at Tue, 12 Mar 2024 12:29:44 UTC No. 16069917
Biggest in base 62
Anonymous at Tue, 12 Mar 2024 12:31:01 UTC No. 16069918
>>16069917
Wait, no. Biggest1 in base 62.
Anonymous at Tue, 12 Mar 2024 12:38:58 UTC No. 16069924
MMMCMXCIX
Anonymous at Tue, 12 Mar 2024 12:44:42 UTC No. 16069930
0-1
Anonymous at Tue, 12 Mar 2024 13:01:15 UTC No. 16069958
>>16069911
Tree(3)
Barkon at Tue, 12 Mar 2024 13:12:47 UTC No. 16069977
You buffoon's ladies. You can't get a unit higher than four thousand quadrillion.
Anonymous at Tue, 12 Mar 2024 13:25:33 UTC No. 16070004
>>16069911
TREE(10^googolplexplex)
Anonymous at Tue, 12 Mar 2024 13:27:45 UTC No. 16070005
>>16070004
>>16069915
>>16069917
>>16069918
>>16069924
>>16069930
>>16069958
these + 1
Anonymous at Tue, 12 Mar 2024 13:29:17 UTC No. 16070011
1 divided by 0
Anonymous at Tue, 12 Mar 2024 13:37:12 UTC No. 16070023
>>16069911
Tree(69!)!
Anonymous at Tue, 12 Mar 2024 13:38:26 UTC No. 16070025
(Tree(Tree(69))!)^10000000000000000
Anonymous at Tue, 12 Mar 2024 13:42:38 UTC No. 16070030
>>16070025
Mine is still bigger cuz u forgot first !
Anonymous at Tue, 12 Mar 2024 13:43:22 UTC No. 16070032
Let G be grahams generating function. Such that G(0) = 3 [ 4 Knuth up arrows] 3 and G(n) = 3 [G(n-1) Knuth up arrows] 3
Define function chain such that chain(f, n, c) represents n recursive calls of of f with initial value c. chain(f, 3, 0) for example is f(f(f(0)))
chain(G, G(64), 0) is my submission
Anonymous at Tue, 12 Mar 2024 13:45:21 UTC No. 16070036
>>16069911
1 / 0
Anonymous at Tue, 12 Mar 2024 13:47:50 UTC No. 16070039
>>16070011
>>16070036
That doesn't result in infinity.
Anonymous at Tue, 12 Mar 2024 14:03:10 UTC No. 16070060
Let L(n) be the largest number that can be generated with n characters of ANSI C running on a modern computer with infinite memory. Run time of the program is irrelevant so long as it always halts.
L(L(10^1000))
Anonymous at Tue, 12 Mar 2024 14:03:54 UTC No. 16070062
>>16070032
Thats not a numberr
Anonymous at Tue, 12 Mar 2024 14:06:32 UTC No. 16070066
>>16070062
Nigger you know that a function outputs a number right?
๐๏ธ Anonymous at Tue, 12 Mar 2024 14:07:58 UTC No. 16070074
googl!^googl!^googl!
Anonymous at Tue, 12 Mar 2024 14:10:54 UTC No. 16070082
(googol!^googol!^googol!^googol!)!
Anonymous at Tue, 12 Mar 2024 14:11:31 UTC No. 16070085
>>16070074
>>16070082
Freshman tier submission
Anonymous at Tue, 12 Mar 2024 14:22:20 UTC No. 16070104
>>16070060
this + 1
Anonymous at Tue, 12 Mar 2024 14:26:21 UTC No. 16070110
Anonymous at Tue, 12 Mar 2024 14:26:39 UTC No. 16070111
>>16070060
This to the power of this >>16070082
Anonymous at Tue, 12 Mar 2024 14:34:03 UTC No. 16070122
99999999999999999999999999999999999
Anonymous at Tue, 12 Mar 2024 14:35:14 UTC No. 16070126
>>16070122 me
>Write the biggest number you can
I'm technically right
Barkon at Tue, 12 Mar 2024 14:35:50 UTC No. 16070127
>>16070126
It's over 9000
Anonymous at Tue, 12 Mar 2024 15:07:59 UTC No. 16070165
>>16070060
This is just an evasive way of saying "the biggest possible number is the biggest possible number"
Barkon !otRmkgvx22 at Tue, 12 Mar 2024 15:08:56 UTC No. 16070167
The 13th pluralization.
Anonymous at Tue, 12 Mar 2024 15:16:51 UTC No. 16070173
Let J be the number of times a merchant has rubbed his hands together in satisfaction after closing a lucrative business deal, and let N be the number of times a diverse male has skipped town after impregnating a female.
J^N
Anonymous at Tue, 12 Mar 2024 15:28:18 UTC No. 16070183
>>16070173
Way to kill the thread. No one can compete with this.
Anonymous at Tue, 12 Mar 2024 15:50:54 UTC No. 16070220
8 but sideways
Anonymous at Tue, 12 Mar 2024 20:36:46 UTC No. 16070684
-1/12
which is the sum of all positive integers.
/thread
Anonymous at Tue, 12 Mar 2024 20:47:43 UTC No. 16070697
>>16070060
Pretty sure this wins. Though I would do it without the CS/programming nonsense and redefine L st. L(n) is the largest number that can be generated using n symbols that are either decimal digits or widely accepted R->R functions. The growth rate will be slower I think but the gist is the same. It encapsulates every other method for constructing a number so it's just a question of the constant you use as input.
Anonymous at Tue, 12 Mar 2024 22:35:12 UTC No. 16070874
>>16070684
-1/12 + 1
Anonymous at Tue, 12 Mar 2024 22:40:10 UTC No. 16070881
>>16070874
11/12 is quite meh. not even fucking 1
Anonymous at Tue, 12 Mar 2024 22:40:11 UTC No. 16070882
>>16070005
But 0-1+1 is just 0.
Anonymous at Tue, 12 Mar 2024 22:55:16 UTC No. 16070902
>>16070111
This + 1
Anonymous at Tue, 12 Mar 2024 23:30:31 UTC No. 16070947
"The biggest possible number that is possible to be the output of a C program containing at most TREE(Graham's number) characters."
Anonymous at Tue, 12 Mar 2024 23:39:15 UTC No. 16070960
the size of ur moms butt lol
Anonymous at Tue, 12 Mar 2024 23:49:36 UTC No. 16070975
>>16070955
[Tree(Graham's number)][Tree(Graham's number)][5]
Anonymous at Wed, 13 Mar 2024 00:01:52 UTC No. 16071004
Anonymous at Wed, 13 Mar 2024 00:08:49 UTC No. 16071016
the number of cocks that OP sucked
Anonymous at Wed, 13 Mar 2024 01:53:23 UTC No. 16071183
the first fixed point of f(x) = x + 1
>this number + 1
nice try. that's just my number again
Anonymous at Wed, 13 Mar 2024 01:53:28 UTC No. 16071184
>>16070173
Beautiful.
Anonymous at Wed, 13 Mar 2024 02:07:44 UTC No. 16071221
Anonymous at Wed, 13 Mar 2024 02:13:29 UTC No. 16071240
Tree(Tree(Tree(...
I can prove this limit exists.
Anonymous at Wed, 13 Mar 2024 02:48:17 UTC No. 16071318
>>16071240
Tree(Tree(Tree(... isn't a limit. Also, if the process is repeated endlessly, as denoted by ..., you can't even prove the limit of the process exists. Also also, you can't take the limit of the Tree function, because it's only defined at natural numbers.
Anonymous at Wed, 13 Mar 2024 02:58:44 UTC No. 16071331
>>16069958
>Tree(3)
epic fail.
You mean TREE(3), although it isn't even a precisely defined number. All we know is it isn't infinite.
Anonymous at Wed, 13 Mar 2024 13:08:30 UTC No. 16071965
>>16071318
You're wrong all the way? Although this recursively defined sequence is unbounded because tree(n) is monotonically increasing so the limit doesnt exist. It is not "defined by ..."
Anonymous at Wed, 13 Mar 2024 13:09:03 UTC No. 16071968
1
Anonymous at Wed, 13 Mar 2024 13:13:22 UTC No. 16071976
>>16069911
10^100^100^100^100^100^100^100^100^
Anonymous at Wed, 13 Mar 2024 18:17:27 UTC No. 16072467
>>16071976
Is this the largest one so far?
๐๏ธ Anonymous at Wed, 13 Mar 2024 18:24:49 UTC No. 16072482
9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9
Anonymous at Wed, 13 Mar 2024 18:27:49 UTC No. 16072492
9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9^9
Anonymous at Wed, 13 Mar 2024 18:29:03 UTC No. 16072496
>>16069911
>>16072467
>>16072492
What do I win?
Anonymous at Wed, 13 Mar 2024 18:30:50 UTC No. 16072500
OVER 9000
Anonymous at Wed, 13 Mar 2024 18:54:03 UTC No. 16072549
9!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Anonymous at Wed, 13 Mar 2024 18:58:45 UTC No. 16072558
-1
Anonymous at Wed, 13 Mar 2024 20:04:15 UTC No. 16072735
TREE(Graham's number)!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Anonymous at Wed, 13 Mar 2024 22:33:58 UTC No. 16072988
My cock's length in meters
Anonymous at Wed, 13 Mar 2024 22:52:06 UTC No. 16073016
>>16073002
โ+1
Anonymous at Thu, 14 Mar 2024 03:12:45 UTC No. 16073381
>>16072467
No. There is literally no way to beat
>>16069930
Any answer given will be equal to or smaller than it once written out.
And you can't just +1 it cause then you end up with 0.
Anonymous at Thu, 14 Mar 2024 03:14:53 UTC No. 16073384
Every number above me and ever number below me multiplied together and added with 1
Anonymous at Thu, 14 Mar 2024 03:18:57 UTC No. 16073392
Anonymous at Thu, 14 Mar 2024 05:23:08 UTC No. 16073543
>>16069911
("summation of all the numbers that have been and will ever be expressed on 4chan that aren't an additve absorbing element")+0