Short Recurrences and Straight-Line Programs for Primes YMBTSX10FF

URI	`m2://res/YMBTSX10FF`
Kind	preprint
Creators	Joseph M. Shunia, Mihai Prunescu
Date	2026-10-09
MSC	11-XX
Subjects	arxiv math.NT
Scope	in

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
A residue test for a twin-prime output	statement	proposition 2.7	arxiv
The binary invariant	statement	lemma 2.1	arxiv
One integer, successive primes	statement	theorem 1.1	arxiv
Parameter bounds	statement	lemma 3.2	arxiv
Binary logarithm from integer roots	statement	theorem A.3	arxiv
A dedicated packed program for $\pi(n)$	statement	theorem 3.6	arxiv
The short divisor sieve	statement	lemma 3.4	arxiv
Prime gaps from a single state	statement	corollary 2.3	arxiv
Exact enumeration of twin candidates	statement	theorem 2.8	arxiv
Strict arithmetic terms for $p_n$ and $\pi(n)$	statement	corollary 3.9	arxiv
The period encoded by the state	statement	corollary 2.2	arxiv
A fixed program for twin-prime counting	statement	theorem 3.8	arxiv
Prime counting as a valuation	statement	theorem 2.5	arxiv
Rank selection by carries	statement	lemma 3.7	arxiv
Direct reciprocal packing	statement	lemma 3.3	arxiv
Extracting $\pi(n)$ from the packed sieve	statement	corollary 3.5	arxiv
Certification below the square threshold	statement	proposition 2.9	arxiv
An arithmetic term for binary bitwise conjunction	statement	theorem A.1	arxiv
Reformulations of the twin-prime conjecture	statement	corollary 2.10	arxiv
A packed straight-line construction for $p_n$	statement	theorem 3.1	arxiv
Integer-root term	statement	theorem A.2	arxiv