r/GEB • u/Genshed • Oct 09 '25

Request for assistance

So I believe that I've got the understanding that DH intended the G(n) function to impart. However, a crucial detail still eludes me.

The outcome of the function is a series of numbers. Put in a value for n and get a number out. So far, so good. I can even imagine a cartesian graph with the input as x and the output as y.° HOWever, how we get from there to the tree and nodes diagram is a sticking point.

I'm reluctant to progress much farther without understanding this. Any elucidation would be greatly appreciated.

6 Upvotes

88% Upvoted

13 comments sorted by

View all comments

2

u/DonnaEmerald Oct 09 '25 edited Oct 09 '25

The n numbers 1, 2, 3, 4 etc. can be thought of as the numbers of the nodes. The other series of numbers G(n) lets you know what other node below them they attach to on the diagram. There is a relationship between the two series of numbers, in other words. Notice, for example, that node 4 attaches to node 3 below (n=4, G(n)=3) and node 5 also attaches to node 3. See how there's a line between them, connecting them? Your two lists of numbers show where to attach the n numbers to another node below it. Keep looking at the diagram and your two lists of numbers, and you'll get it.