Skip to content
Free planNo credit card requiredStart writing

other · Zenodo (CERN European Organization for Nuclear Research) · 2025

Predicting Prime Factor Sums of Odd Semiprimes via Modular Residues: A Conjecture on Prime Factor Sums

Chandhru, Srinivasan

Cited by 0Open access

Abstract

Novel conjecture related to odd semiprimes. Astrology for Semiprimes" — Give me any odd semiprime N, and I’ll tell you exactly where its factor sum is likely to be hiding in modular space. This work suggests an underlying structural regularity in semiprimes and invites further mathematical investigation and formal proof.

Cite this paper

APA 7

Chandhru, S. (2025). Predicting Prime Factor Sums of Odd Semiprimes via Modular Residues: A Conjecture on Prime Factor Sums. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.17352371

MLA 9

Chandhru, Srinivasan. “Predicting Prime Factor Sums of Odd Semiprimes via Modular Residues: A Conjecture on Prime Factor Sums.” Zenodo (CERN European Organization for Nuclear Research), 2025, https://doi.org/10.5281/zenodo.17352371.

Chicago

Chandhru, Srinivasan. 2025. “Predicting Prime Factor Sums of Odd Semiprimes via Modular Residues: A Conjecture on Prime Factor Sums.” Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.17352371.

Harvard

Chandhru, S. (2025) ‘Predicting Prime Factor Sums of Odd Semiprimes via Modular Residues: A Conjecture on Prime Factor Sums’, Zenodo (CERN European Organization for Nuclear Research). Available at: https://doi.org/10.5281/zenodo.17352371.

BibTeX
@misc{chandhru2025predicting,
  title = {{Predicting Prime Factor Sums of Odd Semiprimes via Modular Residues: A Conjecture on Prime Factor Sums}},
  author = {Chandhru, Srinivasan},
  journal = {Zenodo (CERN European Organization for Nuclear Research)},
  year = {2025},
  doi = {10.5281/zenodo.17352371}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.