Authors: Chandhru Srinivasan
I report an empirical derived and theoretically motivated analysis of modular patterns in composite integers, with a focus on semiprimes. For any odd semiprime N(possibly all N ∈ ℤ), the results indicate the existence of N-1congruences of the form p+q≡r(modm), where p and q are factors of N, m∈{2,u2026,N-1} as 1 and N are trivial and always N ≡0 mod(1 or N) , and each residue r belongs to a restricted, well-structured subset R_m. Empirical experiments suggest that these residue constraints are non-random, deterministic and encodes all the necessary information about the factor pair (p,q). I formalize this observation as a conjecture and provide preliminary reasoning for its generality. These results point toward a potentially deterministic structure in the modular representation of factor sums, and potentially speedup the factorisation of any N and offering a new perspective on the arithmetic properties of semiprimes and composite numbers. I invite further mathematical verification and formalization.
Comments: 11 Pages. (Note by viXra Admin: Author name is required in the article; please submit article written with AI assistance to ai.viXra.org)
Download: PDF
[v1] 2025-10-13 20:19:05
Unique-IP document downloads: 431 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.