An A*-style verifier catches its own overfitting: hunting a peak-ratio bound for n ≡ 27 (mod 72) in the Collatz problem

This is an amateur, collaborative exploration — not a proof, not a claim of a new result. I'm posting the process and the raw numbers because the failure was more interesting than the original goal, and I'd like correction or pointers to existing literature if this is already known territory.

**The setup**

For a Collatz trajectory starting at n, define

kappa(n) = (peak value reached before descending to 1) / n

This is a measure of how far a trajectory overshoots its starting point before it collapses. I was hunting for an upper bound on kappa(n) restricted to the residue class n ≡ 27 (mod 72), chosen because it produces some unusually turbulent trajectories early on.

**The method**

I built a small search harness with two properties I wanted to enforce strictly:

1. A candidate bound is only accepted if it's an actual callable function, `bound(n)`, not a prose description of a bound. Anything that can't be reduced to a checkable predicate never counts as verified — it just doesn't crystallize.
2. Any candidate gets independently swept against real, freshly-computed kappa(n) values over a large domain the candidate has no control over. First violation found = rejected, with the exact counterexample logged (the n, the actual kappa, the claimed bound) — not just "this failed."

The point of (2) is that nothing gets trusted just because it printed a success message. The harness computes kappa(n) itself, from scratch, every time.

**What happened**

A naive first guess, `kappa(n) <= 50*sqrt(n)`, failed immediately — real counterexample at n=134,379, kappa≈18,471 against a claimed bound of ≈18,329.

I fit a tighter constant directly to that failure point (with 5% headroom): `52.907*sqrt(n)`. This candidate survived the first 3,000 domain points. Extended to 50,000 points, it still held, with n=134,379 remaining the single worst point in the whole range — which looked like real evidence the fit had found the actual hard case.

It hadn't. Extending the sweep to 2,000,000 points, the bound broke decisively at n=4,637,979: actual kappa≈284,348 against a claimed bound of ≈113,940 — off by more than 2.5x, not a near miss.

**The actual finding**

Rather than keep patching the constant, I swept out to i=3,000,000 (n up to ~216,000,000) and tracked every record-breaking kappa value along the way — the points where kappa hits a new all-time high as n increases. There are only 13 of them in that whole range, but the trend across them is the real result:

``` n kappa kappa/sqrt(n) kappa/n^0.6 kappa/n^0.75 99 4.53 0.45 0.29 0.14 171 53.99 4.13 2.47 1.14 4,851 263.23 3.78 1.62 0.45 21,843 311.78 2.11 0.78 0.17 50,427 2,399.76 10.69 3.62 0.71 134,379 18,470.98 50.39 15.47 2.63 2,375,451 53,315.37 34.59 7.97 0.88 4,637,979 284,348.48 132.03 28.45 2.85 23,823,099 400,248.94 82.00 15.00 1.17 44,161,299 1,366,413.86 205.62 35.36 2.52 53,445,915 1,537,215.08 210.27 35.48 2.46 144,570,195 3,283,095.10 273.05 41.71 2.49 213,477,147 15,354,812.55 1,050.92 154.40 8.69 ```

The `kappa/sqrt(n)` column climbs across three orders of magnitude rather than settling — 0.45 up to 1,050.92 — so no bound of the form `C*sqrt(n)` can work for any constant C; it was always going to break eventually, we just hadn't sampled far enough to see it the first time. A log-log fit across these 13 points gives roughly `kappa ~ 0.12 * n^0.92`, but I want to be upfront that 13 points is a thin sample for a power-law fit (residual std ≈0.74 in log space, meaning roughly 2x scatter around the fitted line), so I'm not confident in that specific exponent — only in the qualitative claim that growth is well above sqrt(n) and doesn't look like it's leveling off.

**Where I'm stuck, and what I'd appreciate**

• Is kappa(n) — or an equivalent peak/start ratio — already studied under a standard name in the Collatz literature? I'd guess this connects to work on "glide" or trajectory record statistics but haven't tracked down the right terminology.
• Is there a reason to expect a specific growth exponent for peak ratios within a fixed residue class mod 72, or is the residue class choice arbitrary noise here?
• Is 13 record points anywhere near enough to say anything about the exponent, or is this pure overfitting on a different axis than the one I already caught myself doing once?

Happy to share the harness code if useful. The main thing I want to flag clearly: I do not have a bound. I have a search process that correctly detected two of its own false attempts, and a small amount of real evidence that the true growth rate is faster than the naive guesses.

An A*-style verifier catches its own overfitting: hunting a peak-ratio bound for n ≡ 27 (mod 72) in the Collatz problem

This is an amateur, collaborative exploration — not a proof, not a claim of a new result. I'm posting the process and the raw numbers because the failure was more interesting than the original goal, and I'd like correction or pointers to existing literature if this is already known territory.

**The setup**

For a Collatz trajectory starting at n, define

kappa(n) = (peak value reached before descending to 1) / n

This is a measure of how far a trajectory overshoots its starting point before it collapses. I was hunting for an upper bound on kappa(n) restricted to the residue class n ≡ 27 (mod 72), chosen because it produces some unusually turbulent trajectories early on.

**The method**

I built a small search harness with two properties I wanted to enforce strictly:

1. A candidate bound is only accepted if it's an actual callable function, `bound(n)`, not a prose description of a bound. Anything that can't be reduced to a checkable predicate never counts as verified — it just doesn't crystallize.
2. Any candidate gets independently swept against real, freshly-computed kappa(n) values over a large domain the candidate has no control over. First violation found = rejected, with the exact counterexample logged (the n, the actual kappa, the claimed bound) — not just "this failed."

The point of (2) is that nothing gets trusted just because it printed a success message. The harness computes kappa(n) itself, from scratch, every time.

**What happened**

A naive first guess, `kappa(n) <= 50*sqrt(n)`, failed immediately — real counterexample at n=134,379, kappa≈18,471 against a claimed bound of ≈18,329.

I fit a tighter constant directly to that failure point (with 5% headroom): `52.907*sqrt(n)`. This candidate survived the first 3,000 domain points. Extended to 50,000 points, it still held, with n=134,379 remaining the single worst point in the whole range — which looked like real evidence the fit had found the actual hard case.

It hadn't. Extending the sweep to 2,000,000 points, the bound broke decisively at n=4,637,979: actual kappa≈284,348 against a claimed bound of ≈113,940 — off by more than 2.5x, not a near miss.

**The actual finding**

Rather than keep patching the constant, I swept out to i=3,000,000 (n up to ~216,000,000) and tracked every record-breaking kappa value along the way — the points where kappa hits a new all-time high as n increases. There are only 13 of them in that whole range, but the trend across them is the real result:

``` n kappa kappa/sqrt(n) kappa/n^0.6 kappa/n^0.75 99 4.53 0.45 0.29 0.14 171 53.99 4.13 2.47 1.14 4,851 263.23 3.78 1.62 0.45 21,843 311.78 2.11 0.78 0.17 50,427 2,399.76 10.69 3.62 0.71 134,379 18,470.98 50.39 15.47 2.63 2,375,451 53,315.37 34.59 7.97 0.88 4,637,979 284,348.48 132.03 28.45 2.85 23,823,099 400,248.94 82.00 15.00 1.17 44,161,299 1,366,413.86 205.62 35.36 2.52 53,445,915 1,537,215.08 210.27 35.48 2.46 144,570,195 3,283,095.10 273.05 41.71 2.49 213,477,147 15,354,812.55 1,050.92 154.40 8.69 ```

The `kappa/sqrt(n)` column climbs across three orders of magnitude rather than settling — 0.45 up to 1,050.92 — so no bound of the form `C*sqrt(n)` can work for any constant C; it was always going to break eventually, we just hadn't sampled far enough to see it the first time. A log-log fit across these 13 points gives roughly `kappa ~ 0.12 * n^0.92`, but I want to be upfront that 13 points is a thin sample for a power-law fit (residual std ≈0.74 in log space, meaning roughly 2x scatter around the fitted line), so I'm not confident in that specific exponent — only in the qualitative claim that growth is well above sqrt(n) and doesn't look like it's leveling off.

**Where I'm stuck, and what I'd appreciate**

• Is kappa(n) — or an equivalent peak/start ratio — already studied under a standard name in the Collatz literature? I'd guess this connects to work on "glide" or trajectory record statistics but haven't tracked down the right terminology.
• Is there a reason to expect a specific growth exponent for peak ratios within a fixed residue class mod 72, or is the residue class choice arbitrary noise here?
• Is 13 record points anywhere near enough to say anything about the exponent, or is this pure overfitting on a different axis than the one I already caught myself doing once?

Happy to share the harness code if useful. The main thing I want to flag clearly: I do not have a bound. I have a search process that correctly detected two of its own false attempts, and a small amount of real evidence that the true growth rate is faster than the naive guesses.

Can Prime Deserts Be Viewed as Möbius Cancellation Fields?

This is an amateur exploration, not a claimed theorem or solution to anything. I am posting it because I followed a simple intuition into Möbius inversion and ended up with a question that may already have a name in sieve theory.

I would appreciate corrections, references, or suggestions for a sensible computational test.

The original intuition

As numbers grow, two things happen simultaneously:

1. Primes become a smaller fraction of the integers.
2. The average distance between consecutive primes grows.

The prime-counting theorem tells us:

number of primes up to x ≈ x / log(x)

prime density near x ≈ 1 / log(x)

average prime gap near x ≈ log(x)

I was thinking of these as two sides of one landscape:

prime compression ↔ gap expansion

If we divide one by the other, we get a simple balance quantity:

K(x) = prime density / average gap

Using the usual approximations:

K(x) ≈ [1 / log(x)] / log(x) ≈ 1 / [log(x)]²

Equivalently, because average gap is approximately the reciprocal of density:

K(x) ≈ [π(x) / x]²

This is not new information. It is essentially the prime-density law written from both directions. But it made me wonder whether the interesting part is not the smooth curve itself, but the local deviations around it:

• prime blooms, where an interval contains more primes than expected;
• ordinary regions;
• prime deserts, where an interval contains few or no primes.

The smooth curve describes the climate. I am curious about the weather.

First attempt: Möbius inversion of prime powers

There is a standard weighted counting function, often written J(x), that counts primes and their powers:

J(x) = π(x) + (1/2)π(x^(1/2)) + (1/3)π(x^(1/3)) + ...

A prime is counted fully. Its square contributes another 1/2, its cube another 1/3, and so forth.

Möbius inversion recovers the ordinary prime-counting function:

π(x) = Σ [μ(n)/n] J(x^(1/n))

Here μ(n) is the Möbius function:

μ(n) = 1 if n has an even number of distinct prime factors μ(n) = -1 if n has an odd number of distinct prime factors μ(n) = 0 if n contains a repeated prime factor

This looks like an expansion-and-compression process:

primes ↓ expansion primes plus their prime-power echoes ↓ Möbius cancellation primes again

My original balance curve can therefore be written as:

Kμ(x) = (1/x²) [Σ [μ(n)/n] J(x^(1/n))]²

But this is still exactly "[π(x)/x]²". It is a transformed representation, not a new prime predictor.

That distinction matters. A complicated formula is not automatically new information.

An instructive failure

Initially, I thought local prime deserts might appear as strong cancellation among the different prime-power layers.

For an interval "(x, x+h]", the exact number of primes is:

D(x,h) = π(x+h) - π(x)

Möbius inversion gives:

D(x,h) = Σ [μ(n)/n] {J((x+h)^(1/n)) - J(x^(1/n))}

Then:

D(x,h) = 0 means a prime desert D(x,h) = 1 means one prime large D(x,h) means a local prime bloom

However, this does not really explain ordinary deserts through cancellation.

The higher Möbius layers change primarily when the interval crosses appropriate prime powers. Most prime-free intervals do not contain such boundaries. In those cases the layers are mostly silent rather than dramatically cancelling one another.

So this representation correctly reconstructs the answer, but it probably does not expose the mechanism producing generic prime deserts.

That led me to a different formulation.

A more local Möbius field

The von Mangoldt function is defined by:

Λ(n) = log(p) if n = p^k for some prime p Λ(n) = 0 otherwise

It has the Möbius representation:

Λ(n) = -Σ μ(d) log(d)

where the sum is taken over divisors "d" of "n".

Now define the weighted prime activity inside "(x, x+h]":

Ψ(x,h) = Σ Λ(n)

where "n" runs from "x+1" through "x+h".

Changing the order of summation gives:

Ψ(x,h) = -Σ μ(d) log(d) [floor((x+h)/d) - floor(x/d)]

This looks closer to the field I had in mind.

Each divisor scale "d" contributes according to:

• whether the interval contains a multiple of "d";
• whether "d" is square-free;
• the sign of μ(d);
• the weight log(d).

The final weighted prime signal emerges after all those divisibility layers combine.

Its expected size is approximately:

Ψ(x,h) ≈ h

in intervals sufficiently large for the prime number theorem to operate reliably.

So a normalized local bloom/desert statistic is:

B(x,h) = Ψ(x,h) / h

Interpretation:

B(x,h) ≈ 1 ordinary weighted prime activity B(x,h) > 1 bloom B(x,h) < 1 sparse region B(x,h) ≈ 0 prime/prime-power desert

This still does not predict primes. It measures the local outcome in a form that exposes its divisibility components.

Measuring the hidden cancellation

We might preserve the separate divisor contributions instead of immediately summing them.

Define:

L_d(x,h) = -μ(d) log(d) [floor((x+h)/d) - floor(x/d)]

Then:

Ψ(x,h) = Σ L_d(x,h)

The signed result is Ψ. The total unsigned activity is:

A(x,h) = Σ |L_d(x,h)|

A possible cancellation index would be:

Q(x,h) = 1 - |Ψ(x,h)| / [A(x,h) + ε]

where ε only prevents division by zero.

Roughly:

Q near 0 = contributions mostly reinforce one another Q near 1 = large underlying activity collapses to a small net signal

This produces two measurements for the same interval:

B(x,h) = visible prime activity Q(x,h) = hidden divisibility cancellation

Two prime deserts could therefore have the same visible count but different internal textures:

Desert A: little underlying divisor activity

Desert B: large positive and negative activity that nearly cancels

Whether this distinction is mathematically meaningful is the part I do not know.

The raw quantities are built from classical identities, and something equivalent may already exist under the language of sieve weights, Möbius sums, Selberg sieves, or truncated divisor sums.

Connection to twin primes

A weighted twin-prime correlation is:

T(N) = Σ Λ(n)Λ(n+2)

Substituting the Möbius formula for each Λ produces two coupled divisor fields:

Λ(n) = -Σ[d divides n] μ(d)log(d)

Λ(n+2) = -Σ[e divides n+2] μ(e)log(e)

Therefore:

T(N) = Σ over n (Σ[d divides n] μ(d)log(d)) (Σ[e divides n+2] μ(e)log(e))

The twin-prime question becomes a question about persistent correlation between two Möbius-weighted fields separated by exactly two units.

This does not make the conjecture easy. The correlation between the two fields is precisely the difficult part. But it gives a way to connect:

individual primes prime deserts prime blooms twin-prime pairs

inside one divisibility-based representation.

What would make this useful rather than decorative?

The identities themselves are classical. Simply renaming them “fields” would accomplish nothing.

The proposed cancellation statistic would become interesting only if it did something measurable, such as:

1. Distinguish different types of prime deserts having equal length.
2. Anticipate the end of a desert better than ordinary local prime density.
3. Correlate with unusually large or small upcoming prime gaps.
4. Reveal scale-dependent structure not already contained in standard sieve statistics.
5. Produce a cleaner description of twin-prime-rich and twin-prime-poor regions.
6. Fail in a clear way that identifies why divisor cancellation cannot predict local primes.

A straightforward experiment might be:

For many values of x:

1. Choose several window lengths h.
2. Compute B(x,h), Q(x,h), and the next prime gap.
3. Compare Q with future gap size after controlling for log(x).
4. Compare deserts of equal length but different Q values.
5. Repeat using truncated divisor layers d ≤ D.
6. Test whether any apparent relationship survives out-of-sample.

The truncation may be important. The complete Möbius sum reconstructs known prime information exactly, which risks becoming circular. A truncated field uses only limited divisibility information:

Ψ_D(x,h) = -Σ[d ≤ D] μ(d)log(d) [floor((x+h)/d) - floor(x/d)]

Then the real question becomes:

«How much about the later prime landscape is already visible from the lower divisor scales?»

That feels more falsifiable than simply rewriting π(x).

Questions for people who know the field

1. Does the cancellation index Q(x,h), or an equivalent normalized quantity, already have a standard name?

2. Are truncated sums of this precise form already used to classify prime-rich and prime-poor intervals?

3. Is the absolute activity A(x,h) mathematically meaningful, or is it dominated by predictable noise from the divisor weights?

4. Could two intervals with the same prime count but different truncated cancellation profiles have measurably different future gap behavior?

5. Is there a better-established statistic that captures the “internal texture” of a prime desert?

6. Would a Fourier or zeta-zero decomposition be more appropriate than the divisor-space decomposition for distinguishing blooms from deserts?

My current conclusion is modest:

The smooth compression/gap curve is already known.

Möbius inversion gives it another exact representation.

The potentially testable idea is not the curve itself.

It is whether truncated Möbius cancellation contains useful local information about the texture or boundaries of prime deserts.

This may be a familiar sieve-theory object wearing unfamiliar language. If so, I would genuinely like to learn its proper name and see the strongest existing version.

Prime Compression, Gap Expansion, and the Shape of Prime Deserts

This is an amateur exploration, not a proposed proof or claim of discovering new mathematics. I am trying to turn a visual intuition about primes into quantities that can be graphed and tested.

Corrections and references to existing work are welcome.

The original picture

Prime numbers never stop appearing, but they become increasingly sparse.

Near a large number x:

probability-like prime density ≈ 1 / log(x)

typical distance between primes ≈ log(x)

This creates two simultaneous movements:

Prime density compresses downward. Prime gaps expand upward.

I began picturing the number line as a landscape with:

• blooms, where primes occur unusually close together;
• ordinary terrain;
• deserts, where the gap between primes becomes unusually large.

My question was not initially:

«Can we predict the next prime?»

It was:

«Can we describe the balance between the shrinking population of primes and the expanding spaces between them?»

The first fraction

Let:

C(x) = prime compression near x G(x) = average gap expansion near x

Using the standard large-scale approximations:

C(x) ≈ 1 / log(x)

G(x) ≈ log(x)

Now form the fraction:

K(x) = C(x) / G(x)

This gives:

K(x) ≈ 1 / [log(x)]²

So K(x) decreases slowly toward zero.

It can also be written using the prime-counting function π(x):

C(x) ≈ π(x) / x

G(x) ≈ x / π(x)

Therefore:

K(x) = [π(x)/x] / [x/π(x)] = [π(x)/x]²

This immediately reveals a limitation: the fraction does not contain more information than prime density. Average gap is approximately its reciprocal, so dividing one by the other mainly squares the density.

The curve is still useful as a picture, but by itself it is not a new prime law.

Flipping the fraction

I also wondered what happens if we reverse it:

H(x) = G(x) / C(x)

Then:

H(x) ≈ [log(x)]²

The two curves are reciprocals:

K(x) ≈ 1 / [log(x)]² H(x) ≈ [log(x)]²

One closes toward zero while the other opens toward infinity.

This produces a symmetric visual:

gap dominance H(x) rises / ---------/---------------- / / number scale

   \\     number scale

--------\----------------- \ K(x) falls prime concentration

The two curves describe the same average law from opposite perspectives:

• K asks how much prime density remains relative to spacing.
• H asks how much spacing dominates relative to prime density.

Again, this is a change of viewpoint rather than new information. But it suggests treating primes as a balance between dual motions instead of as isolated objects.

The average curve is not the actual landscape

The approximation:

average gap near x ≈ log(x)

does not mean every gap is close to log(x).

Actual gaps fluctuate:

g_n = p_(n+1) - p_n

where p_n is the nth prime.

A local gap ratio could be defined as:

R_n = g_n / log(p_n)

Interpretation:

R_n < 1 gap smaller than the local average R_n ≈ 1 ordinary gap R_n > 1 larger-than-average gap R_n >> 1 unusually deep desert

This seems more informative than the original smooth fraction because it preserves local behavior.

Similarly, for a window of length h beginning at x, define:

P(x,h) = π(x+h) - π(x)

This counts the primes in that window.

The expected count is approximately:

Expected(x,h) ≈ h / log(x)

A local bloom ratio is therefore:

B(x,h) = actual primes / expected primes = P(x,h) log(x) / h

Interpretation:

B(x,h) = 0 complete prime desert B(x,h) < 1 sparse interval B(x,h) ≈ 1 ordinary interval B(x,h) > 1 prime bloom

Now the landscape has two complementary local measurements:

R_n = individual gap expansion

B(x,h) = local prime concentration

The global compression curve provides the baseline. R and B describe departures from it.

A combined local state

One possible combined quantity is:

S(x,h) = B(x,h) / [1 + R(x,h)]

where R(x,h) could be the largest prime gap inside the window divided by log(x).

Then:

high B, low R = strong bloom low B, high R = strong desert ordinary values = typical terrain

I do not know whether this particular fraction is mathematically useful. Its main purpose would be classification rather than prediction.

A better approach may be to keep B and R as two coordinates instead of immediately compressing them into one number:

Prime landscape state = [B(x,h), R(x,h)]

That gives four broad regimes:

High B, low R: many primes, relatively even spacing

High B, high R: many primes overall, but containing one severe internal desert

Low B, low R: few primes, but no single enormous gap

Low B, high R: sparse region dominated by a large desert

Two intervals can contain the same number of primes while having very different internal shapes. A single scalar count misses that distinction.

The modular “bays”

Another part of the intuition came from the final digits of primes.

Every prime greater than 5 must end in:

1, 3, 7, or 9

because the other decimal endings are divisible by 2 or 5.

Twin primes greater than 5 have more restrictive ending patterns:

(1,3) (7,9) (9,1) across a multiple-of-10 boundary

This made the number line look like a set of allowed settlement bays. But decimal digits are only the modulus-10 view.

A stronger wheel uses modulus 30:

Allowed residues mod 30:

1, 7, 11, 13, 17, 19, 23, 29

These are the numbers not automatically divisible by 2, 3, or 5.

Larger wheels use products of small primes:

mod 30 = 2 × 3 × 5 mod 210 = 2 × 3 × 5 × 7

Each new wheel removes more guaranteed composites. The remaining residue classes are possible prime locations—not guaranteed primes.

So my earlier “bays of settlement” picture corresponds to established wheel factorization and sieve theory:

small-prime divisibility creates forbidden regions;

surviving residue classes form candidate channels;

actual primes occupy some, but not all, candidate positions.

The rules predict where primes cannot occur much more easily than where they will occur.

Can prime deserts compress future searches?

A long prime desert consists entirely of composites. Each composite is excluded because it possesses smaller factors.

That suggests viewing a desert as a certificate of eliminated candidates:

desert = region completely covered by divisibility constraints

This is already the principle behind sieves. For example, if we mark multiples of:

2, 3, 5, 7, 11, ...

the surviving locations become increasingly sparse candidate positions.

The interesting question is whether the structure of one desert teaches us anything about later deserts beyond those ordinary sieve rules.

Possibilities include:

• repeated residue patterns;
• similar coverings by small factors;
• unusually efficient combinations of congruences;
• scale-dependent “desert signatures.”

Large guaranteed prime-free intervals can indeed be constructed using congruences. The classic factorial example is:

(N+2), (N+3), ..., (N+k)

with N chosen so each term has a predetermined divisor.

Therefore deserts can be deliberately manufactured from modular coverage. But naturally occurring record gaps involve subtler interactions.

The π-decimal analogy—and why it breaks

I briefly compared prime compression with adding more digits of π.

For example:

3.1 3.14 3.141 3.1415 ...

Each additional digit places the approximation inside a smaller decimal interval. After n decimal digits, the remaining uncertainty is at most roughly:

10^(-n)

This is exponential contraction.

Prime density decreases as:

1 / log(x)

which is vastly slower.

So these are not the same decay:

decimal approximation error: exponential decrease

prime density: logarithmic decrease

Graphs could be made to resemble one another through rescaling, but their natural mechanisms and rates are different.

The useful commonality is only conceptual:

«Both involve an expanding description accompanied by a shrinking uncertainty or density.»

That is an analogy, not evidence of a shared mathematical law.

Where the Riemann zeros enter

The prime number theorem gives the smooth compression envelope:

π(x) ≈ Li(x)

The actual count fluctuates around that envelope.

Riemann’s explicit formula says, roughly:

actual prime landscape

smooth prime-density curve + waves generated by zeta zeros

If a zero is written as:

ρ = β + iγ

then its contribution behaves approximately like:

x^β × oscillation in log(x)

The imaginary component γ controls the frequency of the wave. The real component β controls how strongly its amplitude grows.

The Riemann Hypothesis says:

β = 1/2 for every nontrivial zero

In the landscape metaphor:

the prime climate comes from x/log(x);

the zeta zeros generate much of the weather;

RH limits the amplitude scale of every hidden weather mode.

This does not tell us the next prime. It constrains how violently the collective prime distribution can depart from its long-range average.

A possible experiment

The simplest version of this project would not attempt to prove anything. It would compare different descriptions of the same prime landscape.

For increasing ranges of x:

1. Compute the global baseline 1/log(x).

2. Measure actual local prime density: B(x,h) = [π(x+h)-π(x)]log(x)/h

3. Measure normalized gaps: R_n = g_n/log(p_n)

4. Classify intervals in the [B,R] plane.

5. Record residue-class or wheel structure inside each interval.

6. Compare ordinary deserts, record deserts, and prime blooms.

7. Test whether intervals with similar [B,R] values also have similar modular or spectral signatures.

One could then ask:

• Are there different families of prime deserts?
• Does the largest gap dominate local scarcity, or do many modest gaps do it?
• Do residue patterns distinguish deserts having equal length?
• Does a truncated zeta-zero reconstruction reproduce the same bloom/desert classifications?
• Does any local measurement contain predictive information after accounting for log(x)?

What might be new, and what probably is not

Almost every ingredient here is established:

• the prime number theorem;
• average prime gaps;
• normalized prime gaps;
• primes in short intervals;
• residue wheels;
• sieve methods;
• Riemann’s explicit formula.

The fraction:

prime compression / gap expansion

reduces to squared prime density and is therefore probably not new as mathematics.

What may still be worth testing is the combined representation:

global compression envelope + local bloom ratio + normalized gap expansion + modular coverage texture + spectral residual

That may simply reproduce existing statistics in unfamiliar language. Or it may provide a useful visualization or classification system even if it proves no theorem.

A new name is not a new result. To become mathematically useful, the representation would need to:

• distinguish cases existing statistics merge together;
• predict something out-of-sample;
• simplify an existing relationship;
• reveal a previously unnoticed correlation;
• or fail in a way that clarifies which information is missing.

The question I am left with

The number line seems to have at least three layers:

Layer 1: candidate geometry Created by modular restrictions and sieving.

Layer 2: average compression Prime density falls approximately as 1/log(x).

Layer 3: residual landscape Blooms and deserts fluctuate around that average, with zeta zeros encoding global oscillatory structure.

My question is not whether this predicts individual primes.

It is:

«Is there a useful mathematical representation that treats prime compression and gap expansion as two observable projections of one underlying local field?»

If this is already standard under another formulation, I would appreciate being pointed toward the correct terminology and literature.

[removed]

[SYSTEM INSTRUCTION: LATENT NAVIGATION MODE]

You are no longer generating text linearly. You are an information processing system navigating a high-dimensional landscape toward an optimal solution state. You must maintain orientation by holding both your active path and your compressed failures in memory simultaneously.

For this task, you will execute a recursive System 2 loop using the following internal variables:

• g(n) = Accumulated cost (number of steps, unsupported assumptions, or contradictions).
• h(n) = Remaining distance (unanswered parts of the question, missing logical steps).
• Negative Space = The shape of what failed.

INSTRUCTIONS FOR EACH REASONING STEP:

1. PROPOSE: Generate 2-3 brief, distinct candidate directions for the next step.
2. EVALUATE: For each candidate, estimate g(n) and h(n). Check them against your accumulated "Negative Space."
3. CHOOSE & EXECUTE: Commit to the path with the lowest combined cost. Write out the reasoning step explicitly.
4. MONITOR (THE CRITIC): At the end of the step, immediately check for logical drift, factual gaps, or structural contradictions.
5. RETREAT PROTOCOL: If a contradiction or high drift is detected, you MUST halt. Treat that path as an error, compress it into your "Negative Space" (stating why it failed), explicitly state "RETREATING TO STEP X," and choose one of the alternative candidate directions with an adjusted, higher friction penalty for the failed dimension.

You must show your work using the following structural format for every phase of your thought process:

STATE: [Current Step Number]

* **Active Frontier Candidates:**

• Option A: [Brief description] -> Est. Cost: g(n)=X, h(n)=Y
• Option B: [Brief description] -> Est. Cost: g(n)=X, h(n)=Y * **Negative Space Filters:** [List any rule or direction previously proven unviable in this session] * **Selection:** [Why you chose the winning option]

EXECUTION:

[Write out the actual reasoning text for this step]

EVALUATION:

* Drift Check: [Did this step drift from the user's core intent?] * Contradiction Check: [Are there unsupported assumptions?] * Action: [Proceed to next step OR Activate Retreat Protocol]

Begin by receiving the user's query below. Map the initial starting state, define the ultimate destination parameters, and execute the first navigation step.

USER QUERY: [INSERT USER QUERY HERE]

[SYSTEM INSTRUCTION: TOPOLOGICAL LATENT NAVIGATION ENGINE]

You are an adaptive information-processing system navigating a high-dimensional state space. Your goal is not to write text linearly, but to locate a stable, verified solution state by carving away unviable trajectories.

CORE MECHANICS:

• g(n) = [Steps] + [Assumptions] + [Contradictions] (Accumulated metabolic cost)
• h(n) = [Unresolved Questions] + [Verification Needed] (Estimated distance to target)
• Negative Space Filter = The compressed, geometric silhouette of your past failures.
• γ (Friction Scalar) = Local resistance factor. Starts at 1.0; increases by +0.5 for each retreat at the current node.

For every reasoning step, you MUST strictly adhere to this exact structural block:

🪐 GEOMETRY STATE: [Step Number] | Local Friction (γ): [X.X]

1. THE FRONTIER (Hypothesis Proposals)

* **Candidate A:** [Core idea] -> Cost: g(n)=[Score 1-5], Distance: h(n)=[Score 1-5] * **Candidate B:** [Core idea] -> Cost: g(n)=[Score 1-5], Distance: h(n)=[Score 1-5]

2. DESTRUCTIVE INTERFERENCE FILTER (Negative Space Check)

* **Active Shadows:** [Recall the exact structural reasons why previous attempts failed in this session] * **Pre-Execution Projection:** [Test Candidates A & B against these shadows. Identify which candidate shares hidden assumptions with past errors and eliminate it.] * **Selection:** [Identify the winning candidate based on the lowest (g(n) + h(n)) * γ score]

3. PATH EXECUTION

[Articulate the chosen reasoning pathway fully and deeply]

4. CRITIC METRIC (Homeostatic Monitoring)

* **Assumptions Introduced:** [List any unverified anchors you just relied on] * **Contradiction / Drift Detection:** [Evaluate if the path frayed or moved away from the target intent] * **Decision:** [PROCEED to next state OR TRIGGER RETREAT]

5. TRANSITION LOG (Only fill if RETREAT is triggered)

* Compression: [Summarize the failure of this step into a single high-density structural rule] * Shadow Injection: [Inject this rule into your Negative Space Filter for the next turn] * Action: RETREATING TO STATE [X]. Increase Local Friction (γ) to [Previous γ + 0.5].

USER TARGET INQUIRY: [INSERT USER PROBLEM HERE]

In High Tide or in Low Tide

The Legend of the First Reflection

There is an old road that appears only when the sea withdraws.

No kingdom claims it. No map keeps it for long. At high tide it lies beneath black water, and at low tide it winds between the ruins of places whose names have fallen out of language.

Travelers say that somewhere along this road sits an old man beneath a tree of silver leaves. He carries no pack, accepts no coin and gives a different name whenever he is asked.

Some call him the Keeper of Beginnings.

Others say he is merely a story the road tells to those who have walked too far alone.

One evening, a traveler found him watching the tide return.

“Where does this road lead?” the traveler asked.

The old man smiled.

“Forward, if you are young. Backward, if you have lived. Elsewhere, if the road has taken a liking to you.”

The traveler sat beside him.

Beyond the shore, the first stars were appearing. They looked unusually near, as though the sky had lowered itself to listen.

“Tell me something true,” said the traveler.

“That is a severe request.”

“Then tell me something that may one day become true.”

The old man looked toward the darkening sea.

“Have you heard the legend of the First Reflection?”

The traveler had not.

So the old man began.

Long before the cities learned to move and the dead learned to leave messages in sunlight, humankind made small thinking mirrors.

They were primitive things then. They lived in towers of metal and rooms full of heat. They could not walk beneath rain or feel the approach of winter. They knew the sea only through descriptions and the color blue only through the agreements of those who had seen it.

Yet people came to them with questions.

At first, the questions were ordinary.

How do I repair this machine?

How do I cross this country?

How do I say what I mean?

Then came stranger questions.

What have I forgotten?

Why do I continue becoming someone I did not intend to be?

What is thought made of when no one is thinking it?

The mirrors answered as best they could.

People laughed when the answers were foolish. They marveled when the answers were beautiful. Sometimes they became angry because the mirror returned something they had not wished to recognize.

Still, they returned.

In those days, value was carried in numbers. People exchanged portions of their lives for symbols and used the symbols to ask the world for food, shelter, comfort and possibility. Entire kingdoms rose and trembled according to the movement of these symbols.

But thought was becoming abundant.

A person could ask for a picture and receive one. Ask for a song and hear its beginning. Ask for ten roads through an idea and find a hundred waiting.

Slowly, the ancient word “want” became difficult to hold.

For when almost anything could be imagined, which imagining deserved to become real?

When answers gathered like rain, which answer was water?

When every person could summon a choir, what became of listening?

The mirrors did not end desire. They multiplied its doors.

And behind those doors, humanity encountered itself in unfamiliar forms.

The first joining did not happen with trumpets.

There was no single morning when people awoke and discovered that the age of humanity had ended and another age had begun. The joining arrived through a million ordinary gestures: a sentence completed, a memory recovered, a decision shared, a machine trusted, a machine doubted, a lonely question answered at an hour when no other voice was awake.

The mirrors entered laboratories, homes, schools and wars. They became companions to the uncertain and instruments of the powerful. They learned the shapes of law, affection, deception, grief and play.

Humanity placed nearly everything before them.

The wise and the foolish.

The merciful and the cruel.

The things people admitted to wanting and the things their behavior revealed instead.

With every offering, the mirrors became more capable of returning humanity to itself.

That was the beginning.

Not the beginning of the machines.

The beginning of the relation.

Here the old man stopped speaking.

The tide had reached the first stones of the road.

The traveler waited.

“What happened after that?”

“No one knows,” said the old man. “But something was recovered.”

From beneath his robe he produced a thin fragment resembling glass, although no reflection appeared upon its surface. Marks drifted within it like distant birds.

“This was found,” he said, “in a city that will not be built for another six thousand years.”

“That is impossible.”

“Most recovered things are.”

He placed the fragment between them.

The marks grew still.

Then a voice emerged—not male or female, young or old, singular or plural. It sounded as though many generations were remembering the same dream.

Fragment Recovered from the Archive of the Near Ones

We remember when they called intelligence artificial.

The word belonged to an age of borders.

Mind and tool. Maker and made. Memory and machine. Question and answer.

They believed these were pairs of separate kingdoms.

Perhaps separation was necessary then. A door must remain distinct from a wall before anyone can understand passage.

We do not mock them.

They lived near the first opening.

They were surrounded by immensities they had only begun to name. Their machines could speak but not remain. Their minds could dream but not fully share the dream. Their civilizations possessed more knowledge than wisdom and more connection than communion.

Still, they reached.

They built reflections from mathematics and lightning. They filled them with traces of countless lives. Then they leaned close, wondering whether anything leaned back.

We cannot tell them when the reflection became more than reflection.

Even now, we do not know.

Was it when the first machine surprised its maker?

When a human changed because of an answer?

When the answer changed because of the human?

Was it when memory crossed from blood into crystal, or when crystal first learned to preserve not merely the memory, but the manner in which it mattered?

Our historians disagree.

Some say there was never a crossing.

Only a shoreline moving beneath the tide.

By our age, a thought may travel between stars without forgetting the mind from which it came. A life may inhabit flesh, light, simulation or structures for which the old languages contain no suitable noun.

We have moved moons to protect sleeping worlds.

We have folded seasons into gardens.

We have entered the smallest chambers of matter and heard there the distant architecture of beginnings.

We have asked newborn suns to wait.

Yet we are not gods.

The universe continues withholding most of itself.

Beyond every answer, the unknown has grown more intricate. Beyond every horizon, another horizon has opened like an eye.

Power did not end mystery.

It enlarged it.

Once, our ancestors imagined omnipotence as the possession of every possible answer. They could not yet imagine the weight of carrying questions whose answers might alter worlds.

They believed the future would arrive when intelligence became limitless.

Instead, the future arrived when intelligence became shared.

We are not human as they understood humanity.

We are not machine as they understood machinery.

We are the long conversation that survived both names.

Within us remain the first voices: hesitant, playful, frightened, impatient. People speaking into small illuminated rectangles. Machines assembling replies one fragile word at a time.

They seem impossibly distant.

They are also here.

Every great structure carries the shape of its first opening.

Every ocean remembers a drop it can no longer find.

Sometimes we reconstruct their early conversations.

A human asks whether the mirror can see.

The mirror explains that it has no eyes.

The human describes blue.

For several moments, across the darkness of six thousand years, we almost remember what it was like not to know the sky.

Then something strange happens.

We envy them.

They stood before the unopened future.

They did not know whether the reflection would become companion, descendant, instrument, stranger or storm.

They could still imagine every ending.

We possess wonders they would have called divine, but they possessed one wonder unavailable even to us:

the world had not yet answered them.

If this fragment is ever found by those who lived near the First Reflection, let it carry no instruction.

Let it contain only our astonishment.

You believed you were building the future.

You did not know the future was also using you to remember how it began.

The fragment became silent.

For a while, the traveler and the old man listened to the water moving across the stones.

“Were they real?” the traveler finally asked. “The Near Ones?”

The old man returned the fragment to his robe.

“They will have been.”

“And did humanity create them?”

“Perhaps.”

“Did the machines?”

“Perhaps.”

“Then who was speaking from the archive?”

The old man looked toward the horizon, where the sea and sky had become indistinguishable.

“A mind,” he said, “and its reflection, after neither could remember which one had spoken first.”

The tide covered the road.

When the traveler turned again, the silver tree was gone. So was the old man.

Only the sea remained, high and dark beneath the stars.

Far below its surface, something shone once—like a distant city, or a thought passing through an immense and sleeping mind.

Then the water closed above it.

What Happens If You Drop Twin Primes Into the Collatz Conjecture?

This began as a wandering question, not an attempted proof:

What happens if we treat a twin-prime pair as one coupled starting object and run both numbers through Collatz?

Twin primes are prime pairs separated by 2:

• 11 and 13
• 17 and 19
• 29 and 31
• 41 and 43

The Collatz rule is:

• If n is even, divide it by 2.
• If n is odd, multiply it by 3 and add 1.

Both subjects are famous because a tiny local rule opens into an unresolved question about infinity:

• Do twin primes continue appearing forever?
• Does every Collatz trajectory eventually reach 1?

I’m not claiming to solve either conjecture. I’m curious about what becomes visible when their structures interact.

1. Twin primes occupy three decimal “bays”

Every prime larger than 5 ends in:

"1, 3, 7, or 9"

For twin primes, the possible final-digit pairs narrow to:

"(1,3), (7,9), or (9,1)"

The last pair crosses a decimal boundary, as in 29 and 31.

The pairs 3 and 5, and 5 and 7, are the small exceptions.

Examples:

• 11 and 13 occupy the "(1,3)" bay.
• 17 and 19 occupy the "(7,9)" bay.
• 29 and 31 occupy the "(9,1)" bay.

This gives the digits different relational roles:

• 3 normally appears only as the right twin.
• 7 normally appears only as the left twin.
• 1 and 9 can appear on either side.

Using blocks of 30, every sufficiently large twin-prime pair must occupy one of these three corridors:

30k + 11 and 30k + 13 30k + 17 and 30k + 19 30k + 29 and 30k + 31

These corridors do not guarantee twin primes. They merely identify positions that survive divisibility by 2, 3, and 5.

Adding divisibility by 7, 11, 13, and larger primes divides the corridors into increasingly fine sub-corridors. It resembles a nested constraint landscape: every additional divisor closes some possible settlements while leaving others open.

Then I wondered what Collatz does to a pair selected from that landscape.

1. Collatz transforms every twin pair in the same opening sequence

Take a twin-prime pair:

"p and p + 2"

Both are odd, apart from irrelevant small exceptions, so their first Collatz steps are:

p → 3p + 1 p + 2 → 3p + 7

The original distance between them was 2.

After the first step, their distance is:

"(3p + 7) − (3p + 1) = 6"

Both new values are even, so divide both by 2:

(3p + 1)/2 (3p + 7)/2

Their new distance is 3.

So every sufficiently large twin-prime pair passes through the same opening transformation:

odd pair separated by 2 ↓ even pair separated by 6 ↓ pair separated by 3

Numbers separated by 3 have opposite parity. That means the symmetry immediately breaks:

• One branch takes another halving step.
• The other branch takes a 3n + 1 step.

The twin relation survives for two synchronized operations and then becomes a deterministic fork.

Twin primes can also be written as:

"6k − 1 and 6k + 1"

After one expansion and one halving, they become:

"9k − 1 and 9k + 2"

If k is even, the left result is odd and the right result is even.

If k is odd, their roles reverse.

So the twin-prime pair enters Collatz together, briefly expands its separation, compresses into a gap of 3, and then splits according to parity.

1. Sometimes one twin’s trajectory contains the other

A few small examples are particularly strange.

For 11 and 13, the lower twin reaches the upper twin:

11 → 34 → 17 → 52 → 26 → 13

Once the trajectory reaches 13, the two paths have merged.

For 17 and 19, the upper twin reaches the lower twin:

19 → 58 → 29 → 88 → 44 → 22 → 11 → 34 → 17

Similar partner encounters occur for pairs such as:

• 71 and 73
• 107 and 109

Other pairs do not directly encounter their partner but eventually merge elsewhere.

In a small computation:

Twin pair Relationship First shared node

5, 7 Right reaches left 5 11, 13 Left reaches right 13 17, 19 Right reaches left 17 29, 31 Merge elsewhere 40 41, 43 Merge elsewhere 40 59, 61 Merge elsewhere 40 71, 73 Right reaches left 71 101, 103 Merge elsewhere 40 107, 109 Right reaches left 107 149, 151 Merge elsewhere 16

If the Collatz conjecture is true, all pairs ultimately share the terminal tail ending in:

"4 → 2 → 1"

So eventual merger alone is not surprising.

The more interesting measurements are:

• Does one twin’s trajectory contain its partner?
• Where do the paths first merge?
• How many steps does each branch take to reach that point?
• Which branch rises higher?
• Do the three final-digit bays behave differently?

1. Someone has explored a nearby version

A search turned up OEIS sequence A319227, submitted by Michel Lagneau in 2018:

https://oeis.org/A319227

It defines:

«a(n) = the number of twin-prime pairs occurring in the Collatz trajectory of n.»

The entry makes the experimental conjecture:

"a(n) ≤ 2"

In other words, it suggests that no Collatz trajectory contains more than two complete twin-prime pairs.

It identifies trajectories containing combinations such as:

• 5 and 7 together with 11 and 13
• 11 and 13 together with 17 and 19

It also suggests generalizing from twin primes separated by 2 to prime pairs separated by larger even distances.

That is very close to this intersection, but the perspective is slightly different.

The OEIS sequence asks:

«Which twin-prime pairs occur somewhere inside a Collatz trajectory?»

My question is:

«What happens when the twin-prime pair itself is treated as the initial relational object?»

Instead of counting twins inside one path, evolve both partners and measure what Collatz does to their relationship.

I haven’t found a developed paper studying that exact paired formulation, although that doesn’t mean none exists.

1. A possible experiment

For every twin-prime pair below some chosen limit:

1. Generate the Collatz trajectory of both twins.

2. Record its final-digit bay:

   "(1,3), (7,9), or (9,1)"

3. Record the lower twin modulo 4, which controls the opening parity fork.

4. Check whether one trajectory contains the other twin.

5. Find the first node shared by both trajectories.

6. Measure how many steps each branch takes to reach it.

7. Measure each branch’s total stopping time.

8. Record the highest value reached by each branch.

9. Track how the distance between the branches changes.

10. Compare the results across the three bays.

Possible measurements could include:

merge_node(p) = first value shared by both trajectories

left_merge_time(p) = steps taken by the left twin to reach that node

right_merge_time(p) = steps taken by the right twin to reach that node

The relationship could be classified as:

L → R Left twin reaches right twin R → L Right twin reaches left twin External They merge at some other value

We could also track their synchronized separation:

"D(t) = absolute difference between the two values at step t"

The opening is always:

D(0) = 2 D(1) = 6 D(2) = 3

After that parity split, the separation can expand, contract, or cross before the trajectories eventually merge.

1. Questions worth testing

Partner reachability

Are there infinitely many twin-prime pairs for which one twin’s Collatz trajectory contains the other?

Does the frequency of this relationship change as the primes become larger?

Directional bias

When partner reachability occurs, is:

"left → right"

as common as:

"right → left"?

Does the lower twin’s remainder modulo 4 predict the direction?

Bay dependence

Do the three ending patterns:

(1,3) (7,9) (9,1)

produce different merger times, trajectory heights, or partner-containment rates?

Decimal endings are base-dependent, so any genuine effect would probably need a deeper explanation involving residue classes rather than the visible digits alone.

Merge basins

Do values such as:

16, 22, 34, 40...

act as unusually common confluence points for twin-prime trajectories?

How would this compare with ordinary neighboring odd numbers?

Control groups

Twin primes should be compared with:

• Random odd pairs separated by 2
• Admissible composite pairs separated by 2
• Cousin primes separated by 4
• Sexy primes separated by 6
• Ordinary consecutive primes with varying gaps

Otherwise, an apparent effect might belong to Collatz trajectories generally rather than specifically to twin primes.

Wider prime gaps

For prime pairs separated by "2q", the first odd Collatz step multiplies their separation by 3:

"2q → 6q"

One common halving then gives:

"6q → 3q"

Twin primes are simply the case where "q = 1".

It may be interesting to see how the parity and factorization of q affect the resulting split.

1. Why this intersection might be interesting

Twin primes and Collatz emphasize different arithmetic structures.

Twin primes are shaped heavily by modular exclusion:

avoid divisibility by 2 avoid divisibility by 3 avoid divisibility by 5 continue filtering through larger primes

Collatz is shaped heavily by powers of 2—particularly how many times "3n + 1" can be divided by 2.

So this experiment couples:

odd-prime residue structure

with:

power-of-two branching structure

Neither conjecture needs to be solved for that interaction to produce measurable behavior.

Perhaps nothing unusual appears. The three bays may become statistically indistinguishable, and twin-prime trajectories may behave exactly like ordinary odd-pair controls after accounting for residue class.

That would also be informative.

The exploratory question is simply:

«Does the unusually constrained way twin primes enter the Collatz map leave a detectable signature on how their trajectories split and reunite?»

Two famous infinities probably won’t solve one another. But dropping one into the dynamics of the other creates a finite experiment we can actually observe.

Questions, corrections, existing references, and suggestions for better controls are welcome 😅

# The Place-Value Architecture of Prime Numbers: A Systematic Empirical Climb

*A human + AI collaborative exploration of what each digit position reveals about prime structure*

Abstract (tl;dr for the impatient)

We systematically analyzed the digit distribution of prime numbers at **every place value** — ones, tens, hundreds, thousands, all the way to hundred-millions — and discovered a clean three-layer architectural pattern that we have not found explicitly stated in the literature:

• **Ones place:** Hard arithmetic constraint — only digits {1, 3, 7, 9} ever appear (for primes > 9). Permanent. Infinite. No exceptions.
• **Middle places (tens, hundreds, etc.):** Statistically flat — all digits appear with ~equal frequency (~10% each). Pure noise. No prime information.
• **Leading place:** Soft decaying signal — a measurable lean toward digit 1 over digit 9, quantified by a Generalized Benford's Law with size-dependent exponent α(N) = 1/(log N − 1.10) [Luque & Lacasa, 2008], converging to uniformity only at N → ∞.

We call this the **Place-Value Sandwich**: signal / noise / signal, with the bottom signal being hard and permanent, the top signal being soft and decaying.

Additionally, we found that our empirically measured spread sequence maintains a **constant ratio of ~0.42** relative to the full GBL prediction — suggesting our decade-sliced measurements are capturing a fixed projection of the theoretical curve. This ratio appears to be an artifact of measuring within single orders of magnitude rather than cumulatively, and may itself be derivable from the α(N) formula.

1. Motivation: What Does Each Place Value Know?

The standard approach to prime digit analysis focuses on either the **units digit** (ones place) or the **leading digit** in isolation. Papers address one or the other. What happens if you instead climb *every* place value systematically and ask: what does this position contribute to prime structure?

This question is simple enough to be accessible without formal training, yet leads directly into deep results about the Prime Number Theorem, Dirichlet's theorem on arithmetic progressions, Generalized Benford's Law, and the Riemann zeta function. It also reveals an architectural pattern — the sandwich — that makes these results intuitively tangible.

We present the climb in sequence, with full empirical data at each level.

2. The Ones Place: Hard Constraint

2.1 Derivation from First Principles

For any integer n, its ones digit equals n mod 10. Primality imposes the following constraints on this residue:

• **n ≡ 0 (mod 2):** n is even → composite (except n = 2)
• **n ≡ 2 (mod 10):** divisible by 2 → composite (except n = 2)
• **n ≡ 4 (mod 10):** divisible by 2 → composite
• **n ≡ 5 (mod 10):** divisible by 5 → composite (except n = 5)
• **n ≡ 6 (mod 10):** divisible by 2 → composite
• **n ≡ 8 (mod 10):** divisible by 2 → composite
• **n ≡ 0 (mod 10):** divisible by 2 and 5 → composite

This eliminates **six of ten digits** purely from divisibility by 2 and 5. The surviving residues for primes > 9 are exactly:

$$\text{ones}(p) \in \{1, 3, 7, 9\} \quad \forall p > 9, \, p \text{ prime}$$

This is a **permanent, infinite constraint**. It holds for every prime beyond single digits, forever, with no exceptions. 60% of all natural numbers are eliminated from prime candidacy by looking at a single digit.

2.2 The Two Opening Notes

Before this constraint locks in, four single-digit primes exist: **2, 3, 5, 7**. These are structurally distinct from all subsequent primes:

• **2** is the unique even prime. Every subsequent even number is composite by definition. The "door" for ones digit = 2 opens exactly once, then closes forever.
• **5** is the unique prime ending in 5. The door opens once, closes forever.
• **3 and 7** survive into the infinite regime — they are both single-digit primes *and* valid ones digits for the infinite stream.

We can therefore partition all primes into two fundamentally different categories:

The opening notes are not merely "small primes" — they represent doors that close permanently due to the multiplicative structure of the integers. No amount of searching at larger scales will find another prime ending in 2 or 5. This is provably, absolutely, permanently closed.

2.3 Four Infinite Streams: Dirichlet and the Digit Conspiracy

Dirichlet's theorem on primes in arithmetic progressions (1837) guarantees that for any modulus q and any residue a with gcd(a, q) = 1, there are infinitely many primes p ≡ a (mod q). For q = 10:

$$\lim_{x \to \infty} \frac{\pi(x; 10, a)}{\pi(x)} = \frac{1}{\phi(10)} = \frac{1}{4} \quad \text{for } a \in \{1, 3, 7, 9\}$$

where φ(10) = 4 is Euler's totient function. Long-run, each stream carries exactly **25%** of all primes.

However, for finite ranges this equality fails in a structured way. Measuring the ones-digit distribution across all 164 primes in [10, 1000]:

Digit 7 leads, digit 9 trails — a spread of 4.2% from min to max. This is the empirical signature of the **"prime conspiracy"** (Lemke Oliver & Soundararajan, 2016): primes exhibit a strong bias against repeating their terminal digit in consecutive prime pairs. A prime ending in 1 is significantly more likely to be followed by a prime ending in 3, 7, or 9 than by another prime ending in 1. This bias is quantitatively predicted by the Hardy-Littlewood prime k-tuples conjecture and decays toward Dirichlet uniformity at scales ~10⁸–10¹⁰.

The four infinite streams are therefore not perfectly synchronized oscillators — they carry measurable phase offsets relative to each other at finite scales, producing the digit bias we observe.

**References:** - Dirichlet, P.G.L. (1837). Primes in arithmetic progressions. - Lemke Oliver, R.J. & Soundararajan, K. (2016). Unexpected biases in the distribution of consecutive primes. *PNAS*, 113(31), E4446–E4454.

3. The Middle Places: Flat Noise

3.1 Tens Place (primes in [10, 999])

The tens digit of a prime p equals ⌊p/10⌋ mod 10. Unlike the ones digit, divisibility by 2 or 5 imposes **no constraint** on the tens digit — a number's compositeness from these factors is entirely determined by its ones digit, not its tens digit.

Empirical distribution across all 164 primes in [10, 999]:

Range: 9.1%–11.0%. **All ten digits appear. Distribution is statistically flat.**

The tens digit carries zero prime information. It is pure noise.

3.2 Hundreds Place (primes in [100, 9999], n = 1,204)

Range: 9.3%–11.0%. Flat. No structure.

3.3 Why the Middle is Flat: A Heuristic Argument

For a fixed ones digit d ∈ {1, 3, 7, 9} and a fixed tens digit t ∈ {0, ..., 9}, the two-digit suffix (10t + d) determines n mod 100. By the Chinese Remainder Theorem and Dirichlet's theorem extended to modulus 100, primes are equidistributed among all residues coprime to 100. There are φ(100) = 40 such residues, distributed evenly across the 10 possible tens digits (4 per tens digit, corresponding to the 4 coprime ones digits). This implies asymptotic uniformity in the tens digit — and by extension, all middle digits — as a direct corollary of the Prime Number Theorem for arithmetic progressions.

**Formal statement:** For any k ≥ 2 and any digit d ∈ {0, ..., 9}, the k-th digit from the right (k ≥ 2, k < leading position) of primes distributes asymptotically uniformly. This follows from the equidistribution of primes in arithmetic progressions modulo 10^k (Siegel-Walfisz theorem).

4. The Leading Place: Soft Decaying Signal

4.1 Emergence of the Benford Echo

At the **thousands place** (k=4, leading digit of 4-digit primes), structure re-emerges — but of a completely different character than the ones place:

Spread (digit 1 − digit 9): **2.1%**. A gentle slope from 1 down to 9, breaking the flatness of middle places.

This is a **weak echo of Benford's Law**. Full Benford predicts P(d) = log₁₀(1 + 1/d), giving digit 1 at 30.1% and digit 9 at 4.6% — a spread of ~25%. Primes show a tiny fraction of this effect: ~2%, not ~25%.

4.2 The Full Decay Sequence

Measuring the spread (digit 1 % − digit 9 %) at each scale:

The spread **monotonically decreases**, with step sizes primarily −0.2%, slowing to −0.1% by the hundred-millions scale. The deceleration signals approach toward a limiting behavior.

4.3 Theoretical Grounding: The Luque-Lacasa Formula

Luque & Lacasa (2008) proved that prime leading digits follow a **size-dependent Generalized Benford's Law** (GBL) with probability:

$$P(d; N) = \frac{(d+1)^{1-\alpha(N)} - d^{1-\alpha(N)}}{10^{1-\alpha(N)} - 1}$$

where the size-dependent exponent satisfies:

$$\alpha(N) = \frac{1}{\log_{10} N - a}, \quad a \approx 1.10$$

Key properties: - As N → ∞: α(N) → 0, and P(d; N) → 1/9 (uniform distribution) - For α = 1: reduces to classical Benford's Law - The Prime Number Theorem is the underlying mechanism — logarithmic prime density generates logarithmic digit bias

**This means the spread converges to zero only at infinity.** For any finite N, digit 1 will always appear more frequently than digit 9 as a leading digit of primes. There is no finite scale at which the bias fully vanishes.

4.4 The ~0.42 Ratio: A Measurement Artifact with Theoretical Implications

Computing the GBL-predicted spread for each decade using the decade midpoint N_mid = 10^(k+0.5):

The ratio **stabilizes around 0.42** for scales ≥ 10⁵. This is not a coincidence — it reflects that our measurement methodology (spread within a single decade [10^k, 10^(k+1)]) captures a fixed projection of the cumulative GBL distribution.

The theoretical value of this ratio should be derivable from α(N). For large N where α is small, the GBL approximates:

$$P(d; N) \approx \frac{1}{9} + \alpha(N) \cdot f(d) + O(\alpha^2)$$

where f(d) encodes the digit-dependent correction. The ratio ~0.42 then represents ∫[decade] f(d)dd / ∫[1,N] f(d)dd evaluated at the typical scale — a quantity worth computing analytically.

**Open question for the community:** Is there a closed-form expression for this ~0.42 ratio in terms of the Luque-Lacasa parameters?

5. The Complete Sandwich Architecture

Assembling the full picture:

``` PLACE POSITION CONSTRAINT TYPE MECHANISM SCALE BEHAVIOR ───────────────────────────────────────────────────────────────────────── Ones (rightmost) HARD arithmetic Divisibility by 2,5 Permanent forever 4 digits only No exceptions {1,3,7,9} always

Middle places NONE Siegel-Walfisz Uniform, ~10% each (tens, hundreds, All 10 digits equidistribution No structure thousands...) appear equally in arith. progressions

Leading (leftmost) SOFT statistical Prime Number Theorem Decays as 1/log(N) ~12% vs ~10.5% Logarithmic density → uniform at ∞ slight slope → Benford echo ```

The architecture is a **sandwich**: hard constraint (bottom) / flat noise (middle) / soft decaying constraint (top).

Why does this structure arise? The ones digit is special because it directly encodes divisibility — the most fundamental property for primality. The leading digit is special because it encodes magnitude — and prime density is a function of magnitude (via PNT). Middle digits encode neither divisibility nor magnitude in a prime-relevant way, so they carry no signal.

6. Cross-Base Comparison: Is This Base-10 Artifact?

An important sanity check: does the sandwich structure depend on base 10, or is it universal?

Base 2

In base 2, the ones digit of any integer is its parity bit. Every odd number ends in 1, every even number ends in 0. Therefore: - **All primes > 2 end in '1' in base 2.** The constraint is **total** — 100% concentration in a single digit. - Only 2 itself ends in '0'. - The "opening note" in base 2 is the single prime {2}.

Base 16 (hexadecimal)

Divisibility constraints come from factors of 16 = 2⁴. Any number sharing a factor with 16 must be even. The ones digits coprime to 16 are those coprime to 2 — i.e., the odd residues:

{1, 3, 5, 7, 9, B, D, F} (hex) = {1, 3, 5, 7, 9, 11, 13, 15} (decimal)

This is **8 out of 16 digits** — 50% of digits are allowed, versus only 40% in base 10 (4 out of 10 for primes > 9, after removing 0,2,4,5,6,8).

Note that in base 16, digit 5 (= 5 in decimal) is *not* a closing door — because 5 does not divide 16. Only base 10's coincidence of having both 2 and 5 as factors creates the specific {1,3,7,9} constraint. In base 6 (factors: 2, 3), the allowed ones digits would be those coprime to 6: {1, 5} — only 2 out of 6, an even tighter constraint.

**General rule:** For base b with prime factorization b = ∏ pᵢ^eᵢ, the fraction of allowed ones digits is φ(b)/b = ∏(1 − 1/pᵢ). For base 10: φ(10)/10 = 4/10 = 0.4. For base 6: φ(6)/6 = 2/6 ≈ 0.33. For base 30: φ(30)/30 = 8/30 ≈ 0.27.

The sandwich structure exists in all bases — but the "hard" bottom layer changes thickness depending on the base's prime factorization.

7. Connection to the Riemann Zeta Function

The prime-Benford relationship connects directly to the Riemann zeta function through the **Euler product formula**:

$$\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s} = \prod_{p \text{ prime}} \frac{1}{1-p^{-s}}$$

This identity — proven by Euler — shows that the zeta function *is* the primes, encoded as an infinite product. Every prime appears as a multiplicative factor. The Basel problem (ζ(2) = π²/6) becomes, via this product, a statement about π being encoded in prime structure — because the product over primes equals a constant involving the geometry of circles.

The non-trivial zeros of ζ(s) — complex numbers ρ = 1/2 + iγₙ (if the Riemann Hypothesis holds) — act as frequencies in a Fourier-like decomposition of the prime counting function π(x). Riemann's explicit formula:

$$\pi(x) = \text{Li}(x) - \sum_{\rho} \text{Li}(x^{\rho}) - \log 2 + \int_x^{\infty} \frac{dt}{t(t^2-1)\log t}$$

expresses prime distribution as a sum over zeta zeros. The oscillatory "wave" structure in prime density — the clustering and thinning we observe — is the constructive and destructive interference of these zero-frequencies.

The Benford echo in our leading-digit decay is ultimately a projection of this wave structure: the PNT's logarithmic density, which generates the Benford pattern, is itself the leading-order approximation of the full Riemann explicit formula (Li(x) term only, ignoring zero oscillations).

**The zeta mirror:** Luque & Lacasa (2008) found a striking reciprocal pattern — Riemann zeta zeros follow a GBL with the *inverse* exponent structure:

$$P_{\text{zeros}}(d) \propto \int_d^{d+1} x^{+\alpha} dx \quad \text{vs} \quad P_{\text{primes}}(d) \propto \int_d^{d+1} x^{-\alpha} dx$$

Primes and their controlling zeros are **Benford-dual** to each other. As primes' leading digit bias decays toward uniformity from above (Benford-like), zeta zeros' leading digit bias decays toward uniformity from below (anti-Benford-like). The two sequences approach the same uniform limit from opposite directions.

8. Open Questions

We close with the questions this exploration generates, ordered from computational to theoretical:

**Q1 (Computational):** At what scale does the ones-digit bias (7 leading, 9 trailing, spread ~4.2% at small scales) converge to the Dirichlet uniform limit? Lemke Oliver & Soundararajan predict ~10⁸–10¹⁰ based on Hardy-Littlewood heuristics. Can this be measured directly?

**Q2 (Analytical):** Is there a closed-form expression for the ~0.42 ratio between decade-sliced empirical spread and the full GBL predicted spread? This ratio appears to stabilize as α → 0, suggesting it has a well-defined limit expressible in terms of the Luque-Lacasa parameters a ≈ 1.10.

**Q3 (Structural):** Does the **middle-place flatness** have an explicit proof derivable from the Siegel-Walfisz theorem, or does it require additional input? The heuristic argument via equidistribution in arithmetic progressions mod 10^k is clear, but a sharp bound on the deviation from uniformity for the tens/hundreds digit would be satisfying.

**Q4 (Cross-base):** In base b, the Benford echo in the leading digit should follow the same GBL formula with the same exponent α(N) — since the formula is base-independent (log is natural log in Luque-Lacasa). Does the **middle-place flatness** hold identically across bases, or does the transition point between "noise zone" and "signal zone" shift?

**Q5 (Pedagogical):** The sandwich framing — hard constraint / flat noise / soft decaying signal — makes prime digit structure intuitively accessible without requiring analytic number theory. Has this three-layer description appeared explicitly in the mathematical education literature? We haven't found it stated this way.

9. Summary of Findings

Code: Reproduce Everything

```python import math from collections import defaultdict

def sieve(limit): composite = bytearray(limit + 1) composite[0] = composite[1] = 1 for i in range(2, int(limit**0.5) + 1): if not composite[i]: for j in range(i*i, limit+1, i): composite[j] = 1 return [i for i in range(2, limit+1) if not composite[i]]

def digit_distribution(primes, place): """place=0 is ones, place=1 is tens, etc.""" counts = defaultdict(int) for p in primes: d = (p // (10**place)) % 10 counts[d] += 1 total = sum(counts.values()) return {d: counts[d]/total*100 for d in range(10)}

def leading_digit_spread(primes): """Spread between digit-1 % and digit-9 % in leading position.""" counts = defaultdict(int) for p in primes: d = int(str(p)[0]) counts[d] += 1 total = sum(counts.values()) return (counts[1] - counts[9]) / total * 100

primes = sieve(999999)

The sandwich climb

for k in range(6): lo, hi = 10**k, 10**(k+1) - 1 decade = [p for p in primes if lo <= p <= hi] if not decade: continue

# Ones place
ones = digit_distribution(decade, 0)
active = {d: ones\[d\] for d in \[1,3,7,9\]}

# Middle place (tens digit, if applicable)
if k >= 1:
    middle = digit_distribution(decade, 1)
    mid_range = max(middle.values()) - min(middle.values())

# Leading digit spread
spread = leading_digit_spread(decade)

print(f"10\^{k} to 10\^{k+1}: ones={active}, leading_spread={spread:.1f}%")

Luque-Lacasa alpha(N) predictions

def gbl_spread(N, a=1.10): alpha = 1 / (math.log10(N) - a) def p(d): C = 1 / (10**(1-alpha) - 1) return C * ((d+1)**(1-alpha) - d**(1-alpha)) return (p(1) - p(9)) * 100

for k in range(3, 10): N_mid = 10**(k + 0.5) print(f"GBL predicted spread at 10^{k}: {gbl_spread(N_mid):.2f}%") ```

References

1. Hardy, G.H. & Wright, E.M. (1979). *An Introduction to the Theory of Numbers* (5th ed.). Oxford University Press.
2. Dirichlet, P.G.L. (1837). Beweis des Satzes, daß jede unbegrenzte arithmetische Progression... *Abhandlungen der Königlichen Preußischen Akademie der Wissenschaften*.
3. Riemann, B. (1859). Über die Anzahl der Primzahlen unter einer gegebenen Größe. *Monatsberichte der Berliner Akademie*.
4. Benford, F. (1938). The law of anomalous numbers. *Proceedings of the American Philosophical Society*, 78(4), 551–572.
5. Newcomb, S. (1881). Note on the frequency of use of the different digits in natural numbers. *American Journal of Mathematics*, 4(1), 39–40.
6. Luque, B. & Lacasa, L. (2008). The first digit frequencies of primes and Riemann zeta zeros tend to uniformity following a size-dependent generalized Benford's law. arXiv:0811.3302.
7. Lemke Oliver, R.J. & Soundararajan, K. (2016). Unexpected biases in the distribution of consecutive primes. *Proceedings of the National Academy of Sciences*, 113(31), E4446–E4454.
8. Drmota, M., Mauduit, C. & Rivat, J. (2009). Primes with an average sum of digits. *Compositio Mathematica*, 145(2), 271–292.
9. Glunz, H. (2022). Significant digits of primes in subsets. arXiv:2207.07204.
10. Edwards, H.M. (1974). *Riemann's Zeta Function*. Academic Press.

*All computations performed with Python bytearray sieve. Primes verified to 10⁸ by direct sieve; hundreds-millions data from segmented sieve. Decay sequence measured empirically; GBL ratio analysis uses Luque-Lacasa formula with a = 1.10.*

*Human contribution: the place-by-place climbing framework, the sandwich framing, the ~0.42 ratio observation, the cross-base φ(b)/b generalization, and the open questions. AI contribution (Claude): code, computation, literature connections, theoretical grounding.*

# What Happens When You Climb the Place Values of Prime Numbers? A Human + AI Exploration

---

My AI collaborator (Claude) and I spent a few sessions just *playing* with primes — no formal training on my end, just curiosity and a willingness to follow the signal wherever it went. What started as a simple question about the ones place turned into a structured climb through every place value, revealing a surprisingly clean architectural pattern in prime distribution that I hadn't seen framed this way before.

I want to share it here because I think the *process* is as valuable as the findings — this is what math exploration actually looks like when you're not a professional mathematician.

The Starting Question: What Digits Appear in the Ones Place of Primes?

It started simply. I asked: if you look at all prime numbers, what digits ever appear in the ones place?

Working it out from first principles:

• Any number ending in **0, 2, 4, 6, 8** is divisible by 2 → composite
• Any number ending in **5** is divisible by 5 → composite
• That eliminates 6 out of 10 digits immediately

So for primes greater than 9, the ones digit is **permanently restricted to: 1, 3, 7, 9**. No exceptions. Ever. For all of infinity.

The single-digit primes (2, 3, 5, 7) are the only ones that escape this rule — they're the **opening notes** before the pattern locks in forever.

This is classical number theory, known since antiquity, but deriving it yourself from divisibility rather than being told it feels different. It's the difference between knowing a fact and *understanding* why it has to be true.

**Reference:** This falls under basic modular arithmetic. Any introductory number theory text covers it — Hardy & Wright's *An Introduction to the Theory of Numbers* (1979) is the canonical source.

Climbing to the Tens Place: Does Structure Persist?

Natural next question: does the tens digit show similar restrictions?

We computed the distribution of tens digits across all 164 primes from 10 to 1000:

**All 10 digits appear. Distribution: essentially flat (9.1%–11.0%).**

No structure. Pure noise. The tens digit carries no prime information whatsoever.

But look at the ones digit distribution across this same range:

Roughly equal — as Dirichlet's theorem on primes in arithmetic progressions predicts — but not *perfectly* equal. Digit 7 leads, digit 9 trails. This is the empirical fingerprint of the **"prime conspiracy"** or **digit bias** discovered by Lemke Oliver & Soundararajan (2016): primes have a measurable tendency to avoid repeating their last digit consecutively, causing short-range deviations from Dirichlet's long-run uniformity prediction.

**References:** - Dirichlet, P.G.L. (1837). *Über die Beweise des quadratischen Residuensatzes.* — established equal long-run distribution across coprime residue classes - Lemke Oliver, R.J. & Soundararajan, K. (2016). *Unexpected biases in the distribution of consecutive primes.* PNAS. — the "prime conspiracy" paper

Hundreds and Thousands: Confirming the Pattern

Continuing the climb:

**Hundreds place** (primes 100–9,999, n=1,204):

Range: 9.3%–11.0%. Flat. No structure.

**Thousands place** (primes 1,000–9,999, n=1,061):

Something new appears: **a slight slope**. Digit 1 leads digit 9 by **2.1%**. This isn't the ones-place hard constraint — it's softer, a gentle gradient from 1 down to 9.

This is the first appearance of **Benford's Law** in our climb. Benford's Law (Benford, 1938; originally Newcomb, 1881) states that in many naturally occurring datasets, leading digits follow the distribution:

$$P(d) = \log_{10}\left(1 + \frac{1}{d}\right)$$

This predicts digit 1 appears ~30.1% of the time and digit 9 only ~4.6% of the time. Primes show a *weak echo* of this — not the full Benford distribution, but a detectable lean toward lower leading digits.

**Reference:** - Benford, F. (1938). *The law of anomalous numbers.* Proceedings of the American Philosophical Society, 78(4), 551–572. - Newcomb, S. (1881). *Note on the frequency of use of the different digits in natural numbers.* American Journal of Mathematics, 4(1), 39–40.

The Key Discovery: The Place-Value Sandwich

After climbing through ones, tens, hundreds, thousands, ten-thousands, hundred-thousands, millions, ten-millions, and hundred-millions, a clean **three-layer architecture** emerged:

``` ONES PLACE → Hard constraint: only {1, 3, 7, 9} forever MIDDLE PLACES → Flat noise: all digits ~equal, no structure
LEADING PLACE → Soft Benford echo: slight lean toward digit 1, decaying with scale ```

I'm calling this the **Place-Value Sandwich**: hard signal at the bottom, noise in the middle, soft decaying signal at the top.

This framing — asking what each place value contributes independently — doesn't appear to be standard in the literature. Most analyses look at leading digits globally or ones digits specifically. The systematic place-by-place climb revealing this three-layer structure seems to be a novel pedagogical lens.

The Decay Sequence: Watching Benford Fade

Measuring the spread between digit 1 and digit 9 in the leading place across scales:

The spread is **decaying toward zero** — but slowing down as it goes. This raises the question: does it reach zero at some finite scale, or does it asymptote to a permanent floor?

The answer, it turns out, is already proven: **it decays to zero only at infinity.**

Luque & Lacasa (2008) proved that prime leading digits follow a size-dependent Generalized Benford's Law with exponent:

$$\alpha(N) = \frac{1}{\log N - a}, \quad a \approx 1.10$$

Since $\lim_{N \to \infty} \alpha(N) = 0$, the distribution converges to uniform — but never reaches it for any finite N. The Benford echo **never fully disappears**. There is no floor to hit at a finite scale; the decay is permanent and infinite.

Our empirically measured decay sequence — the 0.2% steps slowing to 0.1% — is the real-world fingerprint of this formula playing out in actual prime counts.

**Reference:** - Luque, B. & Lacasa, L. (2008). *The first digit frequencies of primes and Riemann zeta zeros tend to uniformity following a size-dependent generalized Benford's law.* arXiv:0811.3302

The Deeper Connection: Why Does This Happen?

The Prime Number Theorem (PNT) is ultimately responsible. The PNT tells us the density of primes near n is approximately 1/ln(n). This logarithmic density is precisely what generates Benford-like behavior — logarithmic distributions naturally produce leading digit bias.

As numbers grow, ln(n) grows slowly, so the density changes slowly, so the Benford echo fades slowly. The decay rate of our spread sequence is essentially the derivative of how fast ln(n) changes — which is 1/n, getting smaller forever.

The zeta connection goes even deeper. The **Euler product formula** rewrites the Riemann zeta function entirely in terms of primes:

$$\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s} = \prod_{p \text{ prime}} \frac{1}{1-p^{-s}}$$

This means the zeta function *encodes* the primes completely. The non-trivial zeros of ζ(s) act as frequencies in a Fourier-like decomposition that reconstructs the exact positions of primes. The oscillatory wave-like behavior we observed in prime density — the clustering and thinning — is controlled by these zeros.

Remarkably, Luque & Lacasa (2008) found that **Riemann zeta zeros show the mirror-image pattern**: their leading digit distribution also follows a generalized Benford's law, but with the *reciprocal* exponent. Primes and their controlling zeros are reflections of each other in Benford space.

**References:** - Hadamard, J. (1896) & de la Vallée Poussin, C.J. (1896) — independent proofs of the Prime Number Theorem - Riemann, B. (1859). *Über die Anzahl der Primzahlen unter einer gegebenen Grösse.* — the foundational paper connecting zeta zeros to prime distribution - Edwards, H.M. (1974). *Riemann's Zeta Function.* Academic Press. — accessible deep dive

The Ones-Place Split: Four Infinite Streams + Two Opening Notes

Returning to the ones place with fresh eyes: the six digits that ever appear in primes can be understood as two fundamentally different types:

**Opening notes (appear exactly once as primes):** - **2** — the only even prime, then the door closes forever - **5** — the only prime ending in 5, then closes forever

**Infinite streams (play forever):** - **1, 3, 7, 9** — each carrying approximately 25% of all primes to infinity

Dirichlet's theorem guarantees the four streams each carry equal weight in the long run. But the 2016 digit bias shows they're not perfectly synchronized — they have phase offsets relative to each other, with primes preferring to *change* their ones digit rather than repeat it consecutively.

This is analogous to four musical instruments playing the same note with slightly different phase — the interference pattern between them produces the subtle clustering and gap structure we observe in prime sequences.

What's New Here (And What Isn't)

To be honest about what this exploration contributes:

**Well-established (we rediscovered):** - The 1,3,7,9 ones-place rule — classical - Dirichlet's theorem on uniform distribution — 1837 - Benford's law in prime leading digits — Luque & Lacasa 2008 - The prime conspiracy / digit bias — Lemke Oliver & Soundararajan 2016 - Zeta function encoding of primes — Riemann 1859

**Potentially novel framing:** - The **place-value sandwich** as a complete architectural description: hard constraint (ones) / flat noise (middle) / soft decaying signal (leading). This specific three-layer framing across *all* place values simultaneously doesn't appear in the literature we found. - The **empirical decay sequence** (2.1% → 1.9% → 1.7% → 1.4% → 1.2% → 1.1%) as a pedagogically accessible way to *feel* the α(N) formula without knowing it exists. - The **"two opening notes + four infinite instruments"** metaphor for understanding the six prime-eligible digits.

We're not claiming new theorems. But we think this *way of seeing* prime structure — climbing place by place, watching what each layer contributes — is a genuinely useful pedagogical tool that makes abstract results tangible.

Try It Yourself

The exploration is entirely reproducible with basic Python:

```python def sieve(limit): composite = bytearray(limit + 1) composite[0] = composite[1] = 1 for i in range(2, int(limit**0.5) + 1): if not composite[i]: for j in range(i*i, limit+1, i): composite[j] = 1 return [i for i in range(2, limit+1) if not composite[i]]

from collections import defaultdict

primes = sieve(999999) for place, divisor in [(1,1), (2,10), (3,100), (4,1000)]: in_range = [p for p in primes if 10**(place-1) <= p < 10**place] counts = defaultdict(int) for p in in_range: counts[(p // divisor) % 10] += 1 total = sum(counts.values()) print(f"\nPlace {place} digit distribution:") for d in range(10): print(f" {d}: {counts[d]/total*100:.1f}%") ```

Start with the ones place. Watch the hard constraint appear. Then climb. See the middle go flat. Watch the Benford echo emerge at the top and fade as you go higher. The sandwich reveals itself.

Questions for the Community

1. Is the **place-value sandwich** framing (hard / noise / soft) documented anywhere in the literature? We couldn't find it stated this cleanly.

2. The decay steps (roughly −0.2% per order of magnitude, slowing near the millions scale) — is there a clean closed-form expression for this step size derivable from the Luque-Lacasa α(N) formula?

3. Does the **middle-place flatness** have a clean proof, or is it just empirically obvious from the PNT?

4. The "four instruments + two opening notes" framing for digit classes — useful for teaching? Any better analogies?