Short communication reveals inherent challenges in distinguishing primes from rough composites, suggesting limitations in methods relying on finite primes.
This short communication presents a focused theoretical investigation into the limitations of finite prime-based representations for primality detection. It introduces the concept of rough composites—composite integers whose prime factors lie outside a fixed finite prime basis—and shows that such integers may be indistinguishable from primes when analyzed only through local invariants derived from finite prime projections. The central contribution is the formulation of the Rough Composite Barrier, which states that no method relying solely on finite prime-based information can fully separate primes from composite integers. This barrier highlights an intrinsic limitation of finite-dimensional local representations and emphasizes the need for global, asymptotic, or structurally richer information in rigorous primality testing. The communication also notes implications for computational number theory and machine learning approaches, where strong empirical classification results may mask fundamental representational constraints.
No takes yet. Share an insight, caveat, or question.
Muhammad Obeidat (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: