Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.18480

Cyclotomic Prime Extractors

Joseph M. Shunia
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop explicit prime-recovery formulas from the values $Φ_n(2)$ of cyclotomic polynomials. Binary divisibility patterns detect repeated prime factors and identify the least prime divisor of a squarefree index, while small corrections to $\log_2Φ_n(2)$ allow successive recovery of the distinct prime factors. Specializing the index gives identities for prime products and the least prime above a given integer. The same mechanism extends from finite factorizations to an infinite prime sequence: a normalized limit of cyclotomic values along the odd primorials defines a real constant $Ω=0.25061403238015047218\ldots$, from which every odd prime can be recovered by a recursive rounding rule.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph M. Shunia. 2026-09-16. Cyclotomic Prime Extractors. https://arxiv.org/abs/2609.18480

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗