Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Centered Reduced Residue Progressions

Abstract

The longest positive-step progression in a short centered squarefree reduced residue system has the conjectured length.

Definition 1.1 (The fixed centered reduced residue system).

Formalization. D5/S3/ArithUnits/CenteredReducedResidueProgressions.CenteredReducedResidue (✓ std3).

Citation. Chaninat Phothila; Natthakan Thoket; Narakorn Rompurk Kanasri (2026). Length of the Longest Arithmetic Progressions in a Certain Reduced Residue System. DOI: 10.5281/zenodo.18154061. URL: https://math.colgate.edu/~integers/aa6/aa6.pdf.

Commentary.

For a natural modulus n, the centered system consists of the integers in the source interval beginning at minus (n+1)/2 plus one and ending n-1 steps later, subject to gcd one with n.

Definition 1.2 (Positive-step progression lengths).

Formalization. D5/S3/ArithUnits/CenteredReducedResidueProgressions.AdmissibleLength (✓ std3).

Citation. Chaninat Phothila; Natthakan Thoket; Narakorn Rompurk Kanasri (2026). Length of the Longest Arithmetic Progressions in a Certain Reduced Residue System. DOI: 10.5281/zenodo.18154061. URL: https://math.colgate.edu/~integers/aa6/aa6.pdf.

Commentary.

A natural length s is admissible when some integer start and positive natural step place all terms with indices below s in the fixed centered reduced residue system.

Definition 1.3 (The greatest prime factor).

Formalization. D5/S3/ArithUnits/CenteredReducedResidueProgressions.GreatestPrimeFactor (✓ std3).

Citation. Chaninat Phothila; Natthakan Thoket; Narakorn Rompurk Kanasri (2026). Length of the Longest Arithmetic Progressions in a Certain Reduced Residue System. DOI: 10.5281/zenodo.18154061. URL: https://math.colgate.edu/~integers/aa6/aa6.pdf.

Commentary.

The greatest prime factor is the supremum of the finite set of prime factors. On the theorem’s domain that set is nonempty.

Theorem 1.4 (The exact maximum progression length).

Proof. Machine-checked in Lean as D5/S3/ArithUnits/CenteredReducedResidueProgressions.result (✓ std3). ∎

Resolves. Problems/centered-reduced-residue-progressions (proved) by D5/S3/ArithUnits/CenteredReducedResidueProgressions.result.

Source. Repository-derived.

Acknowledgement. Chaninat Phothila; Natthakan Thoket; Narakorn Rompurk Kanasri (2026). Length of the Longest Arithmetic Progressions in a Certain Reduced Residue System. DOI: 10.5281/zenodo.18154061. URL: https://math.colgate.edu/~integers/aa6/aa6.pdf.

Commentary.

Let p be the greatest prime factor of n, d=n/p, and k=p-1-floor(2p/d), where the inner floor is natural Euclidean division. For every even squarefree n with at least three distinct prime factors and d<2p, k is an admitted length and bounds every admitted length. The rational floor of p-2p/d is exactly the same natural number k.

References