Monday, August 5, 2013

An algorithm of 3s

Before I begin, I'd like to mention a little about the number 3. I would dare to say all natural patterns occur in 3s: 60 beats in a normal heart rate, 9 minutes for light to reach the earth from the sun, how the most complex physical structures are broken down in to triangles for analysis, etc.

Alarm clocks are set (in stone) to have a 9 minute snooze, and this was after decades of feedback and research.

#9 is very special:
all the internal sum of multiples of 9, they all add up to 9. Such as:
5 x 9 = 45; 4+ 5 = 9.
9 x 12 = 108; 1 + 0 + 8 = 9.

I wanted to see if there were a recurring pattern that dealt with 3s, and the very unholy number, 23. Why 23? Because it's such a marketed, and prevalent number. It's associated with the cusp of Scorpio, and kids in the Michael Jordan era became mesmerized by it.

My result was the following:
(3, 6, 9, 12, 15, 18, 21) + 2 = value 1x return 23
(26, 29, 32, 35, 38, 41, 44) + 2 = value 1y return 46
(49, 52, 55, 58, 61, 64, 67) + 2 = value 1z, return 69
**69%3==0**hold value**return to before x**
(72, 75, 78, 81, 84, 87, 90) + 2 = value 2x return 92
(95, 98, 101, 104, 107, 110, 113) + 2 = value 2y return 115
(118, 121, 124, 127, 130, 133, 136) + 2 = value 2z return 138
**138%3==0**hold value**repeat**

In order to maintain divisibility by three, and to associate three to 23, it required seven sums of three with one adjustment by adding two. Adding the two can produce an interesting array that associated the number three and 23:
[5, 31, 57, 83, 109, 135, 161]
Is the result when two is applied to ascending index across seven iterations of the algorithm.

No comments:

Post a Comment