Question

Can someone explain TREE(3) in extremely simple terms?

score 1.4k · Answer 1 · 2026-03-25 07:32:21

1.4k

Views

Can someone explain TREE(3) in extremely simple terms?

Published on 25 Mar 2026 - 7:32

score 255 · Answer 2 · 2026-03-25 16:01:59

255

Views

Rightmost decimal digits of Graham's number

Published on 25 Mar 2026 - 16:01

score 185 · Answer 3 · 2026-03-25 06:05:40

185

Views

Can I avoid the overflow which I get with the digits of $f_3(3)$?

Published on 25 Mar 2026 - 6:05

score 223 · Answer 4 · 2026-05-10 15:47:45

223

Views

Is 2(6)3 (2↑↑↑↑3) equal to 2^65536? And if yes, is 2(n)3 equal to 2 to the power of how many time 2 is repeated in the power tower?

Published on 10 May 2026 - 15:47

score 88 · Answer 5 · 2026-04-09 11:23:03

88

Views

There exists infinitely many primes formed of 2^(F[n!+1])-1

Published on 09 Apr 2026 - 11:23

score 88 · Answer 6 · 2026-03-25 07:46:26

88

Views

What information about the factors of a big number can be gained in a couple of minutes?

Published on 25 Mar 2026 - 7:46

score 78 · Answer 7 · 2026-03-25 05:58:57

78

Views

Big number short representation / approximation

Published on 25 Mar 2026 - 5:58

score 355 · Answer 8 · 2026-04-05 22:28:05

355

Views

Comparing large exponents.

Published on 05 Apr 2026 - 22:28

score 198 · Answer 9 · 2026-03-25 06:02:21

198

Views

Do formulas use unary functions in first-order oodle theory?

Published on 25 Mar 2026 - 6:02

score 89 · Answer 10 · 2026-03-25 06:05:38

89

Views

is it possible to calculate mod of a very long number manually?

Published on 25 Mar 2026 - 6:05

score 418 · Answer 11 · 2026-03-25 06:04:48

418

Views

In what sense would Graham's tree be virtually the same as TREE(3)?

Published on 25 Mar 2026 - 6:04

score 47 · Answer 12 · 2026-03-25 06:06:17

47

Views

How many ways can you set the table for 2 people with n distinct cups and r distinct plates?

Published on 25 Mar 2026 - 6:06

score 558 · Answer 13 · 2026-03-25 06:01:46

558

Views

Will this function grow faster than Busy Beavers as $n \to \infty$

Published on 25 Mar 2026 - 6:01

score 480 · Answer 14 · 2026-03-25 06:07:13

480

Views

How big are $f_3(3)$ and $f_4(4)$ in the fast growing hierarchy?

Published on 25 Mar 2026 - 6:07

score 47 · Answer 15 · 2026-03-25 06:04:16

47

Views

Is there a property relating gcd(a, b) % c and gcd(a %c, b%c) % c. Here all a,b,c are natural numbers i.e.>0 and '%' represents modulo operator.

Published on 25 Mar 2026 - 6:04

List Question

Can someone explain TREE(3) in extremely simple terms?

Rightmost decimal digits of Graham's number

Can I avoid the overflow which I get with the digits of $f_3(3)$?

Is 2(6)3 (2↑↑↑↑3) equal to 2^65536? And if yes, is 2(n)3 equal to 2 to the power of how many time 2 is repeated in the power tower?

There exists infinitely many primes formed of 2^(F[n!+1])-1

What information about the factors of a big number can be gained in a couple of minutes?

Big number short representation / approximation

Comparing large exponents.

Do formulas use unary functions in first-order oodle theory?

is it possible to calculate mod of a very long number manually?

In what sense would Graham's tree be virtually the same as TREE(3)?

How many ways can you set the table for 2 people with n distinct cups and r distinct plates?

Will this function grow faster than Busy Beavers as $n \to \infty$

How big are $f_3(3)$ and $f_4(4)$ in the fast growing hierarchy?

Is there a property relating gcd(a, b) % c and gcd(a %c, b%c) % c. Here all a,b,c are natural numbers i.e.>0 and '%' represents modulo operator.

Trending Questions

Popular # Hahtags

Popular Questions