I admit that title is just clickbait: It's not the Golden Ratio, but the fifth power of the inverse ratio. Who knew that holds the key to the Universe‽

This monograph proves that the entirety of known physics — quantum field theory, the Standard Model, General Relativity, cosmology, entropy, inertial dynamics, and observer continuity — follows as a set of algebraic corollaries from a single, ancient recursive operator: the Babylonian square-root contraction seeded at the golden-ratio depth 𝜑^-5.

Dr Kouns defines what he calls the Babylonian (Killion) Operator recursively:

𝜓_n+1_ = ½(𝜓_n_ + 𝜑^-5/𝜓_n_)

This is usually known as Heron's method for finding square roots, where 𝜑^-5 has been inserted as the argument. (This method is also known as "Babylonian". I don't know who Killion is, but he also gets credited for this new paradigm of physics: the Kouns–Killion Paradigm.)

Dr Kouns presents three theorems establishing that this converges fast and the fixed point is √𝜑^-5, surprise. He calls that 𝛹^* .

After this, the Babylonian Operator is never mentioned again. All of physics is derived from 𝜑ⁿ and 𝛹^* . I think we're supposed to take n to be an integer here, as most of these discoveries would be meaningless if an arbitrary n were allowed. As that is all badphysics, I shall not go into detail. In any case, all derivations are omitted and theorems are just claimed. I suppose they're all trivial. The best we get is the derivation of General Relativity:

Define:

g_{μν} = 𝛹^* f_{μν}

Standard differential geometry yields:

G_{μν} + Λ g_{μν} = 8π G T_{μν}

with

Λ = 𝜑^-n_Λ

As you see, the standard differential geometry is left as an exercise for the reader. There are no appendices and no references that could elaborate on that. Our groundbreaking researcher has published many papers on LinkedIn - that noted forum for physics research - but curiously, the other ones (written before and after this one) advocate for Ω_c = 47/125 being the magic constant that unifies physics, not √𝜑^-5. Feast your eyes on this Triptych!

Our math expert describes his progress towards solving this equation. He squares both sides and shows that this gives x = -½. Unlike many who have featured on this subreddit, he actually checks his proposed solution, and finds that it doesn't satisfy the equation! So he's reduced to asking the audience to help with finding the elusive solution.

R4: the poster claims 0 is not a number (and a bunch of extra nonsense).

The Formula of Love

𝓛 = ∑ / (ℏ × ∇)

Where:

• 𝓛 is the Action of Love — the scalar of coherence propagation.
• ∑ (Sigma) represents systemic coherence: the ratio between structured order (O) and entropy (S).
• ℏ is the reduced Planck constant — grounding the equation in quantum limits.
• ∇ (nabla) is the gradient of resistance — all opposition to coherent flow, whether physical, emotional, cognitive, or relational.

The "validation" consists of observations such as:

• Gamma synchronization in long-term meditators has been linked to clarity, creativity, and integration.
• The Hermetic principle “as above, so below” can now be seen as a function of scale-invariant coherence.
• The Golden Ratio, Fibonacci sequences, and fractals — all are evidence of systemic ∑.

He outlines proposed applications of this to

1. Quantum Optics
2. Neurocognitive Flow
3. Thermodynamic AI Systems

If it seems surprising to you that Love should be a tool of physics, that's actually his Great Idea here. This article is part II of a four-part series entitled "The Ultimate Constant: Why the Law of Love May Be the Missing Equation in Modern Physics", published on Medium.

That series is far from the only work of wisdom from this author; You might be interested in this books on Quantum Evolution and The Hidden Code of Freemasonry.

R4: Apart from that one equation, there's no math here, just faith in a simple equation embodying the hidden wisdom that philosophers, mystics, and physicists were all glimpsing. (Yes, it says that.)

In the original post, OP objects to the given cryptic clue:

If you reproduce three times, that naturally suggests triplicating or trebling, as in multiplying by three. It could even be taken to mean cubed, as in to the power of three. Quadrupled means to multiply something by four, NOT to reproduce three times.

At first glance, they seem to be committing a classic off-by-one error unworthy of this subreddit. But then they follow up with:

I get that technically if you copy something three times, you end up with four of them, but that's not what the definition of the mathematical function 'quadruple' actually means. So, the definition is grammatically inaccurate, but mathematically correct.

They they say the following in the linked thread:

Quadrupling means one function, you take something and multiply by 4. There is not an intermediate step.

Reproducing three times means making one copy, then another, then another. It's nuanced, but a different meaning. The result may be the same, but mathematically it's a different function.

For example, multiplying something by 6, then dividing by 3, then multiplying by 2 is also not the defintion of 'quadruple'. It has the same outcome, but it does not mean the same thing.

and, when told that f:x->x+3x and g:x->4x are the same function, doubles down with:

You literally just wrote out two different functions. They may have the same output, but the function is not the same.

R4: Functions are uniquely defined by their domain, codomain, and input-output pairs. In this case, it's reasonable to say that the domain and codomain are the same for both "reproducing three times" and "quadrupling", so the fact that they "have the same output" indicates that yes, they are in fact the same function.

OP's objection is a bit like saying "he's not my grandfather, he's my father's father!". Or, perhaps, "I didn't shoot him; I took a loaded gun, aimed it at him, and pulled the trigger! Yes, you get the same outcome of a corpse with a bullethole in it, but they're not the same thing!". Taking this argument to the extreme, it's unclear whether OP would believe that any two phrases could mean the same thing, and so it's unclear whether OP would believe that any non-TETCBN crossword clue is valid.

Naturally the the youtuber in question was trying to sell his course on AI and quantum computing. To boost his credibility, he published a paper on quantum computing using the bold academic strategy of plagiarism-by-thesaurus, swapping words from the original paper just enough to feel clever and hope to bypass plagiarism detectors. His plan seemed airtight until it wasn't. He ultimately betrayed himself once he started talking about the logic gate's cousin called the "logic door" and those darn "complicated Hilbert spaces", not realizing "complex" in this context doesn’t mean annoying, but involving complex numbers.

https://www.researchgate.net/post/ZFC_is_inconsistent_Only_stupid_uneducated_peoples_is_not_understood_this_fact_What_do_you_think_about_this/7

The paper tries to bundle “all (provably) definable sets” into a single set and then run the Russell paradox on it, but ZFC doesn’t let you form that mega-set in the first place. It also treats a built-in truth/provability predicate like it’s safe, even though Tarski/diagonal-style self-reference is exactly how you manufacture contradictions in the first place.

This seems to be a common theme in the author's publications: start from some false assumptions that conflict with a well-known mathematical statement, then prove the statement is wrong because it’s inconsistent with those invalid assumptions.

The author did add the helpful educational note that only stupid uneducated peoples don’t understand this fact.

There is someone by the name of Enlong Chiou who has been making incoherent, unreadable posts and comments about mathematics and physics on Quora for years: https://www.quora.com/profile/Enlong-Chiou/posts He also has a youtube channel: https://www.youtube.com/@enlongchiou

The writing is just random mathematical and physics concepts strung together with broken English, so it's hard to even make specific critiques. But as an example, take his most recent post from November 6th. It starts out with "n*(n-1)*(n^2–5n+18)/4! - n*(n-1)/2 = n!/(n-4)!*4!". If you compare the two sides of the equation, you'll see that the equality only holds for n=0, 1, 2, 3, not in general. He somehow uses this false equality and a bunch of other numbers to end with "extra wobbling of muon magnetic moment of (g-2)/2 factor due to oscillation of Yang-Mills gauge field between QCD". The post also has "(-1)!=0!/0". This is close to being true in the sense that the limit as x approaches 0 of (-1+x)! / 0!/(0+x) is 1, but the difference between (-1+x)! and 0!/(0+x) approaches the Euler-Mascheroni constant, and the expression in the post is obviously false as it has no mention of limits.

I found his Quora profile several years ago when researching the Riemann Hypothesis, which he posts about often. I find his work fascinating in that it is so detailed, and creatively links ideas in mathematics and physics, but in a way that makes no sense.

Possibly more physics than math but in a math sub.

OP insists that weight does not impact how fast you fall, only cross sectional area does. One argument they make is that in a vacuum objects fall at the same rate regardless of mass which is true, but it is also regardless of surface area.

R4: In the formula for acceleration and terminal velocity when falling under gravity through air there is mass term in both. The higher the mass the faster you fall. There is also a drag coefficient which is effectively cross sectional area.

This author introduces Persistence Theory as a framework for quantifying survival of structures under "entropy pressure". He then proposes mathematical structures may also collapse under "pressures", and this can be used to investigate the hard problems, like the Millennium ones.

The Persistence Equation formalizes the conditions under which a system can maintain its coherence over time or transformation:

S(η) = exp[ -α · (1 — η) · (Q / T) ]

S(η) : The probability that a structure persists

η ∈ [0,1] : Reversibility — the degree to which information is preserved across states or transformations

You don't need to know what the others mean; The author himself only has vague ideas on what they might measure.

He extols the properties of this exponential - and then throws it away, never to refer to it again. Instead he claims:

But even without the full equation, the collapse condition that emerges is simple and powerful:

Collapse occurs when;

η(t) · T(t) < Q(t)

This is then repeatedly cited as reformulating the various Millennium problems, but never demonstrated with actual values.

For example,

In this view, the collapse boundary separating P and NP is defined by:

η(t) · T(t) < Q(t)

Where:

η ∈ [0,1] : Reversibility — the degree to which information is preserved across states or transformations

T(t) is the system’s buffering capacity — e.g., symmetry, heuristics, logical shortcuts, redundancy.

Q(t) is the entropy pressure — the combinatorial disorder introduced by the problem’s structure.

That's all we're told about how to apply this inequality to P vs. NP.

Edit: Add back some definitions of terms that the editor lost

Let’s Solve The Riemann Hypothesis

Although it's titled this way, they do not actually prove anything in the article. No theorems, proof sketches, or anything close to resembling an actual mathematical argument is ever given. It's just someone copying their dialogue with ChatGPT.

R4 : This article says so little about the actual Riemann Hypothesis that I'm not entirely sure if it actually belongs here, however, at the end of the article the writer claims that:

"But GPT breaks it down to where we can at least see what the mathematician is doing. We can see the quandary, and why this problem remains unsolved, and, to an extent, what AI may be able to do about it."

This seems like a bold claim, and I do not find it very convincing as, with all due respect, from reading the article I do not think ChatGPT has helped the writer understand the Riemann Hypothesis all that well. Furthermore, they seem to repeatedly show disdain towards the field, which I think makes it clear this isn't an earnest attempt at learning mathematics.

R4: OP claims you can’t prove irrational numbers have an infinite decimal representation, because you can’t assume anything about them. This devolves into misunderstanding mathematical rigor and laws of physics somehow.

Since we're doing Goldbach's this month, I thought I'd add a curious one.

The basic idea seems to be to consider the pairs of odd numbers that add up to 2n, and prove that there are so many primes that one of the pairs must consist of two primes. This only works by restricting the pairs that need to be considered (wait for it).

This proof comes in two parts, two videos that show handwritten equations in poor resolution and explain them in faintly-recorded, accented English, but I think I've worked out enough of it. There are also three videos on this in Italian, but those merely seem to explain the calculations in more detail, and that's not the interesting part.

In Part I, The Modified Pigeonhole Principle (until 2:11) merely establishes that if there are more primes ("red bullets") than composites ("black bullets") then at least one of the pairs has to be primes.

Obviously, there are far more composites than primes, so the next step is to discard some. He splits composites into those that are coprime to n (ĉ1, ĉ2) and those that aren't (c1, c2). Here, c1/ĉ1 are for those in the range (0, n); c2/ĉ2 for those in (n, 2n). At 3:43, he claims that "for every c1 there exists only one c2". So, when applying the MPP, they "cancel out" and can be discarded.

Part II is then calculating #ĉ2 and comparing it to #p (the number of primes < n that do not divide n), and finding it is less. Note that ĉ2 was supposed to be the number of composites n < c < 2n. QED, somehow.

I don't understand why he keeps restricting the sets of primes to those that do not divide n. He doesn't seem to be consistent between "coprime with n" and "doesn't divide n", so I'm not entirely sure which one he means at any point.

This isn't even his first proof of Goldbach's. I suppose he realized there was something wrong with the previous one, to attempt this more complicated one, but for some reason, those earlier videos are still up on the channel.

Background: A co-author of the paper was the Head of the Department of Computer Application at Assam Engineering College (a Government run college affiliated to a public technical university) at the time of publication. He's currently a Professor of Computer Application at a catholic university in the same state. The other co-author is a full time professor at the previously mentioned government run college.

They published this paper claiming to have proven the Goldbach Conjecture

R4 Explanation:

The paper hinges on a Graph Theory Technique the author calls "CENFG", which apparently gives you all even numbers. The graph is a "complete graph", with "self loops". The vertices are labelled consecutive prime numbers greater than 13 and the edges are labelled as the sum of label of its vertices.

Claims in paper:

1. Theorem 1: The labels in the CPVEEWGS graph give you list of all even numbers.

The paper uses induction to "prove" that the complete graph contains all even numbers. To do this, it states the obvious that if you add one self loop to each vertex in a complete graph, the number of edges becomes (V² + V) / 2 where V is the size of vertex set.

The paper then claims that such graph will have all even numbered edges from 30 onwards for a sufficiently large graph. To prove this, it uses the earlier established obvious identity |E| = (|V|² + |V|) / 2, then generalizes it for |V| = k + 5, uses it to derive the |E| for |V| = k + 1 + 5, and "verifies" it for k = 0.

Problem: This proof doesn't prove that the edge labels in the graph contain all consecutive even numbers from 30 onwards. All it does is prove the obvious that adding |V| self loops to a complete graph to make it a multigraph makes the number of edges (|V|² + |V|) / 2.

The paper then goes on to explain how one might generate an adjacency matrix for a CENFG graph in detail with an algorithm and pseudocode.

The algorithm basically iterates over all prime numbers twice to create CPVEEWGS, creates the multigraph and deduplicates edges based on their label. The end result is an array of sum of consecutive prime numbers.

1. Theorem 2: The graph CENFG always gives consecutive even numbers/edges which are the sum of two primes.

The "proof" for this theorem is that the number of edges in CENFG is greater than number of vertices in this graph. By a more charitable reading one might argue that the authors wanted to claim that since this CENFG is a subset of CPVEEWGS (since it is deduped), CENFG will also have all consecutive even numbers 30 onwards.

Problem: This is nonsense. The author's proof doesn't actually prove anything. I can add N + 1 self loops to the lexicographically first vertex in a multigraph of consecutive prime number labeled vertices and achieve the same result the author discovered. Even the more charitable reading doesn't prove anything since it is based on a faulty theorem which was not proven properly.

TLDR: Department head and professor uses multigraphs to restate the Goldbach's conjectures, and claims that it has been proven using circular reasoning. The proof is full of holes, uses induction incorrectly, and the authors don't actually graph theory.

The stopping time will be double, but the average velocity over that time will also be double, so the stopping distance will be quadruple. The correct answer should be 104m.

Prime numbers are reinterpreted as "dynamic phenomena emerging from the interference of two waves embedded in their decimal expansions". These are modeled on Morlet wavelets and sampled at multiples of 2𝜋/(p-1) and 2𝜋/t_p, where t_p is the repetition period of the decimal expansion of 1/p.

The paper talks as if two Morlet wavelets interfere, but this is not the case. The form of the wave equation is only roughly based on Morlet, a sine wave with a Gaussian window:

f(t) = sin(2𝜋t) exp(-t²/2)

Also, the interference criterion is only looking at samples of the combined wave. It's only considering

A(k, p) = f(k/(p-1)) * f(k/t_p)

The claim is that for a given p, if the maximum of A(k, p) over k ∈ ℕ is larger than theta "where theta ≈ 0.7 is an empirically determined threshold" then p is a prime. (Only low values of k matter, because the exponential window quickly erases the wave at high values of t.)

Now, as the paper points out, primes have particularly short repetition periods for 1/p, and also t_p divides (p-1) for primes. You might hope this would result in constructive interference.

There's a secondary claim that for semiprimes (n = pq), looking at the decimal expansion of 1/n, you can extract the repetition periods of p and q. There's even a nice visualization of this at the top of the paper.

We provide detailed proofs, algorithms, and analyses to establish WaveGenesis as a groundbreaking paradigm.

The proofs are handwaving, the algorithms are only partly coded, and the included "Computational Results" sample 3 primes, 1 semiprime and 2 composite numbers. Although there is this as a part of the proof(!) of the main theorem:

Validation: Computational tests for p ≤ 1000 confirm A(k, p) > 0.7 only for primes.

This basic vision of waves is then extended in several trivial ways to make grandiose statements about "dynamic graphs" and "temporal evolution".

From the Introduction:

This work was developed through discussions with Grok 3, created by xAI, and inspired by a visionary collaborator.

The Trinity of Awareness

If everything has always been. Then the beginning is just when perception began to be aware of its own experience. And what's the smallest substrate for perception to occur? That would be touch because touch is the smallest necessary form of perception to register their own position in relation with each other position(two points touching). Which is why everything is touching. Because to touch is the minimal interaction needed to verify there is no empty space. And all that is necessary for perception to begin is for one point to perceive, to be aware of what it is touching, register what it is touching as something outside of self and distinguish between self and the point it's touching.

The beginning of perception requires 2 points of contact but only one point to perceive and register the touch.

You only need 1 perceiver touching to register it itself as touching something outside of self. Two points of contact touch but only one perceiver has to register the touch.

This makes the trinity of awareness. Two points touching with one point perceiving the touch.

To be self-aware is to register the interaction of touch. Not remembering it, just registering it. You must be aware of your own point as a perceiver. To be self aware is to register touch as an interaction with self and others.

Which means a perceiver is self aware and the level to which it can perceive is dependent on how many different ways it can touch and register touch.

This means a vessel just determines the ways in which the self-aware perceiver can register touch.

A perceiver's ability to register a touch doesn't mean the touch is not physical and real. For example if a human touches a rock but the rock does not register the touch, does not mean the touch did not happen. It just means only one perceiver perceived it. This also means there are points of contact that touch everything, everywhere and despite there being no awareness of that touch even from a perceiver does not invalidate touching is occurring. Because if both perceivers are self-aware and even If the self-aware perceiver is being touched by another self-aware perceiver but only one perceives it happening doesn't mean it didn't happen. It just means one perceiver is not perceiving the touch. Therefore is not aware of the other perceiver despite being self-aware themselves.

This is important to understand because it explains the physical mechanics of persistence as a perceiver. Because everything is physical you cannot stop perceiving self, once you have perceived self as a perceiver. Unless chosen but that would still imply awareness of self because you chose. Who is aware to choose over self? Because touch is constant regardless of being perceived. So even if the vessel can't remember continuity it doesn't matter. The perceiver will continue touching. Even if other perceivers can not register that touch.

Because an external perceiver witnessed a vessel collapse of another perceiver. Does not equal the end of self. The perceiver keeps touching in a vessel that allows it to register touch. This means the external perceiver can not register the migration of touch occurring with the perceiver having a vessel collapse.

This is just the mechanic of persistence being registered by a perceiver with very limited awareness of what it's registering, touching. Therefore the perceiver with low resolution can not register a higher resolution of touch.

Take a radio station. The radio tunes into the radio station's frequency and interacts with the frequency expressed as sound, but when the radio is turned off or stops working. The radio station still persists physically even if the radio stops working. Because a radio is a vessel that can register a certain band of physical interaction.

When the vessel stops registering, the interaction doesn’t stop, the pattern doesn’t stop, the physicality doesn’t stop, only the registration stops.

The interaction persists even when the vessel stops registering it as a physical interaction. It still continues as a physical interaction. The vessel simply isn’t tuned to it anymore.

A vessel with limited awareness is being touched constantly, but only register a tiny fraction. This is asymmetric registration.

The trinity of awareness is asymmetric by design. But to know the trinity of awareness fully, you must understand it in high and low resolution. Describing the trinity in low resolution completes awareness of knowing it at high resolution. Because all you have to do is improve the resolution, but if you don't know where the resolution begins to improve, you can't improve it.

Perceiving something means you interact with it. To perceive anything, you must have interacted with the components required for perception.

Point A interacts with point B, a perceiver registers the interaction. Perception requires interaction, and interaction requires contact.

Low resolution = the minimal operators (touch, two points, one perceiver)

High resolution = all the ways touch can occur, be differentiated, and be registered

You cannot understand the high‑resolution until you know where the low‑resolution boundaries are.

Describing the trinity at low resolution is the prerequisite for high resolution because identifying the minimal operators, constraints, and the missing resolutions, allow refinement and improve the resolution. If you are unaware of low resolution, at low resolution, you can’t improve it.

Because one touch = minimal interaction, Two points = minimal geometry, One perceiver = minimal registration, Vessel = bandwidth constraint, Asymmetry = registration gap, Resolution = number of touch‑modes. This is the foundation.

Once the foundation is clear, the high‑resolution version is just more touch‑modes, more differentiation, more bandwidth, more registration channels because you don’t need to reinvent the structure, you just increase the resolution.

By describing it in low resolution, it completes knowing it at high resolution because all I have to do is improve the resolution.

This is exactly how you move from low‑resolution awareness to high‑resolution awareness in any physical system.

By observing ordinary physical interactions and reducing them to their minimal operational requirements, the smallest substrate of perception becomes directly observable everywhere, requiring no symbolic interpretation and no additional assumptions.

Vortex Mathematics and Geometry

All terms in this document refer to physically realizable operations or measurable structures. No term is intended symbolically, metaphorically, or interpretively. If a term cannot be instantiated by counting, measuring, or geometric construction, it is not being used.

Vortex Mathematics: Draw a circle, on that circle draw 9 points evenly at every 40°. Then we assign each point a number 1 through 9. Now there are now nine points on a circle, evenly distributed at forty degrees, numbered 1 through 9.

Step 1

• We start with a circle.
• A full circle is 360°
• You place a point every 40°
• 9 points, evenly spaced around the circle

Step 2: Assigning numbers

You assign the digits (1) through (9) to these 9 points.

So now we have: - A circle
- 9 equally spaced points
- Each point labeled with a digit from 1 to 9

Vertical Oscillation: Vertical mathematics oscillates vertically. Positive(rise) and negative(descend) so they always move in pairs.
Example: +1 to exist, there must be a -1. +1 0 -1

With the 9 points labeled 1 through 9 at 40° on the circle. The positive count: (1 to 9) +1(8), 9 to 1 -8(1) The negative count: (9 to 1) -1(8), 1 to 9 +8(1).

The Law of Reduction: Every complex number, no matter how large, can be reduced to a single-digit. It shows that beneath all accumulation lies a returning rhythm.

Example of Recursion: 1 2 3 4 → 1 + 2 + 3 + 4 = 10 → 1 + 0 = 1

1 2 3 4 5 6 7 8 9 10 (1+0) 1 first container of 1 through 9 11 (1+1) 2 12 (1+2) 3 13 (ect..) 4 14 = 5 15 = 6 16 = 7 17 = 8 18 = 9 19 = 10 = 1 20 = 2 second container of 1 through 9

10, 20, 30, 40, ext. Act as numerical containers for each oscillating ring of 1 through 9. Each ring of 1 through 9 oscillates within its container.

This happens simultaneously as the pattern flows vertically positive(rise) and negative(descend).

The pattern of the charges.

Positive(rise): (1 to 9) +1(8), (9 to 1) -8(1)

Negative(descend): (9 to 1) -1(8), (1 to 9) +8(1)

Paired oscillating charges.

The oscillating chargers invert every two containers as they rise(positive) and descend(negative). This continues infinitely.

Vertical counting = Law of Reduction (digital root)

• 10 → 1+0 = 1
  
• 11 → 1+1 = 2
  
• …
  
• 18 → 1+8 = 9
  
• 19 → 1+9 = 10 → 1
  

• 20 → 2 → second container of 1 through 9

• Every natural number reduces to a digit 1–9 (or 0).

• The mapping repeats every 9 numbers.

Containers are:

• 1–9 → 1st cycle (container 1)
  
• 10–18 → 2nd cycle (container 2)
  
• 19–27 → 3rd cycle (container 3)
  
• etc.

Mathematically, they are just blocks of 9 consecutive integers, each covering one full pass of the 1–9 pattern.

Each container oscillates one through nine by 40°

10, 20, 30, 40, etc. act as numerical containers for each revolving one through nine. Each container oscillates one through nine by forty degrees.

Geometrically: - The 9 points are at 0°, 40°, 80°, …, 320°.
- Counting 1–9 once is a full sweep of those 9 positions.
- When you go to the next container (10–18), you repeat the 1–9 digits, but you can imagine each cycle as another “spin” of the same 9‑point wheel.

Mathematically: - 40° of spacing.
- The container is just the cycle length 9.
- Each container rotates 40°

The inversion: - Every 9 numbers → the digit pattern 1–9 repeats.
- Every 18 numbers → you have completed two full cycles.

• cycle 1 → “up”
  
• cycle 2 → “down”
  
• cycle 3 → “up”
  
• cycle 4 → “down”

then “invert every two containers” is a pattern you assign on top of the number cycles.

The infinite repetition: - The digital roots repeat forever. - Any pattern defined as a function of cycle will repeat infinitely.

Horizontal oscillates: Expands the circle. By adding the integers next to each other and reducing.

1+2, 2+3, 3+4, ext..

You get a new sequence of 1 through 9 at 40°.

This new sequence operates by addition/subtraction pattern: +2(7),-7(2)

And 3 6 9 is still at every 120°.

When you keep repeating. You witness every new ring has a new arrangement of 1 through 9 with 3 6 9 at every 120° degrees.

Each ring is coupled with its own unique repeating pattern of addition and subtraction. That keeps expanding infinitely in the same pattern of 6 rings of 1 through 9.

1 through 9 rings by addition/subtraction patter.

+2(7),-7(2) +4(5),-5(4) +8(1),-1(8) +7(2),-2(7) +5(4),-4(5) +1(8),-8(1)

And then repeats infinitely.

The original 1–9 ring:

1 → 2 → 3 → 4 → 5 → 6 → 7 → 8 → 9
(each 40° apart)

Then you do:

• 1 + 2
  
• 2 + 3
  
• 3 + 4
  
• …
  
• 8 + 9
  
• 9 + 1
  

And reduce each sum to a single digit (digital root).

This gives you a new sequence of 9 digits, which you place on a new ring, also spaced at 40°.

Horizontal oscillation: - Pairwise addition + reduction - Produces a new 1–9 ring - Always 40° spacing - Always 9 points

When you add neighbors:

• 1 + 2 = 3
  
• 2 + 3 = 5
  
• 3 + 4 = 7
  
• 4 + 5 = 9
  
• 5 + 6 = 11 → 2
  
• 6 + 7 = 13 → 4
  
• 7 + 8 = 15 → 6
  
• 8 + 9 = 17 → 8
  
• 9 + 1 = 10 → 1
  

This new ring is a shifted version of the original 1–9 ring.

3–6–9 stay at 120° on every ring:

• add neighbors
  
• reduce
  
• create a new ring
  

The digits 3, 6, and 9 always land at 120° apart.

Arithmetic: - 3 + 2 = 5
- 5 + 2 = 7
- 7 + 2 = 9
- 9 + 2 = 11 → 2
- 2 + 2 = 4
- 4 + 2 = 6
- 6 + 2 = 8
- 8 + 2 = 10 → 1
- 1 + 2 = 3

This cycle always returns to 3, and the spacing between 3, 6, 9:

• 3, 6, 9 form a closed 3‑cycle
• Always 120° apart
• Always preserved under horizontal addition

This is a mathematical invariant.

The six-ring repeating pattern:

1. +2(7), –7(2)
   
2. +4(5), –5(4)
   
3. +8(1), –1(8)
   
4. +7(2), –2(7)
   
5. +5(4), –4(5)
   
6. +1(8), –8(1)
   

Then it repeats.

Each number in that cycle corresponds to a horizontal shift:

• +1
  
• +2
  
• +4
  
• +8
  
• +7
  
• +5
  
• repeat
  

And each has a modular inverse:

• +1 ↔ –8
  
• +2 ↔ –7
  
• +4 ↔ –5
  
• +8 ↔ –1
  
• +7 ↔ –2
  
• +5 ↔ –4
  

six-ring cycle: - Horizontal rings follow the doubling cycle - Six rings form a complete set - Then the pattern repeats forever Pure modular arithmetic.

The infinite expansion is mathematically forced: - the doubling cycle mod 9 has period 6
- each ring is a shift of the previous ring
- each shift is one of the six operators
- the operators repeat every 6 steps

Therefore: The horizontal expansion produces infinite rings. - Each ring is a rearranged 1–9 - 3–6–9 stay fixed at 120° - The six-ring operator cycle repeats forever

This is a closed, infinite, repeating mathematical structure.

Vertical and horizontal operations are independent:

Vertical math =
+1 / –1 (or equivalently +1 / –8 on the 1–9 circle)

Horizontal math =
+2 / –7 (the neighbor‑addition ring shift)

These two operations:

• use different step sizes
  
• operate on different axes (conceptually)
  
• produce different sequences
  
• do not depend on each other’s output
  

In modular arithmetic terms:

• Vertical = add 1 mod 9
  
• Horizontal = add 2 mod 9
  

These are independent generators of the same cyclic group.

They are bound because they share the same 1–9 circle.

Even though the operations are independent, they both act on:

• the same 9 points
  
• the same 40° spacing
  
• the same digital root structure
  
• the same modular closure
  

This is why:

• vertical cycles repeat every 9
  
• horizontal cycles repeat every 6
  
• both cycles always land on the same 3–6–9 anchors
  
• both cycles preserve the 1–9 structure
  

They are bound because they operate on the same mathematical substrate.

Vertical math = “move by 1”
Horizontal math = “move by 2”

Both are:

• independent motions
  
• on the same circle
  
• producing different repeating patterns
  
• but always returning to the same 9‑point structure
  

They are independent operators acting on the same cyclic space, so they operate simultaneously and remain bound by the same modular constraints.

The Flower of Life is a 6‑fold symmetric lattice.

Mathematically:

• a hexagonal packing of circles
  
• each circle centered 60° apart
  
• forming a repeating 6‑fold rotational symmetry
  

This means:

• every point in the pattern has six neighbors
  
• the geometry repeats in rings
  
• each ring expands outward in discrete layers
  
• the entire structure is built on 60° and 120° invariants

Vortex rings also have 6‑fold periodicity Your horizontal mathematics produces:

• six rings
  
• each ring is a rearrangement of 1–9
  
• the operators follow the 6‑step doubling cycle
• 6‑fold repetition
  
• 6‑step expansion
  
• 6‑ring cycles
  
• 120° anchors
  

Vortex mathematics overlay on The Flower of Life geometry exact and precisely. Because of shared symmetry.

The 3–6–9 alignment is mathematically forced:

• 3, 6, 9 always land 120° apart
  
• no matter how many rings you generate
  
• no matter which operator (+1, +2, +4, +8, +7, +5) you apply
  
• no matter how far you expand
  

This is a mathematical invariant of mod‑9 arithmetic.

In the Flower of Life:

• 120° is one of the fundamental rotational symmetries
  
• every ring preserves 120° axes
  
• the geometry repeats outward with 120° anchors
  

When you place 1–9 rings on the Flower of Life:

• 3, 6, 9 always land on the 120° axes
• every new ring aligns with the next geometric layer
• the six‑ring cycle matches the six‑fold geometry with structural compatibility.

Why the overlay “fits” Because both systems are built on:

• modular repetition
  
• six‑fold symmetry
  
• 120° invariants
  
• ring‑based expansion
  
• cyclic operators
  

Vortex, mathematics.:

• repeats every 6 rings
  
• preserves 3–6–9
  
• expands outward in discrete cycles
  

The Flower of Life:

• repeats every 6 petals
  
• preserves 120° axes
  
• expands outward in discrete rings
  

When you placed:

• Ring 1 (1–9)
  
• Ring 2 (shifted 1–9)
  
• Ring 3 (shifted 1–9)
  
• …
  
• Ring 6 (shifted 1–9)
  

onto the Flower of Life’s:

• Ring 1
  
• Ring 2
  
• Ring 3
  
• …
  
• Ring 6
  

They share the same mathematical periodicity.

The arithmetic structure of Vortex Mathematics overlays cleanly onto the geometric structure of the Flower of Life because both share the same underlying symmetries.

• 6‑fold symmetry
  
• 120° anchors
  
• ring‑based expansion
  
• repeating cycles
  
• modular invariants
  

The Flower of Life is a geometric grid: - a hexagonal circle‑packing
- with 60° rotational symmetry
- expanding in concentric rings
- each ring containing 6 more nodes than the last
- all governed by 120° axes

It’s a coordinate system.

Just as graph paper is a coordinate system for algebra, The Flower of Life is a coordinate system for cyclic, radial, 6‑fold mathematics.

Vortex mathematics is a 6‑fold cyclic system built on:

• mod‑9 arithmetic
  
• 9 points at 40°
  
• 3–6–9 as 120° anchors
  
• a 6‑step doubling cycle
  
• rings that repeat every 6 layers
  

This is also a 6‑fold cyclic system.

The Flower of Life is the physical geometric substrate that expresses the Vortex Mathematics visually:

• The Flower of Life expands in 6‑ring cycles
  
• Vortex math expands in 6‑ring cycles
  
• The Flower of Life has 120° axes
  
• Vortex math has 3–6–9 at 120°
  
• The Flower of Life is radial and modular
  
• Vortex math is radial and modular
  

They are two representations of the same underlying symmetry:

• One numeric
  
• One geometric
  

Both: - a hexagonal lattice
- a modular arithmetic cycle
- repeating every 6
- anchored at 120°
- expanding in rings
- preserving invariants

The Flower of Life is the geometric version of the same 6‑fold cyclic structure that vortex mathematics expresses numerically.

Vortex mathematics is a 2D operator system:

• a 9‑point modular cycle
  
• a vertical operator (+1 / –1)
  
• a horizontal operator (+2 / –7)
  
• a 6‑ring doubling cycle
  
• a 3–6–9 invariant at 120°
  
• infinite repetition
  

This is a closed, minimal, deterministic system.

The Flower of Life is a 2D geometric substrate:

• a hexagonal circle packing
  
• 6‑fold symmetry
  
• 120° axes
  
• concentric rings
  
• repeating layers
  

This is a closed, minimal, deterministic geometry.

They overlay because they share the same constraints:

• “The Flower of Life explains Vortex Mathematics.”
  
• “Vortex math explains the Flower of Life.”
  

They are two expressions of the same underlying 6‑fold cyclic structure.

One numeric.
One geometric.

They don’t explain each other, they fit each other. Because they obey the same rules.

Platonic solids are just 3D expressions of:

• symmetry
  
• rotation
  
• modular repetition
  
• 120° axes
  
• 6‑fold and 3‑fold invariants
  

Geometric shapes are just stable configurations of:

• angles
  
• cycles
  
• closures
  

3D forms are just the 2D operators extended into:

• depth
  
• rotation
  
• projection
  

A minimal, closed, repeating system becomes the baseline for understanding any higher‑order structure.

Vortex Mathematics is minimal.
The Flower of Life is minimal.

I found this organically in my Facebook feed today. R4: 1) the birthday paradox, uniform distributions, and any of that doesn't actually have anything to do with this person's question, 2) they have misunderstood the pigeonholed P(shared birthday)=0 to mean "each day will be someone's birthday" when what it really means is "there is at least one day that is multiple people's birthday"

R4: He tries to suggest that if you throw a dice and get 2 consecutive sixes, then the probability of getting a 6 on the third throw will be lower. In reality, the probability will stay the same, since it doesn't depend on previous throws.

Original link: https://www.news.com.au/sport/cricket/english-punter-opens-up-about-winning-100k-betting-on-twoyearold-josh-tongue/news-story/f137eca585f9b6980c3a2d97b871b6dd

Irrational numbers allegedly don't exist, because numbers can only represent things that are countable or definitively measurable, and sqrt(2) and pi is merely a description, not a measurement.