Euler's Formula

Graphic created using Gemini

Courtesy of Gemini:

Often cited as the most beautiful theorem in mathematics, Euler’s identity (\(e^{i\pi} + 1 = 0\)) achieves its fame by elegantly linking the most fundamental constants and operations in a single, concise equation.

Here is the history behind its discovery and the mathematical proof of why it works.

The History Behind the Identity

The equation is a specific case of Euler’s formula, which states that for any real number \(x\):

\[e^{ix} = \cos(x) + i\sin(x)\]

While the identity bears the name of the brilliant Swiss mathematician Leonhard Euler, the groundwork was laid slightly earlier. In 1714, the English mathematician Roger Cotes discovered a precursor to this relationship, expressing it in terms of natural logarithms: \(\ln(\cos x + i\sin x) = ix\).

However, it was Euler who, in 1748, formalized the mathematics into the modern exponential form we use today. He published it in his foundational text Introductio in analysin infinitorum (Introduction to the Analysis of the Infinite).

The identity is celebrated because it connects five foundational mathematical constants from entirely different disciplines:

• \(0\): The additive identity (the foundation of arithmetic).
• \(1\): The multiplicative identity (the foundation of counting).
• \(\pi\): The fundamental constant of geometry (the ratio of a circle's circumference to its diameter).
• \(e\): The fundamental constant of growth and continuous change (the base of natural logarithms).
• \(i\): The imaginary unit (\(\sqrt{-1}\)), which unlocks complex algebra.

It also seamlessly utilizes the three most basic mathematical operations: addition, multiplication, and exponentiation.

---

Why the Equation Holds True

To prove why this works, we must look to Taylor series (specifically, Maclaurin series expansions). A Maclaurin series allows us to express complex functions as an infinite sum of polynomial terms.

The series expansion for the exponential function \(e^x\) is:

\[e^x = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \frac{x^4}{4!} + \frac{x^5}{5!} + \dots\]

If we substitute \(x = i\theta\) into this series, we get:

\[e^{i\theta} = 1 + (i\theta) + \frac{(i\theta)^2}{2!} + \frac{(i\theta)^3}{3!} + \frac{(i\theta)^4}{4!} + \frac{(i\theta)^5}{5!} + \dots\]

Next, we evaluate the powers of \(i\). By definition, \(i = \sqrt{-1}\), which creates a repeating pattern:

• \(i^1 = i\)
• \(i^2 = -1\)
• \(i^3 = -i\)
• \(i^4 = 1\)
• \(i^5 = i\)

Substituting these evaluated powers back into our series gives:

\[e^{i\theta} = 1 + i\theta - \frac{\theta^2}{2!} - \frac{i\theta^3}{3!} + \frac{\theta^4}{4!} + \frac{i\theta^5}{5!} - \dots\]

Now, we group the real terms (those without an \(i\)) and the imaginary terms (those multiplied by \(i\)) together:

\[e^{i\theta} = \left( 1 - \frac{\theta^2}{2!} + \frac{\theta^4}{4!} - \dots \right) + i\left( \theta - \frac{\theta^3}{3!} + \frac{\theta^5}{5!} - \dots \right)\]

This is where Euler's brilliant connection becomes visible. These two grouped polynomial expansions perfectly match the standard Maclaurin series expansions for the trigonometric functions cosine and sine:

\[\cos(\theta) = 1 - \frac{\theta^2}{2!} + \frac{\theta^4}{4!} - \dots\]

\[\sin(\theta) = \theta - \frac{\theta^3}{3!} + \frac{\theta^5}{5!} - \dots\]

By substituting \(\cos(\theta)\) and \(\sin(\theta)\) back into our grouped equation, we arrive at Euler's formula:

\[e^{i\theta} = \cos(\theta) + i\sin(\theta)\]

Reaching the Final Identity

To get Euler's Identity, we evaluate the formula at \(\theta = \pi\) radians (which corresponds to \(180\) degrees on the unit circle):

\[e^{i\pi} = \cos(\pi) + i\sin(\pi)\]

Looking at a standard trigonometric unit circle, we know that:

• \(\cos(\pi) = -1\)
• \(\sin(\pi) = 0\)

Substituting these values in:

\[e^{i\pi} = -1 + 0i\]

\[e^{i\pi} = -1\]

By simply adding \(1\) to both sides, we arrive at the final state of the identity, linking the five constants perfectly together:

\[e^{i\pi} + 1 = 0\]

Here is a Gemini link to information about the mathematicians Taylor and MacLaurin.

Conway's Constant

John Conway 1937 - 2020
biographical link

Having watched this YouTube video on Conway' Constant, I was confused and asked Gemini the following question:

Can you explain Conway's Constant as it arises from the "look and say" sequence. In particular, I'm finding it hard to understand the connection with the irreducible polynomial of degree 71 and the idea of the 94 atoms that are named after the chemical elements. I'd like a comprehensive overview that ties everything together.

Back in February of 2017, I'd created a blog post titled Look and Say Sequence in which I'd mentioned this polynomial but I hadn't delved into it in any depth. Gemini's report is quite comprehensive and is included below. I don't pretend to understand all of what's included but nonetheless it's very interesting.

The Cosmological Theorem and Audioactive Decay: An Exhaustive Analysis of Conway’s Constant, the Look-and-Say Sequence, and the 94-Element Finite-State Automaton

Introduction

Within the study of deterministic integer sequences and formal language theory, the "look-and-say" sequence presents a uniquely profound case study. Originally introduced to the broader mathematical community by John Horton Conway—after being presented with the concept by a student at a party—the sequence appears at first glance to be a recreational puzzle governed by elementary rules. However, beneath its seemingly chaotic and rapidly expanding numeric surface lies a rigid, finite-state topology governed by linear algebra, graph theory, and automata mechanics.

The sequence is generated iteratively through a process analogous to run-length encoding. Beginning with a single seed digit, typically "1", each subsequent term is generated by reciting the contiguous blocks of identical digits in the previous term. The sequence proceeds as follows: the first term "1" is read aloud as "one 1", which translates mathematically into the second term, "11". The term "11" consists of two 1s, leading to the third term, "21". The sequence thus unfolds as 1, 11, 21, 1211, 111221, 312211, 13112221, and so forth, ad infinitum.

While the sequence ostensibly possesses the capacity for unbounded structural variation, Conway’s rigorous formal analysis revealed that it is governed by an underlying set of strictly deterministic decay mechanisms that mirror radioactive fission. Through the iterative application of what Conway termed the "audioactive operator," any string of integers systematically decomposes into a finite, universally stable set of fundamental non-interacting sub-strings.

This discovery culminated in Conway's Cosmological Theorem, a seminal result which proves that any arbitrary starting string will ultimately decay into a compound formed from precisely 94 fundamental atomic "elements". These elements are named in homage to the chemical periodic table, spanning the 92 primordial elements from Hydrogen to Uranium, alongside two "transuranic" families—Plutonium and Neptunium—to account for digits greater than 3.

The asymptotic growth rate of the string's digit length is strictly dictated by a $92 \times 92$ transition matrix mapping the evolutionary pathways of the common elements. The dominant eigenvalue of this matrix represents a constant multiplicative growth factor known as Conway's Constant, denoted as $\lambda \approx 1.303577269$. Crucially, while the transition matrix dictates a characteristic polynomial of degree 92, the constant $\lambda$ is formally defined as the unique positive real root of a much smaller, irreducible polynomial of degree 71, which emerges after factoring out degenerate cyclic subsystems within the decay matrix.

This report provides an exhaustive, granular analysis of the look-and-say sequence, detailing the mechanics of the audioactive operator, the complete taxonomy and evolutionary transitions of the 94 atomic elements, the structural sparseness of the transition matrix, the rigorous mathematical derivations underlying the degree-71 polynomial, and the modern applications of finite-state automata in verifying the Cosmological Theorem.

The Mathematical Mechanics of Audioactive Decay

To formally evaluate the look-and-say sequence, it must be detached from linguistic recitation and formalized as a string manipulation operator. The process is driven by the audioactive operator, denoted herein as $\mathcal{A}$, which acts upon finite sequences of positive integers.

Let a string $S$ be represented by its maximal contiguous blocks of identical digits. If we define $S = d_1^{e_1} d_2^{e_2} \dots d_n^{e_n}$, where $d_i$ represents a specific numerical digit and $e_i$ denotes the exact continuous frequency of that digit (such that $d_i \neq d_{i+1}$ for all valid $1 \le i < n$), then the application of the audioactive operator yields the daughter string:$$\mathcal{A}(S) = e_1 d_1 e_2 d_2 \dots e_n d_n$$Applying the operator iteratively generates the descendent sequences of the initial seed $S$, denoted as $\mathcal{A}^k(S)$ for $k \in \mathbb{N}$. A sequence that is identical to $\mathcal{A}^k(S)$ for some seed $S$ and an integer $k$ is formally referred to as a "$k$-day-old" string.

The Bounded Digit Phenomenon

A profound structural limitation of the operator $\mathcal{A}$ is that, unless a digit $d \ge 4$ is deliberately introduced into the initial seed $S$, the descendant strings will indefinitely consist entirely of the digits 1, 2, and 3. It is mathematically impossible for a contiguous block of four identical digits to emerge naturally from the standard audioactive derivation.

To demonstrate this, consider the conditions required for a "4" to appear in $\mathcal{A}^k(S)$ without existing in $S$. The operator would need to evaluate a sub-string in $\mathcal{A}^{k-1}(S)$ consisting of four identical adjacent digits, such as "1111". However, for "1111" to exist in $\mathcal{A}^{k-1}(S)$, the preceding generation $\mathcal{A}^{k-2}(S)$ would need to contain a segment that reads as "one 1, one 1". By the fundamental definition of the maximal grouping property inherent to $\mathcal{A}$, the substring "one 1, one 1" would have been immediately condensed into "two 1s" (resulting in the string "21") during the transition from $k-2$ to $k-1$.

Because of this strict condensation rule, any sequence initiated with a seed consisting solely of 1s, 2s, and 3s is definitively closed over the alphabet $\{1, 2, 3\}$.

String Splitting and the Definition of Atoms

The mathematical viability of Conway's analysis hinges on the discovery that long strings do not behave as single, highly entangled macroscopic entities, but rather fragment into completely independent microscopic components. This phenomenon is known as "splitting".

A string $S$ is mathematically defined as splitting into a left contiguous sub-string $L$ and a right contiguous sub-string $R$ (denoted $S = L \cdot R$) if the evolutionary descendants of $L$ and $R$ never cross-interfere at their boundary. Formally, for all $k \ge 0$, the $k^{th}$ derivation of the concatenated string must exactly equal the concatenation of the $k^{th}$ derivations of the individual sub-strings:
$$\mathcal{A}^k(L \cdot R) = \mathcal{A}^k(L) \cdot \mathcal{A}^k(R)$$When this splitting property holds, the evolution of $L$ is completely abstracted from the evolution of $R$. If a valid, non-empty string cannot be split any further into smaller, independently evolving strings, it is classified as an "atom" or an "element". Consequently, every non-empty look-and-say string can be uniquely factored into an ordered concatenation of these indivisible atoms, which are then free to evolve along their own deterministic trajectories.

The Taxonomy of the 92 Common Elements

Through rigorous manual computation and later verified by exhaustive computational searches, Conway identified that there are exactly 92 distinct atoms composed strictly of the digits 1, 2, and 3 that dominate the sequence. These atoms are fundamentally stable in their evolutionary logic; when the operator $\mathcal{A}$ is applied to a common element, the resulting daughter string will invariably consist solely of one or more of these same 92 elements.

In a brilliant metaphor that has defined the nomenclature of the field, Conway named these 92 elements in direct correspondence with the periodic table of chemical elements, mapping them from Hydrogen (atomic number 1) to Uranium (atomic number 92).

The interaction and decay of these elements are highly structured. Rather than randomly converting into any other element, they follow a strict, uni-directional decay hierarchy. With the exception of certain closed cyclic transitions, heavier elements consistently decay into lighter compounds.

The Complete Periodic Table of Audioactive Decay

The following table presents the exhaustive enumeration of all 92 common look-and-say elements, outlining their exact digit string representations and their immediate evolutionary decay products under a single application of the audioactive operator $\mathcal{A}$. The ordering is presented in reverse topological order, starting from Uranium, demonstrating the decay cascade that ultimately terminates at Hydrogen.

Atomic Number	Element Symbol	String Representation	Decay Products / Evolution
92	U (Uranium)	3	Pa
91	Pa (Protactinium)	13	Th
90	Th (Thorium)	1113	Ac
89	Ac (Actinium)	3113	Ra
88	Ra (Radium)	132113	Fr
87	Fr (Francium)	1113122113	Rn
86	Rn (Radon)	311311222113	Ho, At
85	At (Astatine)	1322113	Po
84	Po (Polonium)	1113222113	Bi
83	Bi (Bismuth)	3113322113	Pm, Pb
82	Pb (Lead)	123222113	Tl
81	Tl (Thallium)	111213322113	Hg
80	Hg (Mercury)	31121123222113	Au
79	Au (Gold)	132112211213322113	Pt
78	Pt (Platinum)	111312212221121123222113	Ir
77	Ir (Iridium)	3113112211322112211213322113	Os
76	Os (Osmium)	1321132122211322212221121123222113	Re
75	Re (Rhenium)	111312211312113221133211322112211213322113	Ge, Ca, W
74	W (Tungsten)	312211322212221121123222113	Ta
73	Ta (Tantalum)	13112221133211322112211213322113	Hf, Pa, H, Ca, W
72	Hf (Hafnium)	11132	Lu
71	Lu (Lutetium)	311312	Yb
70	Yb (Ytterbium)	1321131112	Tm
69	Tm (Thulium)	11131221133112	Er, Ca, Co
68	Er (Erbium)	311311222	Ho, Pm
67	Ho (Holmium)	1321132	Dy
66	Dy (Dysprosium)	111312211312	Tb
65	Tb (Terbium)	3113112221131112	Ho, Gd
64	Gd (Gadolinium)	13221133112	Eu, Ca, Co
63	Eu (Europium)	1113222	Sm
62	Sm (Samarium)	311332	Pm, Ca, Zn
61	Pm (Promethium)	132	Nd
60	Nd (Neodymium)	111312	Pr
59	Pr (Praseodymium)	31131112	Ce
58	Ce (Cerium)	1321133112	La, H, Ca, Co
57	La (Lanthanum)	11131	Ba
56	Ba (Barium)	311311	Cs
55	Cs (Caesium)	13211321	Xe
54	Xe (Xenon)	11131221131211	I
53	I (Iodine)	311311222113111221	Ho, Te
52	Te (Tellurium)	1322113312211	Eu, Ca, Sb
51	Sb (Antimony)	3112221	Pm, Sn
50	Sn (Tin)	13211	In
49	In (Indium)	11131221	Cd
48	Cd (Cadmium)	3113112211	Ag
47	Ag (Silver)	132113212221	Pd
46	Pd (Palladium)	111312211312113211	Rh
45	Rh (Rhodium)	311311222113111221131221	Ho, Ru
44	Ru (Ruthenium)	132211331222113112211	Eu, Ca, Tc
43	Tc (Technetium)	311322113212221	Mo
42	Mo (Molybdenum)	13211322211312113211	Nb
41	Nb (Niobium)	1113122113322113111221131221	Er, Zr
40	Zr (Zirconium)	12322211331222113112211	Y, H, Ca, Tc
39	Y (Yttrium)	1112133	Sr, U
38	Sr (Strontium)	3112112	Rb
37	Rb (Rubidium)	1321122112	Kr
36	Kr (Krypton)	11131221222112	Br
35	Br (Bromine)	3113112211322112	Se
34	Se (Selenium)	13211321222113222112	As
33	As (Arsenic)	11131221131211322113322112	Ge, Na
32	Ge (Germanium)	31131122211311122113222	Ho, Ga
31	Ga (Gallium)	13221133122211332	Eu, Ca, Ac, H, Ca, Zn
30	Zn (Zinc)	312	Cu
29	Cu (Copper)	131112	Ni
28	Ni (Nickel)	11133112	Zn, Co
27	Co (Cobalt)	32112	Fe
26	Fe (Iron)	13122112	Mn
25	Mn (Manganese)	111311222112	Cr, Si
24	Cr (Chromium)	31132	V
23	V (Vanadium)	13211312	Ti
22	Ti (Titanium)	11131221131112	Sc
21	Sc (Scandium)	3113112221133112	Ho, Pa, H, Ca, Co
20	Ca (Calcium)	12	K
19	K (Potassium)	1112	Ar
18	Ar (Argon)	3112	Cl
17	Cl (Chlorine)	132112	S
16	S (Sulfur)	1113122112	P
15	P (Phosphorus)	311311222112	Ho, Si
14	Si (Silicon)	1322112	Al
13	Al (Aluminium)	1113222112	Mg
12	Mg (Magnesium)	3113322112	Pm, Na
11	Na (Sodium)	123222112	Ne
10	Ne (Neon)	111213322112	F
9	F (Fluorine)	31121123222112	O
8	O (Oxygen)	132112211213322112	N
7	N (Nitrogen)	111312212221121123222112	C
6	C (Carbon)	3113112211322112211213322112	B
5	B (Boron)	1321132122211322212221121123222112	Be
4	Be (Beryllium)	111312211312113221133211322112211213322112	Ge, Ca, Li
3	Li (Lithium)	312211322212221121123222112	He
2	He (Helium)	13112221133211322112211213322112	Hf, Pa, H, Ca, Li
1	H (Hydrogen)	22	H (stable)

Topological Properties of the Decay Graph

The interactions documented in the table above map out a highly asymmetric, deterministic directed acyclic graph (DAG) with localized periodic loops. The most profound structural observation is the universal convergence toward Hydrogen (22). Hydrogen represents the absolute ground state of the sequence; when evaluated by the audioactive operator $\mathcal{A}$, the string "22" is read as "two 2s", yielding "22". It is perfectly stable, immune to macroscopic expansion or structural alteration.

If one traces the cascade starting from Uranium (string 3), the sequence undergoes exactly 91 distinct decay steps before producing an isolated, stable Hydrogen atom at the end of the chain. However, Hydrogen can manifest internally much earlier. After just 14 evolutionary steps from Uranium, the sequence produces a complex compound containing 15 discrete elements—ranging from Dysprosium down to Platinum—within which a Hydrogen atom natively appears.

Another strict mathematical boundary in this system is the limitation on atomic recombination. Two adjacent elements cannot be arbitrarily merged without entirely disrupting their evolutionary pathways. For instance, combining Uranium (3) with Calcium (12) forms the string 312. Instead of decaying independently as U and Ca, the combined string 312 behaves identically to Zinc, decaying into Copper (131112). This non-linear interference proves that the splitting theorem strictly applies only at the precise cleavage boundaries of the canonical 92 elements.

Furthermore, while Conway's numbering (U=92 down to H=1) is the classic topological sort, it is not mathematically unique. Structural analysis reveals that there are exactly seven possible complete topological orderings of these 92 elements that preserve the rule that an element must generally decay into elements of a lower atomic number. Alternative valid sequences restructure the middle block of lanthanides and transition metals—such as swapping the priority of the Ho-Gd, Eu-Sm, and Pm-Y decay clusters—but all orderings invariably lock U at the top and H at the absolute bottom.

The Transuranic Elements and the 94-State Automaton

While the 92 primordial elements completely characterize any sequence containing only the digits 1, 2, and 3, a generalized theorem must account for all possible integer seeds. If an individual were to seed the look-and-say sequence with a digit $n \ge 4$, the behavior of the operator $\mathcal{A}$ initially introduces unfamiliar strings.

To mathematically sequester these anomalies, Conway proved that any anomalous digit $d \ge 4$ is rapidly pushed toward the end of an evolving sub-string. Over successive iterations, these high digits become permanently trapped at the terminal position of a highly specific prefix string.

Conway categorized these high-digit sinks as the "transuranic elements," naming them after Plutonium (Pu) and Neptunium (Np). The naming convention borrows heavily from nuclear chemistry, reflecting that these atoms do not occur "naturally" in sequences descending from 1, 2, or 3, just as Pu and Np do not generally occur in significant natural terrestrial quantities but are artificial by-products of nuclear reactions (e.g., Np-237 and Pu-238).

For every integer $n \ge 4$, an isotope of Plutonium and an isotope of Neptunium is defined by a specific constant prefix, followed by the variable digit $n$:

• Isotope of Plutonium ($n$Pu): 31221132221222112112322211$n$
• Isotope of Neptunium ($n$Np): 1311222113321132211221121332211$n$

These two families operate in a perfectly closed loop. When the audioactive operator is applied, a Plutonium isotope decays into a Neptunium isotope, and a Neptunium isotope decays directly back into a Plutonium isotope. During these transformations, the prefixes continuously shed fragments that immediately resolve into standard common elements (like Hf, Pa, H, and Ca), leaving the trapped digit $n$ endlessly oscillating between the Pu and Np structural states.

Because every possible isotope $n$ behaves identically concerning the topology of the decay graph, automata theory abstracts this infinite family of digits into just two functional states. Therefore, the complete finite-state machine (FSM) required to map the evolution of any arbitrary look-and-say sequence requires exactly 94 distinct states: the 92 primordial elements plus the two transuranic element classes.

The Cosmological Theorem

The synthesis of these elemental mechanics is formalized as Conway's Cosmological Theorem.

The theorem posits that every arbitrary sequence of positive integers has a finite "longevity" before it loses all chaotic macroscopic properties. Formally, it asserts that there exists an integer threshold $N$ such that, after $N$ successive applications of the audioactive operator $\mathcal{A}$, the resulting string will irreversibly split into a concatenation of the 94 fundamental elements. From the $N^{th}$ iteration onward, the string is no longer a single complex entity but a compound of chemically independent audioactive atoms.

While Conway and Richard Parker originally provided a proof for this theorem, the manuscript was famously lost. Mike Guy subsequently established an upper bound, proving that any arbitrary sequence will fully decay into atoms in no more than 24 iterations, or $N=24$ "days". The absolute maximum longevity across all possible string formulations is thus defined as the "cosmological constant," exactly 24.

A rigorous, verifiable proof was later reconstructed by Shalosh B. Ekhad and Doron Zeilberger. They developed a complex Maple program to map the decay properties of the sequence. Ekhad and Zeilberger significantly reduced the computational complexity of the proof by restricting their analysis. Because any digits greater than 3 migrate to the terminal end of an atom by day 2 (ultimately forming transuranic elements), the problem space can be reduced to analyzing strings constructed solely from $\{1, 2, 3\}$. By proving that all permutations within the $\{1, 2, 3\}$ alphabet achieve atomic stability within a maximum longevity of 24, they established that an arbitrary string containing any digits whatsoever must achieve stability within $24 + 2 = 26$ days, later tightened back to exactly 24. To exhaust the infinite space of strings, they relied on "isotopic classes"—a mapping of basic state bijection sets to track topological transformations, allowing the computer to iterate through a finite representation of all sequence behaviors.

Recent developments in automata theory have corroborated the Cosmological Theorem using finite-state machine minimization techniques. By treating the generation rule as a deterministic transducer mapping integer sequences, algorithms can compose and minimize the states to verify that the 94 specific elemental states are necessary and perfectly sufficient for closure; there are no edge cases or rogue sequences that can escape the 94-element boundary.

The $92 \times 92$ Transition Matrix and Linear Dynamics

Once a sequence passes the cosmological horizon of $N=24$, its future evolution is strictly deterministic and perfectly linear. Because the 92 common elements split and evolve independently, the entire future state of the sequence can be modeled as a discrete-time dynamical system governed by a constant $92 \times 92$ transition matrix $T$.

Let the state of the sequence at iteration $k$ be defined by a column vector $v_k \in \mathbb{R}^{92}$, where the $i^{th}$ entry corresponds to the exact quantity of the $i^{th}$ atom present in the sequence. The evolution to the next generation $k+1$ is calculated via matrix multiplication:$$v_{k+1} = T v_k$$The matrix $T$ is constructed directly from the periodic table of decay transitions. Each column represents an element, and the rows represent the products it generates. For example, element 28 (Nickel) decays into element 30 (Zinc) and element 27 (Cobalt). Thus, the $28^{th}$ column of matrix $T$ contains a $1$ in the $30^{th}$ and $27^{th}$ rows, and $0$ in all others.

Matrix Structure and Dimensional Sparsity

An analysis of the matrix $T$ reveals severe structural asymmetry. It is an integer matrix containing only non-negative entries—overwhelmingly 0s, with scattered 1s and 2s representing stoichiometric quantities.

Because elements predominantly decay into lighter elements, following a thermodynamic arrow of increasing Boltzmannian entropy, the matrix naturally tends toward a block-triangular or lower-triangular structure. Specifically, the lower-triangular portion of the matrix is determined to be approximately 8.7 times denser than the upper-triangular portion, reflecting the rarity of elements "fusing" upward into heavier compounds.

This extreme sparsity and the presence of numerous rows containing near-identical entries allow mathematical simplifications via integer relations. By identifying components that evolve synchronously, the matrix can be collapsed, eliminating redundant rows without necessitating floating-point approximation. These variables are pivotal in reducing the computational intensity of extracting the system's eigenvalues.

The Perron-Frobenius Theorem and Asymptotic Growth

To understand the macro-scale growth of the string's length, one must evaluate the eigenvalues of $T$. Because $T$ is a non-negative matrix, the Perron-Frobenius theorem dictates that there exists a unique, strictly positive, real eigenvalue—often called the spectral radius or maximal eigenvalue $\lambda$—that fundamentally dominates the system's asymptotic behavior.

For any state vector $v_k$, as $k \to \infty$, the ratio of the total elements in successive vectors perfectly converges to this spectral radius. If $L_n$ represents the total digit length of the sequence at the $n^{th}$ generation, its length asymptotically scales according to $L_n \approx c \lambda^n$.

Crucially, the presence of the transuranic elements (Plutonium and Neptunium) does not influence this dominant growth rate. The matrix block managing the oscillating Pu $\leftrightarrow$ Np reactions produces eigenvalues of precisely $\pm 1$ modulo the core subspace. Because the absolute modulus of the transuranic eigenvalues ($|\pm 1| = 1$) is strictly less than the spectral radius $\lambda \approx 1.303$, their proportional influence decays geometrically. Consequently, as the main sequence explodes in length at a rate of 30.3% per step, the relative abundance of transuranic elements converges asymptotically to zero.

Derivation of the Degree-71 Polynomial

The maximal eigenvalue $\lambda$ is famously known as Conway's Constant:$$\lambda \approx 1.303577269 \dots $$By definition, the eigenvalues of a matrix are the roots of its characteristic polynomial, calculated as $\det(\lambda I - T) = 0$. Because $T$ is a $92 \times 92$ transition matrix, the characteristic polynomial $P_{92}(\lambda)$ inherently possesses a degree of exactly 92.

However, Conway's Constant is heavily documented across mathematical literature as the root of an irreducible polynomial of degree 71, not 92.

This structural discrepancy is reconciled through algebraic factorization. The characteristic polynomial of degree 92 is highly reducible over the field of rational numbers due to the macroscopic topological properties of the transition matrix. When $T$ is evaluated into its rational canonical form, many of the subsystems representing the finite decay paths resolve into factors that map entirely separate, non-exponential dynamics.

Specifically, the characteristic polynomial cleanly factors as:$$P_{92}(\lambda) = \lambda^{28} (\lambda - 1) (\lambda + 1) (\lambda^2 + 1) (\lambda^4 + 1) (\lambda^8 + 1) \cdot p_{71}(\lambda)$$Each factored term carries specific structural significance within the automaton:

• The $\lambda^{28}$ term: The algebraic multiplicity of the eigenvalue 0 is 28. This massive nilpotent root cluster stems directly from the block-triangular structure and sparsity of $T$. It indicates that 28 dimensional degrees of freedom within the vector space correspond to "dead-end" decay pathways—elements that rapidly transition toward the ground state (Hydrogen) without looping back or contributing to the long-term exponential multiplication of the string.
  
  
• The Cyclotomic Factors: The terms $(\lambda \pm 1), (\lambda^2 + 1), (\lambda^4 + 1),$ and $(\lambda^8 + 1)$ are cyclotomic polynomials. Their roots are complex roots of unity (e.g., $i, -i$). Geometrically, these correspond to strictly periodic, cyclic loops within the elemental decay graph. They describe subsets of elements that endlessly oscillate in cycles of length 1, 2, 4, or 8. Because the absolute value of all roots of unity is 1, these cyclic loops do not dictate geometric expansion, and their relative impact on the string length washes out to zero against the primary exponential growth.

The Irreducible Factor $p_{71}(\lambda)$

After dividing out the nilpotent elements and the roots of unity, the residual expression is an irreducible polynomial of degree 71 over the integers $\mathbb{Z}$. The roots of this 71-degree polynomial hold the true expansive eigen-dynamics of the transition matrix.

The full polynomial $p_{71}(x)$ is presented as follows:

$ x^{71} - x^{69} - 2x^{68} - x^{67} + 2x^{66} + 2x^{65} + x^{64} - x^{63} - x^{62} - x^{61}$

$ - x^{60} - x^{59}+ 2x^{58} + 5x^{57}+ 3x^{56} - 2x^{55} - 10x^{54} - 3x^{53} - 2x^{52} + 6x^{51}$

$ + 6x^{50} + x^{49} + 9x^{48}- 3x^{47} - 7x^{46} - 8x^{45} - 8x^{44} + 10x^{43}+ 6x^{42} + 8x^{41}$

$ - 5x^{40} - 12x^{39} + 7x^{38} - 7x^{37}+ 7x^{36} + x^{35} - 3x^{34} + 10x^{33} + x^{32} - 6x^{31}$ 

$- 2x^{30} - 10x^{29} - 3x^{28} + 2x^{27} + 9x^{26}- 3x^{25} + 14x^{24} - 8x^{23} - 7x^{21} + 9x^{20}$ 

$+ 3x^{19} - 4x^{18} - 10x^{17} - 7x^{16} + 12x^{15}+ 7x^{14} + 2x^{13} - 12x^{12} - 4x^{11} - 2x^{10} $ 

$+ 5x^9 + x^7 - 7x^6 + 7x^5 - 4x^4 + 12x^3 - 6x^2 + 3x - 6 = 0 $

According to the Perron-Frobenius theorem, this irreducible polynomial guarantees exactly one unique positive real root. Evaluating this root yields Conway's Constant, $\lambda \approx 1.303577269 \dots $, meaning the look-and-say string grows by roughly 30.3% with each iteration.

The manifestation of such a massive, un-simplifiable polynomial from an elementary numeric puzzle is highly unusual. Within combinatorial mathematics, the emergence of naturally occurring algebraic numbers with such high degrees is rare. Other comparable phenomena typically arise only in the deep structural onset of chaotic regimes, such as the 7-cycle onset of the logistic map (degree 114) or specific random matrix models.

Eigenvectors and Asymptotic Elemental Abundances

A direct corollary of deriving the maximal eigenvalue $\lambda$ is the evaluation of its corresponding primary eigenvector. In linear algebra, the primary eigenvector maps the stable, steady-state proportions of the system. As the sequence extends toward infinity, the specific initial seed becomes statistically irrelevant; the relative ratio of the 92 constituent atoms converges absolutely to the coordinates of this primary eigenvector.

Because the vector encapsulates the stoichiometric balance of the elements under continuous fission, it reveals massive disparities in atomic distribution. Hydrogen (22) acts as the ultimate structural sink. As the heaviest elements cascade downward, their descendent paths universally terminate at Hydrogen, causing it to accumulate at a tremendous rate.

Calculations based on the transition matrix eigenvector dictate that Hydrogen is the most abundant element by an overwhelming margin. Out of every 1,000,000 atoms present in a mature sequence, approximately 91,790 of them will be Hydrogen. Conversely, elements that reside on sparse, narrow branches of the DAG without cyclic regeneration are remarkably scarce. Arsenic, for instance, represents the rarest element in the network, appearing on average only 27 times per million atoms. Thus, Conway's matrix modeling provides not just the gross length of the sequence, but a perfect probabilistic model of its microscopic composition over infinite iterations.

Cross-Base Generalizations and Formal Language Invariance

While Conway’s 94-element cosmological framework and the degree-71 polynomial are strictly tethered to the base-10 numerical interpretation of the look-and-say operator, the underlying phenomenon of audioactive decay is invariant across bases. The spontaneous collapse of iterative sequence generation into closed, stable, finite-state decay networks is a fundamental property of run-length encoding recursion.

Evaluating the sequence using base-3 (ternary) representations restricts the alphabet, significantly compressing the necessary states. Analysis has shown that a ternary look-and-say sequence yields a total of only 24 distinct, irreducible elements, generating a completely different transition matrix and a correspondingly smaller polynomial.

Further constraints down to base-2 (binary) variants reduce the "periodic table" to a mere 10 elementary sub-strings. Regardless of the base chosen (be it base-3, base-4, or standard decimal), as long as the base exceeds the maximum contiguous block size generated by the sequence rules, an equivalent transition matrix exists. The specific spectral radius $\lambda$ diverges across bases—for instance, the ternary $\lambda$ is different from the base-10 Conway's constant—but the existence of an irreducible transition matrix, an isolated set of atomic states, and a dominant real growth factor remains mathematically universal.

Conclusion

The exploration of Conway’s look-and-say sequence reveals a brilliant intersection between combinatorial puzzles and deep linear dynamical systems. What begins as an elementary linguistic recitation mechanism inherently constrains itself through the rigid logic of run-length encoding. The sequence cannot expand randomly; it is subjected to immediate microscopic fission, splitting into chemically independent sub-strings.

Conway’s Cosmological Theorem elegantly maps this phenomenon, proving that any arbitrary sequence inevitably collapses into a bounded set of 94 fundamental elemental states within 24 iterations. By abstracting out the anomalies introduced by high-value digits via the oscillating transuranic Plutonium and Neptunium loops, the remaining 92 primordial elements form a unified, completely predictable linear network.

The asymptotic growth rate of the entire system is perfectly encapsulated by the transition matrix of these 92 elements. While the structural sparsity and dead-end pathways of the elemental decay hierarchy produce a 92-degree characteristic polynomial burdened with nilpotent roots and cyclotomic loops, the geometric core of the expansion is housed entirely within an irreducible, 71-degree factor.

Conway's Constant ($\lambda \approx 1.303577$) - the unique positive real root of this 71-degree polynomial - is therefore not merely a statistical growth rate. It is the absolute mathematical limit dictated by the topology of the 94-element state machine, governing both the exponential expansion of the string and the steady-state eigenvector abundances of its atomic components. The look-and-say sequence thus transcends its origins, standing as a premier demonstration of how simple, deterministic recursive operators spontaneously architect complex, irreducible finite-state universes.

From Polynomial to Linear Recurrence

I noticed that the number associated with my diurnal age today (28080) is a member of OEIS  A144459 formed from a quadratic polynomial:$$ \text{a}(n) = (3n+1)(5n+1) $$The initial members are:

1, 24, 77, 160, 273, 416, 589, 792, 1025, 1288, 1581, 1904, 2257, 2640, 3053, 3496, 3969, 4472, 5005, 5568, 6161, 6784, 7437, 8120, 8833, 9576, 10349, 11152, 11985, 12848, 13741, 14664, 15617, 16600, 17613, 18656, 19729, 20832, 21965, 23128, 24321, 25544, 26797, 28080

What interested me was that the sequence members could also be generated from a linear recurrence:$$ \begin{align} \text{a}(n) = 3\text{a}(n-1) -3\text{a}(n-2) +\text{a}(n-3) \\ \text{with } \text{a}(0)=1, \text{a}(1)=24 \text{ and } \text{a}(2)=77 \end{align}$$How do we get from \( \text{a}(n) = (3n+1)(5n+1) \text{ to } \text{a}(n-1) -3\text{a}(n-2) +\text{a}(n-3) \)? Gemini's response was a follows:

Deriving the Linear Recurrence for OEIS A144459

To derive the linear recurrence \(a(n) = 3a(n-1) - 3a(n-2) + a(n-3)\) from the explicit formula \(a(n) = (3n+1)(5n+1)\), we utilize the Method of Finite Differences.

This method relies on a fundamental rule of sequence algebra: Any sequence defined by a polynomial of degree \(d\) satisfies a linear recurrence relation of order \(d+1\) with binomial coefficients.

Step 1: Determine the Degree of the Polynomial

First, expand the explicit formula to see the structure of the polynomial:

$$ a(n) = (3n+1)(5n+1) $$ $$ a(n) = 15n^2 + 3n + 5n + 1 $$ $$ a(n) = 15n^2 + 8n + 1 $$

Since the highest power of \(n\) is 2, this is a quadratic polynomial (degree \(d=2\)).

Step 2: Apply the Difference Operator Rule

In the calculus of finite differences, we use the difference operator \(\Delta\). The rule states that if \(a(n)\) is a polynomial of degree 2:

• The first differences are linear (degree 1).
• The second differences are constant (degree 0).
• The third differences are exactly zero.

Mathematically, this means:

$$ \Delta^3 a(n) = 0 $$

Step 3: Expand using Shift Operators

We express the difference operator \(\Delta\) in terms of the shift operator \(E\), where \(E a(n) = a(n+1)\). We know that \(\Delta = E - 1\).

Since the third difference is zero, we substitute \((E-1)\) for \(\Delta\):

$$ (E - 1)^3 a(n) = 0 $$

Now, we expand the cubic term using standard binomial expansion:

$$ (E^3 - 3E^2 + 3E - 1) a(n) = 0 $$

Step 4: Apply the Operators to the Sequence

Distribute the operator \(a(n)\) across the expanded terms. Recall that \(E^k a(n) = a(n+k)\):

$$ a(n+3) - 3a(n+2) + 3a(n+1) - a(n) = 0 $$

To match the standard recurrence form (where the highest term is \(a(n)\)), we shift the indices down by 3 (replace \(n\) with \(n-3\)):

$$ a(n) - 3a(n-1) + 3a(n-2) - a(n-3) = 0 $$

Step 5: Rearrange to the Final Recurrence

Move the negative terms to the right side to isolate \(a(n)\):

$$ a(n) = 3a(n-1) - 3a(n-2) + a(n-3) $$

---

Verification

We verify this by checking the initial values given for A144459.

Explicit Formula: \(a(n) = 15n^2 + 8n + 1\)

• \(a(0) = 1\), \(a(1) = 24\), \(a(2) = 77\)

Recurrence Check for \(a(3)\):

$$ a(3) = 3(77) - 3(24) + 1 $$ $$ a(3) = 231 - 72 + 1 $$ $$ a(3) = 160 $$

This matches the explicit calculation \(15(3)^2 + 8(3) + 1 = 160\).

******************************

Here is another example just to reinforce what's been covered earlier.

1. The Transformation Process

To convert the polynomial closed form into a linear recurrence relation, we use the method of finite differences. Since the polynomial \( a_n = 2n^2 + 6n + 1 \) is of degree \( d=2 \), the sequence has a constant second difference and a zero third difference.

Step 1: Set up the Difference Operator

We define the shift operator \( E \) such that \( E a_n = a_{n+1} \). The difference operator is \( \Delta = E - 1 \). Because the degree is 2, the third difference is zero: \[ \Delta^3 a_n = 0 \]

Step 2: Expand the Operator

Substitute \( \Delta = E - 1 \) and expand the cubic expression: \[ (E - 1)^3 a_n = 0 \] \[ (E^3 - 3E^2 + 3E - 1) a_n = 0 \]

Step 3: Apply the Shift Operator

Distributing the operator to \( a_n \) gives the recurrence relation in terms of forward shifts: \[ a_{n+3} - 3a_{n+2} + 3a_{n+1} - a_n = 0 \]

Step 4: Final Linear Recurrence

To solve for the current term based on previous terms, we shift the indices down by 3 (replace \( n+3 \) with \( n \)): \[ \boxed{ a_n = 3a_{n-1} - 3a_{n-2} + a_{n-3} } \]

Initial Conditions:

We calculate the first three seeds using the original polynomial \( 2n^2 + 6n + 1 \):

• \( a_0 = 1 \)
• \( a_1 = 9 \)
• \( a_2 = 21 \)

---

2. Comparison and Verification

The table below compares the values generated by the closed form polynomial against the derived linear recurrence.

\[ \begin{array}{|c|c|c|c|} \hline \textbf{n} & \textbf{Closed Form} & \textbf{Recurrence} & \textbf{Match} \\ & (2n^2 + 6n + 1) & (3a_{n-1} - 3a_{n-2} + a_{n-3}) & \\ \hline 0 & 1 & 1 & \text{True} \\ \hline 1 & 9 & 9 & \text{True} \\ \hline 2 & 21 & 21 & \text{True} \\ \hline 3 & 37 & 37 & \text{True} \\ \hline 4 & 57 & 57 & \text{True} \\ \hline 5 & 81 & 81 & \text{True} \\ \hline 6 & 109 & 109 & \text{True} \\ \hline 7 & 141 & 141 & \text{True} \\ \hline 8 & 177 & 177 & \text{True} \\ \hline 9 & 217 & 217 & \text{True} \\ \hline \end{array} \]

Linear Recurrence Revisited

It's been a while since I posted about linear recurrence relations. The only two posts were:

• Solving Linear Recurrence on the 16th of June 2020
  
• More on Linear Recurrence on the 26th December 2020

Today I turned \(28073\) days old and one of the properties of this number is that it's a member of OEIS A105578:$$ \begin{align}  &\text{a}(n+3) = 2\text{a}(n+2) - 3\text{a}(n+1) + 2\text{a}(n)\\ &a(0) = 1, a(1) = 1, a(2) = 0 \end{align}$$This linear recurrence of order 3 corresponds to the cubic equation:$$ \begin{align} &x^3 = 2x^2 -3x +2 \\ &x^3-2x^2+3x-2 = 0 \end{align}$$The polynomial \( \text{P}(x) = x^3-2x^2+3x-2 \) has three roots, one real (at \(x=1\) ) and two complex. See Figure 1.

Figure 1

The roots are:

• \( x_1=1 \)
• \( x_2 = \dfrac{1}{2}(1-i \sqrt{7}) \)
• \( x_3 = \dfrac{1}{2}(1+i \sqrt{7}) \)

These roots can be used to find any term in the sequence because of the following relationship:$$a_n=A(x_1)^n+B(x_2)^n+C(x_3)^n \text{ with A, B and C constants}$$Substituting the initial conditions we get three equations in three unknowns:$$ \begin{align} A + B + C &= 1 \\ Ax_1+Bx_2+Cx_3 &=1 \\ A(x_1)^2+B(x_2)^2+C(x_3)^2 &=0 \end{align} $$In terms of the roots, the values for \( A, B \text{ and } C \) are:$$ \begin{align} A = \frac{x_1 - x_2 x_3 - (x_2 + x_3)}{(x_1 - x_2)(x_1 - x_3)} \\ B = \frac{x_2 - x_1 x_3 - (x_1 + x_3)}{(x_2 - x_1)(x_2 - x_3)} \\ C = \frac{x_3 - x_1 x_2 - (x_1 + x_2)}{(x_3 - x_1)(x_3 - x_2)} \end{align} $$We know that when \(n=32\), the term is 28072 (my diurnal age) so let's check if that works by substituting the values of \( x_1,x_2 \text{ and } x_3 \) into and summarising at the same time what we've found previously:$$
\begin{array}{l}
\textbf{Step 1: Determine the Roots of the Characteristic Equation} \\[6pt]
x^3 - 2x^2 + 3x - 2 = 0 \\[4pt]
(x-1)(x^2 - x + 2) = 0 \\[4pt]
\text{The roots are:} \\[4pt]
x_1 = 1 \\[4pt]
x_2 = \dfrac{1 + i\sqrt{7}}{2} \\[4pt]
x_3 = \dfrac{1 - i\sqrt{7}}{2} \\[18pt]


\textbf{Step 2: Find Constants A, B, and C} \\[6pt]
\text{Using the initial conditions } a_0=1, a_1=1, a_2=0: \\[6pt]
A = \dfrac{1}{2} \\[6pt]
B = \dfrac{1}{4} - \dfrac{i}{4\sqrt{7}} \\[6pt]
C = \dfrac{1}{4} + \dfrac{i}{4\sqrt{7}} \\[18pt]


\textbf{Step 3: Construct the Explicit Formula} \\[6pt]
a_n = A(x_1)^n + B(x_2)^n + C(x_3)^n \\[6pt]
a_n = \dfrac{1}{2}(1)^n + \left(\dfrac{1}{4} - \dfrac{i}{4\sqrt{7}}\right)\left(\dfrac{1 + i\sqrt{7}}{2}\right)^n + \left(\dfrac{1}{4} + \dfrac{i}{4\sqrt{7}}\right)\left(\dfrac{1 - i\sqrt{7}}{2}\right)^n \\[18pt]


\textbf{Step 4: Verify for } n=32 \text{ (Detailed Breakdown)} \\[12pt] \text{We need to sum three terms: } \\[4pt] a_{32} = \underbrace{A(x_1)^{32}}_{\text{Term 1}} + \underbrace{B(x_2)^{32}}_{\text{Term 2}} + \underbrace{C(x_3)^{32}}_{\text{Term 3}} \\[18pt] \textbf{1. Calculate Term 1 (The Real Root)} \\[6pt] \text{Since } x_1 = 1 \text{ and } A = 0.5: \\[6pt] \text{Term 1} = 0.5 \cdot (1)^{32} = \mathbf{0.5} \\[18pt] \textbf{2. Calculate Terms 2 and 3 (The Complex Roots)} \\[6pt] \text{Notice that } C \text{ is the complex conjugate of } B, \text{ and } x_3 \text{ is the conjugate of } x_2. \\[6pt] \text{This implies that Term 3 is the complex conjugate of Term 2.} \\[6pt] \text{Mathematical Rule: } Z + \bar{Z} = 2 \cdot \text{RealPart}(Z). \\[6pt] \text{Therefore, we only need to calculate Term 2 and double its real component.} \\[12pt] \text{Let } x_2 = \sqrt{2}e^{i\theta} \text{ (Polar form, where } \sqrt{2} \text{ is the magnitude)}. \\[6pt] (x_2)^{32} = (\sqrt{2})^{32} e^{i32\theta} = 2^{16} (\cos(32\theta) + i\sin(32\theta)) \\[6pt] (x_2)^{32} = 65536 (\cos(32\theta) + i\sin(32\theta)) \\[12pt] \text{When we multiply this by } B \text{ and take } 2 \times \text{Real Part, the result is exactly:} \\[6pt] \text{Term 2} + \text{Term 3} = \mathbf{28071.5} \\[18pt] \textbf{3. Final Total} \\[6pt] a_{32} = \text{Term 1} + (\text{Terms 2 \& 3}) \\[6pt] a_{32} = 0.5 + 28071.5 \\[6pt] a_{32} = \mathbf{28072} \end{array} $$

Getting back to OEIS A105578, a plot of the first 52 members is show in Figure 2:

1, 1, 0, -1, 0, 3, 4, -1, -8, -5, 12, 23, 0, -45, -44, 47, 136, 43, -228, -313, 144, 771, 484, -1057, -2024, 91, 4140, 3959, -4320, -12237, -3596, 20879, 28072, -13685, -69828, -42457, 97200, 182115, -12284, -376513, -351944, 401083, 1104972, 302807, -1907136, -2512749, 1301524, 6327023, 3723976, -8930069, -16378020, 1482119, 34238160, 31273923, -37202396

Figure 2: permalink

It can be seen that after a while the values between to fluctuate wildly between larger and larger positive and negative values.

There is a database for a great many linear recurrences of order 3 listed here.

Cyclotomic Polynomials Revisited

It was in November of 2020 that I made my first and only post about cyclotomic polynomials. Here is a link to that post. Today I was reminded of this category of polynomials because the number associated with my diurnal age today, 28057, is connected with the third cyclotomic polynomial, namely \(x^2 + x + 1\) because the number is a member of OEIS A053183:

  OEIS A053183: primes of the form \(p^2 + p + 1\) when \(p\) is prime.

In the case of 28057, the value of \(p\) is 167 and thus:$$28057 = 167^2 + 167 + 1$$What follows is what Gemini had to say about this particular polynomial.

The Complex Roots of $x^2 + x + 1 = 0$

The roots of the polynomial $x^2 + x + 1$ are the two primitive cube roots of unity. In mathematical literature, these are commonly denoted by the Greek letters ω (omega) and ω².

1. Numerical Values

Using the quadratic formula, we find the exact complex coordinates:

• x₁: $-\dfrac{1}{2} + \dfrac{\sqrt{3}}{2}i$ (approx. $-0.5 + 0.866i$)
  
  
• x₂: $-\dfrac{1}{2} - \dfrac{\sqrt{3}}{2}i$ (approx. $-0.5 - 0.866i$)

2. Geometric Representation

When plotted on the Argand plane (complex plane), these roots exhibit specific geometric properties:

• The Unit Circle: Both roots have a magnitude of 1, meaning they sit exactly on the circumference of a circle with radius 1 centered at the origin.
  
  
• Conjugate Symmetry: The roots are reflections of each other across the real (horizontal) axis.
  
  
• The Equilateral Triangle: These two roots, combined with the third cube root ($x = 1$), form the vertices of a perfect equilateral triangle.

For further exploration of complex numbers and their visualization, you can use tools like the GeoGebra Complex Number Tool or check detailed proofs on Wolfram MathWorld.

All numbers generated by \(x^2+x+1\) for positive integer values of \(x\) are one more than the pronic numbers because the polynomial can be written as \(x(x+1) + 1 \).

A Well-Known Legendre Prime-Producing Polynomial

 Here is what Gemini had to say about the prime-producing polynomial \( 2 k^2+29\):

The polynomial \( 2 k^2+29\) is a well-known example of a prime-producing polynomial, often associated with the French mathematician Adrien-Marie Legendre. Here's a breakdown of its discovery, usage, and prime-producing potential:

Discovery:

• Adrien-Marie Legendre (1752-1833) is credited with the discovery of the polynomial \( 2  k^2+29\). He published this result in his work "Essai sur la théorie des nombres" in 1798.

• This came in the wake of significant work on prime-generating polynomials, notably Euler's polynomial \(k^2+k+41\), which generates primes for 40 consecutive integer values. Legendre's work further explored this fascinating property in different polynomial forms.

Usage and Significance:

• Illustrates Prime-Generating Properties: While no non-constant polynomial with integer coefficients can generate only prime numbers for all integer values (this has been proven), polynomials like \( 2 k^2+29\) are significant because they produce a surprisingly long sequence of prime numbers for consecutive integer inputs.

• Connection to Class Number Theory: The behavior of such prime-producing quadratic polynomials is deeply connected to the theory of class numbers in imaginary quadratic fields. The fact that \( 2 k^2+29\) (and other similar polynomials like Euler's \(k^2+k+41\)) produce so many primes is not a coincidence but is tied to specific properties of the corresponding quadratic fields.

• Educational and Recreational Mathematics: These polynomials are frequently used in number theory courses and popular science to demonstrate the elusive nature of prime number distribution and the intriguing patterns that can emerge. They serve as excellent examples to explore the question of "prime-generating formulas."

• In Popular Culture: The sequence of primes generated by \( 2 k^2+29\) has even appeared in popular culture, such as in Ken Follett's novel "Code to Zero."

Prime-Producing Potential:

• The polynomial \( \text{P}(k)= 2 k^2+29 \) generates prime numbers for a remarkable number of consecutive integer values of \(k\). Specifically, it produces primes for \(k=0,1,2, \dots 28\). This means it generates 29 consecutive primes starting from $P(0)=29$.

• Let's list the first few:

  • \( \text{P}(0)=2 \times 0^2+29=29 \) (prime)

  • \( \text{P}(1)=2 \times 1^2+29=31\) (prime)

  • \( \text{P}(2)=2 \times 2^2+29=37 \) (prime)

  • \( \text{P}(3)=2 \times 3^2+29=47 \) (prime)

  • ...and so on, up to \( \text{P}(28) \).

• For \(k=29\)$$\text{P}(29)=2 \times 29^2+29=29 \, (2×29+1)=29 \times 59$$which is a composite number. This illustrates the general principle that no such polynomial can produce primes indefinitely.

In summary, Legendre's polynomial \( 2 k^2+29\) is a notable discovery in number theory, demonstrating an impressive string of prime outputs for consecutive integer inputs. Its significance lies in its historical context alongside other prime-generating polynomials like Euler's, its connection to deeper number theoretic concepts like class numbers, and its role as a compelling example in the study of prime numbers.

The polynomial popped up because of a reference to it in OEIS A241554: composite numbers of the form \(2  k^2 + 29\). The number associated with my diurnal age today, 27877, is a member of this sequence:$$ \begin{align} \text{If }k &=118 \\ 2k^2+29 &= 2 \times 118^2+29 \\ &= 27877 \\ &=61 \times 457 \end{align}$$When this polynomial is not busy churning out primes, it is busy churning out semiprimes. In fact, it is only when \(k=185\) that we get a number that is not a prime or a semiprime:$$\begin{align} \text{If }k &=185 \\ 2k^2+29 &= 2 \times 185^2+29 \\ &= 68479 \\ &=31 \times 47^2 \end{align}$$Follow this permalink to generate a table of these numbers and their factors. Here is a list of the members of OEIS A241554 between 1 and 40000:

1711, 1829, 2077, 2479, 3071, 3901, 5029, 6527, 6757, 7471, 7967, 8479, 10397, 10981, 11581, 14141, 15167, 15517, 15871, 16591, 16957, 17701, 18079, 18847, 19631, 20837, 22927, 23791, 25567, 26941, 27877, 28829, 29797, 30287, 31279, 31781, 32287, 35941, 38117

The table below shows the factorisations of the previous numbers as well as the corresponding \(k\) values:

  k     2*k^2+29   factors

  29    1711       29 * 59
  30    1829       31 * 59
  32    2077       31 * 67
  35    2479       37 * 67
  39    3071       37 * 83
  44    3901       47 * 83
  50    5029       47 * 107
  57    6527       61 * 107
  58    6757       29 * 233
  61    7471       31 * 241
  63    7967       31 * 257
  65    8479       61 * 139
  72    10397      37 * 281
  74    10981      79 * 139
  76    11581      37 * 313
  84    14141      79 * 179
  87    15167      29 * 523
  88    15517      59 * 263
  89    15871      59 * 269
  91    16591      47 * 353
  92    16957      31 * 547
  94    17701      31 * 571
  95    18079      101 * 179
  97    18847      47 * 401
  99    19631      67 * 293
  102   20837      67 * 311
  107   22927      101 * 227
  109   23791      37 * 643
  113   25567      37 * 691
  116   26941      29 * 929
  118   27877      61 * 457
  120   28829      127 * 227
  122   29797      83 * 359
  123   30287      31 * 977
  125   31279      31 * 1009
  126   31781      61 * 521
  127   32287      83 * 389
  134   35941      127 * 283
  138   38117      47 * 811

There are 103 primes in the range up to 40000 that are generated by this polynomial. These start with \(k=0\):

29, 31, 37, 47, 61, 79, 101, 127, 157, 191, 229, 271, 317, 367, 421, 479, 541, 607, 677, 751, 829, 911, 997, 1087, 1181, 1279, 1381, 1487, 1597, 1951, 2207, 2341, 2621, 2767, 2917, 3229, 3391, 3557, 3727, 4079, 4261, 4447, 4637, 4831, 5231, 5437, 5647, 5861, 6079, 6301, 6991, 7229, 7717, 8221, 8741, 9007, 9277, 9551, 9829, 10111, 10687, 11279, 11887, 12197, 12511, 12829, 13151, 13477, 13807, 14479, 14821, 16229, 17327, 18461, 19237, 20029, 20431, 21247, 21661, 22079, 22501, 23357, 24229, 24671, 25117, 26021, 26479, 27407, 28351, 29311, 30781, 32797, 33311, 33829, 34351, 34877, 35407, 36479, 37021, 37567, 38671, 39229, 39791

Partitions and Generating Functions

I asked Gemini to explain the statement:

“It’s long been known that you can associate

a polynomial equation to any partition.”

Here's what it came up with.

The statement refers to the relationship between an integer partition and a generating function, which is a way of encoding an infinite sequence of numbers as the coefficients of a formal power series. In this context, the "polynomial equation" is more accurately a generating function, which can be represented as a polynomial-like expression.

A partition of a positive integer \(n\) is a way of writing \(n\) as a sum of positive integers. The order of the addends (the parts of the partition) does not matter. For example, the partitions of the number 4 are:

• 4

• 3 + 1

• 2 + 2

• 2 + 1 + 1

• 1 + 1 + 1 + 1

The statement means that for any given integer, we can construct a polynomial-like expression (a generating function) that "encodes" all of its possible partitions.

How the Association Works

The connection is established through the concept of generating functions. The generating function for the number of partitions of an integer \(n\), denoted as \( p(n) \), can be expressed as an infinite product:$$P(x) = \sum_{n=0}^{\infty} p(n)x^n = \prod_{k=1}^{\infty} \frac{1}{1-x^k}$$Let's break down this formula:

• \( p(n) \) This represents the number of partitions for an integer \(n\)

• \( \displaystyle\sum_{n=0}^{\infty} p(n)x^n \) This is the power series where the coefficient of \(x^n\) is the number of partitions of \(n\).

• \(\displaystyle\prod_{k=1}^{\infty} \dfrac{1}{1-x^k}\) This is the infinite product that generates these coefficients.

Each term in the product \( \dfrac{1}{1-x^k} \) can be expanded as a geometric series:

• \(\dfrac{1}{1-x} = 1 + x + x^2 + x^3 + \dots \) This represents using the number 1 as a part in the partition

• \(\dfrac{1}{1-x^2} = 1 + x^2 + x^4 + x^6 + \dots\) This represents using the number 2 as a part

• \( \dfrac{1}{1-x^3} = 1 + x^3 + x^6 + x^9 + \dots \) This represents using the number 3 as a part

• And so on for all integers \(k\).

When you multiply these series together, the coefficient of \(x^n\) in the resulting series will be the total number of ways to form \(n\) by adding these parts.

Examples

Let's find the partitions for the number 3. The partitions are:

• 3

• 2 + 1

• 1 + 1 + 1

There are 3 partitions of 3.

Now, let's see how the generating function gives us this result. We look at the expansion of the product:$$(1 + x + x^2 + x^3 + \dots)(1 + x^2 + x^4 + \dots)(1 + x^3 + x^6 + \dots) \dots$$To get the term \(x^3\), we can combine terms from these expansions in the following ways:

• From the first factor, take \(x^3\). This corresponds to the partition 1 + 1 + 1.

• From the first factor, take \(x^1\), and from the second factor, take \(x^2\). This corresponds to the partition 1 + 2.

• From the third factor, take \(x^3\). This corresponds to the partition 3.

The coefficient of \(x^3\) is therefore 3, which matches the number of partitions.

Here is another example for the partitions of 4, which we know is 5.

To find the coefficient of \(x^4\), we would consider combinations like:

• \(x^4\) from the first factor: 1 + 1 + 1 + 1

• \(x^2\) from the first factor and \(x^2\) from the second: 1 + 1 + 2

• \(x^1\) from the first factor and \(x^3\) from the third: 1 + 3

• \(x^4\) from the second factor: 2 + 2

• \(x^4\) from the fourth factor: 4

The total number of ways to get \(x^4\) is 5, so the coefficient is 5.

In essence, the "polynomial" or generating function provides a systematic way to count the number of partitions for any integer by looking at the coefficients of the series expansion.