Why is Graham's number a factor of 3?

  • Context: Undergrad 
  • Thread starter Thread starter BWV
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around Graham's number, particularly its relationship to the number 3 and the mathematical implications of this association. Participants explore the nature of Graham's number, its significance in mathematical proofs, and the connections to combinatorial geometry involving vertices and edges of hypercubes. The conversation includes speculative reasoning about the growth of large numbers and comparisons with other large number concepts, such as TREE(3).

Discussion Character

  • Exploratory
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants describe Graham's number as incomprehensibly large and note its role as an upper bound in combinatorial problems involving hypercubes and coplanar vertices.
  • Others speculate that the connection to the number 3 may relate to the ways four vertices can be connected or to geometric interpretations involving regions created by these vertices.
  • There are mentions of the growth rates of functions and conjectures about the relationships between TREE(3) and Graham's number, with some suggesting that TREE(3) grows much faster than G(64).
  • Some participants express confusion about the title of the thread, arguing that it should refer to Graham's number as a power of 3 rather than a factor.
  • There are references to external resources, including articles and videos, that may provide additional insights into the topic.

Areas of Agreement / Disagreement

Participants express differing views on the significance of the number 3 in relation to Graham's number, with some agreeing that it is a power rather than a factor. The discussion remains unresolved regarding the exact reasoning behind the choice of 3 and its implications.

Contextual Notes

Some participants note that the relationships and growth rates discussed depend on specific mathematical definitions and assumptions, which may not be universally agreed upon. The complexity of the concepts involved may lead to varying interpretations.

BWV
Messages
1,667
Reaction score
2,012
Grahams Number, the largest number used in a mathematical proof (so large you can't even comprehend how $&%ing big it is), is a factor of 3 (I.e. g1= 3^^^^3 using the ^ for the Knuth up-arrow notation and grahams number = g64 where each step from g1 to 64 the number of arrows is iterated from the previous number, so g1 is incomprehensible and g2 has g1 number of ^'s and so on)

the number is the upper bound to the problem:

Connect each pair of geometric vertices of an n-dimensional hypercube to obtain a complete graph on 2n vertices. Colour each of the edges of this graph either red or blue. What is the smallest value of n for which every such colouring contains at least one single-coloured complete subgraph on four coplanar vertices?
 
Mathematics news on Phys.org
Here’s a fascinating discussion of Graham’s number although I couldn’t find why exactly it’s based on 3:

https://waitbutwhy.com/2014/11/1000000-grahams-number.html

Looking at the problem and it’s 4 coplanar vertices, it seems it’s most likely related to the 3 ways these four vertices can be connected. As an example, given vertices A,B,C,D then the connections would be AB,AC,AD but this is only a guess. It could also be related to the spaces divided up by these vertices like a tetrahedron projected onto a plane with one vertex in the center then connecting lines divide up the plane into 3 regions.
 
Last edited:
  • Like
Likes   Reactions: pinball1970
That is a great link - its where I learned what little I know about it.
 
  • Like
Likes   Reactions: pinball1970 and jedishrfu
BWV said:
That is a great link - its where I learned what little I know about it.

I made the mistake of catching numberphile on this googling it then watching More you tube posts then finally physics forums.

I have been trying to get my head round it ever since

Grahams number is insane, just picturing the structure is insane, 3|||3 makes a googolplex look small. I would like to know how they know now Tree(3) is so much bigger.
Not much on the net I can grasp
 
You might find something useful in the Quora discussion:

https://www.quora.com/Is-Tree-3-bigger-than-Graham’s-number

There's a set of videos referenced in the post but like the number itself may take a long time to view and reflect upon before you feel you've found an answer to your question.

Popular Mechanics article on it:

https://www.popularmechanics.com/science/math/a28725/number-tree3/

Alternatively, this video below attempt to answer the question in 10 minutes:



and this Numberphile video:

 
Last edited:
  • Like
Likes   Reactions: pinball1970
Ok so what about G(Tree(3)) vs Tree(G64)? ?:)
 
This might be conjectured by analogy:

We consider two functions ##f(x) = x^2## versus ##g(x) = e^x## and then ask ## f(g(x)) <?> g(f(x)) ## if so then:

Is there a theorem that encapsulates the notion of function growth which in our case g(x) >> f(x) as x gets very large does that imply g(f(x)) will grow much faster than f(g(x))?​

Using DESMOS, it seems that ##g(f(x)) = e^{x^2}## grows faster than ##f(g(x) = (e^x)^2## which upon rewriting f(g(x)) = e^{2x} and noting that ##x^2## grows much faster than ##2x##

so that would imply that given ##TREE(3) >> G(64)## then ##TREE(G64)## grow much faster than ##G(TREE(3))##

Perhaps @Mark44 or @fresh_42 can comment here.
 
  • Like
Likes   Reactions: BWV
My only comment is that the thread title is misleading: "Why is Graham's number a factor of 3?"

Since 3 is a prime, its only integer factors are itself and 1. A better thread title would be "Why is Graham's number a power of 3?
 
  • Like
Likes   Reactions: jbriggs444
BWV said:
Ok so what about G(Tree(3)) vs Tree(G64)? ?:)
That's cheating ha ha! I think the fact these enormous numbers have been used in proofs and the fact they are finite makes them interesting.
Also the way the arrow notation escalates so wildly after only a couple of terms.
The comparisons of what some the numbers could represent and the fact Grahams leaves physical reality pretty quickly is mind boggling.
 
  • #11
jedishrfu said:
You might find something useful in the Quora discussion:

https://www.quora.com/Is-Tree-3-bigger-than-Graham’s-number

There's a set of videos referenced in the post but like the number itself may take a long time to view and reflect upon before you feel you've found an answer to your question.

Popular Mechanics article on it:

https://www.popularmechanics.com/science/math/a28725/number-tree3/

Alternatively, this video below attempt to answer the question in 10 minutes:



and this Numberphile video:



Thanks

Understanding is not the right word but at least this has given me a glimpse of how fast these beasts can grow.
 
  • #12
Mark44 said:
My only comment is that the thread title is misleading: "Why is Graham's number a factor of 3?"

Since 3 is a prime, its only integer factors are itself and 1. A better thread title would be "Why is Graham's number a power of 3?

Why is it 3? 4 seems to make more sense, sides and vertices.
 
  • #13
Most likely 1 and 2 were trivial but 3 produced interesting math results.

Also 4 is a multiple of 2 and so may not have been interesting enough.
 
  • Like
Likes   Reactions: pinball1970

Similar threads

  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 27 ·
Replies
27
Views
7K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K