Skip to content

RGkevin/golden-clock

Repository files navigation


Logo

The Golden Clock

I found the tetragrammaton word YHVH (5 6 5 10) inside the Fibonacci Sequence.

Hebrew alphabet

According to hebrew gematry each letter of the Hebrew alphabet has a numerical value and the name of god יהוה has the corresponding values 5 6 5 10.

ה ו ה י
5 6 5 10

Using modular arithmetic with modulo 10 the fibonacci sequence has a 60 repeating pattern.

0 1 1 2 3 5 8 3 1 4 5 9 4 3 7
0 7 7 4 1 5 6 1 7 8 5 3 8 1 9
0 9 9 8 7 5 2 7 9 6 5 1 6 7 3
0 3 3 6 9 5 4 9 3 2 5 7 2 9 1

If you take off the numbers 0 and 5 from the sequence you got 12 groups of 4 numbers each.

- 1 1 2 3 - 8 3 1 4 - 9 4 3 7
- 7 7 4 1 - 6 1 7 8 - 3 8 1 9
- 9 9 8 7 - 2 7 9 6 - 1 6 7 3
- 3 3 6 9 - 4 9 3 2 - 7 2 9 1

If you sum the 4 digits of each group and then apply modulo 9 you got 12 numbers.

Exception: The number 9 in mod 9 is 0 but in this case we're going to use 9 instead.

- (1 + 1 + 2 + 3) = 7 - (8 + 3 + 1 + 4) = 16 = 1 + 6 = 7 - (9 + 4 + 3 + 7) = 23 = 2 + 3 = 5
- (7 + 7 + 4 + 1) = 19 = 1 + 9 = 10 = 1 + 0 = 1 - (6 + 1 + 7 + 8) = 22 = 2 + 2 = 4 - (3 + 8 + 1 + 9) = 21 = 2 + 1 = 3
- (9 + 9 + 8 + 7) = 33 = 3 + 3 = 6 - (2 + 7 + 9 + 6) = 24 = 2 + 4 = 6 - (1 + 6 + 7 + 3) = 17 = 1 + 7 = 8
- (3 + 3 + 6 + 9) = 21 = 2 + 1 = 3 - (4 + 9 + 3 + 2) = 18 = 1 + 8 = 9 - (7 + 2 + 9 + 1) = 19 = 1 + 9 = 10 = 1 + 0 = 1

Divide the 12 numbers in groups of 3.

7 7 5
1 4 3
6 6 8
3 9 1

and then sum them. You got 4 numbers: 1 8 2 4.

(7 + 7 + 5) = 19 = 1 + 9 = 10 = 1 + 0 = 1
(1 + 4 + 3) = 8
(6 + 6 + 8) = 20 = 2 + 0 = 2
(3 + 9 + 1) = 13 = 1 + 3 = 4

Result:

(1)
(8)
(2)
(4)

Now you start summing starting from number 8, and then apply modulo 9 except for the number 10:

                (8) + (2) = [10] י
[10] + (4) = [14] = 1 + 4 =   5  ה
[14] + (1) = [15] = 1 + 5 =   6  ו
[15] + (8) = [23] = 2 + 3 =   5  ה

There you go, the tetragrammaton inside the fibonacci sequence.

I made this discovery during the 2020 quarantine.

I've discovered more properties in this fibonacci sequence using modular arithmetics and even found a curious relation with the prime numbers. But I'm still working on a mathematical proof. Thanks for reading.

Copyright Kevin López | 2023