[latexpage]

Note: I have no idea whether this is a load of crap or not, but at the very least its a fun mathematical adventure for nerds. Just remember to take some of the more philosophical stuff with a grain of salt and do your own research before coming to any major conclusions.

## Background

**Marko Rodin **= original founder of vortex-based mathematics

**Randy Powell **= continues the work of Rodin today

## Relevant Operations

**Modular arithmetic notation **( defined for the purposes of this article as follows)

- ⇒ addition modulo
- Example:

- ⇒ subtraction modulo
- Example:

- ⇒ multiplication modulo
- Example:

- ⇒ division modulo
- This operation is a little more complicated than the first three
- Importantly, care must be taken when using modulo division – it isn’t necesarilly a unique or sufficient operation
- e.g.,

- Steps used for calculating
- Determine the lowest possible value that results in obtaining a value which is a multiple of
- Plug in into the following expression:

- Example: find
- Givens: , ,
- is the lowest multiple of 5 we can obtain using
- Thus,

- For the purposes of this article, let’s assume we are working in modulo 9 (i.e., our normal 0,1,…,9 digit system)

**Digital sum (or root) **= an operation taken on a positive rational real number that returns an integer (we are assuming ) which corresponds to repeatedly taking the sum of all digits in repeatedly until obtaining a single digit

- Examples:

**Doubling = **pick a starting number , multiply it by two, take the digital sum of the result () and repeat the process until you get

- As it turns out, in mod 9, and starting at , we get
- Proof:
- Importantly, if we ignored the step where we take the digital sum, each value will have a digital sum corresponding to the the value it would have obtained if we did include the digital sum step
- Morover, this cycle appears as long as we choose an with a digital sum of either 1, 2, 4, 5, 7, or 8
- Example:
- Here is an image depicting this pattern as a sequence of transitions between nodes/states:
- Note: we also get this pattern from taking the digital sum of sequential powers of two
- Proof:

- Proof:

- Example:

- Proof:
- However, in mod 9, and starting at or rational numbers whose digital sum is divisible by one of these numbers, we get different patterns
- If we let , we get…

- If we let , we get…

- Thus, for any given , every can be mapped to a sigle digit using doubling

## Diagram

- Blue nodes corresponds with “physical” energy states
- Red nodes corresponds with “metaphysical” energy states

## Sources

- Rodin, M., Volk, G. (2010) The rodin number map and rodin coil.
*Proceedings of the NPA*vol 6 - https://medium.com/@weslong/introducing-synergy-sequence-theory-d14611e7c6dd
- Note: I highly recommend this webpage

- https://www.youtube.com/watch?v=Q_kAVkx6zWU
- https://www.youtube.com/watch?v=Fbyc9JW3vtk&t=88s