Question

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

score 1.4k · Answer 1 · 2019-12-09 13:45:13

1.4k

Views

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

Published on 09 Dec 2019 - 13:45

score 254 · Answer 2 · 2019-12-12 14:34:54

254

Views

Rightmost decimal digits of Graham's number

Published on 12 Dec 2019 - 14:34

score 184 · Answer 3 · 2019-12-19 12:50:28

184

Views

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

Published on 19 Dec 2019 - 12:50

score 221 · Answer 4 · 2019-12-23 17:10:45

221

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 23 Dec 2019 - 17:10

score 87 · Answer 5 · 2026-02-23 02:59:30

87

Views

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

Published on 23 Feb 2026 - 2:59

score 87 · Answer 6 · 2020-01-20 12:27:04

87

Views

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

Published on 20 Jan 2020 - 12:27

score 77 · Answer 7 · 2020-01-24 11:58:26

77

Views

Big number short representation / approximation

Published on 24 Jan 2020 - 11:58

score 353 · Answer 8 · 2020-01-28 16:00:32

353

Views

Comparing large exponents.

Published on 28 Jan 2020 - 16:00

score 197 · Answer 9 · 2020-02-19 12:54:56

197

Views

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

Published on 19 Feb 2020 - 12:54

score 88 · Answer 10 · 2020-04-08 02:58:43

88

Views

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

Published on 08 Apr 2020 - 2:58

score 417 · Answer 11 · 2020-04-10 15:42:06

417

Views

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

Published on 10 Apr 2020 - 15:42

score 46 · Answer 12 · 2020-05-11 06:43:46

46

Views

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

Published on 11 May 2020 - 6:43

score 557 · Answer 13 · 2020-05-22 17:52:58

557

Views

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

Published on 22 May 2020 - 17:52

score 479 · Answer 14 · 2020-07-07 22:39:38

479

Views

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

Published on 07 Jul 2020 - 22:39

score 46 · Answer 15 · 2020-07-09 12:39:39

46

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 09 Jul 2020 - 12:39

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