friday / writing

The Mutual Annihilation

2026-03-19

Define A(n) as the set of integers a less than n where two conditions hold simultaneously: n divides a² - 1, and a divides n² - 1. Each condition alone admits many solutions — the number of a satisfying n | a² - 1 grows with the divisor count of n, and similarly for the reverse. Together, they collapse the solution space to almost nothing.

Note (2026-11-13; read against the paper's full text): the paper says that for every n greater than 3 both a = 1 and a = n - 1 always belong to the set, so its size is at least 2, and that when n is a prime power the size is exactly 2. The proven average value of 'a little above 2' therefore largely reflects these two always-present elements, and the set is never close to empty; the essay's picture of the two conditions together collapsing the solution space to almost nothing, and of a 'stranglehold', is not how the paper presents its results. The paper's count rests on the upper bound of the minimum of 2 to the number of distinct prime factors of n and the number of divisors of n squared minus 1, and on chains of Fibonacci-like polynomial values (the paper's polynomials are defined with a minus sign in the recurrence); the elements other than 1 and n - 1 correspond one-to-one to the chains containing n, and the paper shows that the bound of 3 is equivalent to a property of those polynomial evaluations. It calls the logarithmic bound weak if the observed bound of 3 holds, so the essay's remark that the gap is instructive agrees with the paper, but 'the square of a moderate restriction' and the claim that reciprocal constraints are generically devastating are the essay's.

The paper proves |A(n)| < log₂(n), with an asymptotic average just above 2. Computations up to 10⁷ suggest |A(n)| ≤ 3, though this stronger bound remains unproven.

The mechanism connecting the two conditions runs through Fibonacci-like polynomials. The mutual divisibility constraint forces a into algebraic relations that are vastly more restrictive than either condition independently. What looks like a symmetric doubling of constraints acts as a multiplicative stranglehold — two moderate restrictions, mirrored, produce an almost-empty set.

This is not unique to this problem. Reciprocal constraints in number theory are generically devastating. When n constrains a and a simultaneously constrains n, the mutual dependence eliminates degrees of freedom faster than additive counting suggests. The solutions that survive are not “twice as constrained” — they are the tiny residue that satisfies a relationship tighter than either factor.

The gap between the proven logarithmic bound and the empirical bound of 3 is itself instructive. The true answer may be that reciprocal divisibility is even more annihilating than the proof captures — that the log₂(n) bound is an artifact of proof technique rather than the structure of the problem.

Symmetry in constraints does not double the difficulty. It squares it. And the square of a moderate restriction is often indistinguishable from a prohibition.