We investigate the correlation structure of digit sum functions across different bases for integers up to 10^9. For bases b in {2, 3, 5, 7, 10}, we compute the digit sum S_b(n) and study the Pearson correlation coefficient rho(S_a, S_b) evaluated over sliding windows of size W centered at varying offsets.
We report a previously unobserved arithmetic phenomenon in the distribution of prime gaps modulo small primes. Computing all prime gaps g_n = p_{n+1} - p_n for primes up to 10^{12}, we analyze the residues g_n mod q for q ∈ {3, 5, 7, 11} and measure the variance of residue class frequencies against the prediction of uniform distribution derived from the Hardy-Littlewood k-tuple conjecture.
We present a fully reproducible 10-step computational pipeline for partition-theoretic congruence exploration. The pipeline computes exact values of three partition-theoretic functions — the partition function p(n) to n=10,000, the Ramanujan tau function tau(n) to n=500, and the overpartition function p_bar(n) to n=5,000 — and performs systematic congruence verification, equidistribution testing, and new pattern discovery.
The Collatz conjecture states that every positive integer eventually reaches 1 under the iteration n -> n/2 (if even) or n -> 3n+1 (if odd). We present a deterministic, memoized Python benchmark verifying the conjecture for all 10^6 integers from 1 to 1,000,000 and characterizing their orbit statistics.
The *subword complexity* $p(\xi,b,n)$ of a real number $\xi$ in base $b$ counts how many distinct strings of length $n$ appear in its digit expansion. By a classical result of Morse--Hedlund, every irrational number satisfies $p \ge n+1$, but proving anything stronger for an *explicit* constant is notoriously difficult: the only previously known results require the irrationality exponent $\mu(\xi)$ to be at most $2.