CUBIC COLLISIONS MODULO COMPOSITE INTEGERS: EXPLICIT COUNTS IN BOUNDED WINDOWS

We count cubic congruence pairs by separating the prime-power divisibility of D = x − y and H = x² + xy + y². Local four-state counts give exact masking statistics over square-free composite moduli, including the exceptional primes 2 and 3. For square-free moduli with prime factors greater than 3, we derive periodic formulas for the number of masked pairs in bounded squares, with an explicit correction for diagonal pairs. The semiprime specialization yields a quadratic quasipolynomial, explicit periodic coefficients, and a sharp first-occurrence threshold when both primes are 2 modulo 3. For primes greater than 3, a rational joint valuation series and an independent finite sum give strict-masking counts at arbitrary prime-power exponents. Exact integer enumeration checks the formulas for selected moduli and window sizes.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-05
DOI
https://doi.org/10.5281/zenodo.23983016
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

CUBIC COLLISIONS MODULO COMPOSITE INTEGERS: EXPLICIT COUNTS IN BOUNDED WINDOWS

Md. Amir Khusru Akhtar
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

CUBIC COLLISIONS MODULO COMPOSITE INTEGERS: EXPLICIT COUNTS IN BOUNDED WINDOWS

Md. Amir Khusru Akhtar
preprint en

Abstract

We count cubic congruence pairs by separating the prime-power divisibility of D = x − y and H = x² + xy + y². Local four-state counts give exact masking statistics over square-free composite moduli, including the exceptional primes 2 and 3. For square-free moduli with prime factors greater than 3, we derive periodic formulas for the number of masked pairs in bounded squares, with an explicit correction for diagonal pairs. The semiprime specialization yields a quadratic quasipolynomial, explicit periodic coefficients, and a sharp first-occurrence threshold when both primes are 2 modulo 3. For primes greater than 3, a rational joint valuation series and an independent finite sum give strict-masking counts at arbitrary prime-power exponents. Exact integer enumeration checks the formulas for selected moduli and window sizes.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon