Prime Factoring and The Complexity Of
Charles Sauerbier
TL;DR
This paper introduces a difference equation method for factoring composite numbers, demonstrating the feasibility of P-complexity, and aims to be accessible to practitioners outside academia.
Contribution
It presents a non-theoretical, practical approach to prime factorization using difference equations, exploring P-complexity in this context.
Findings
Feasibility of P-complexity demonstrated
Difference equation method effectively factors composites
Accessible presentation for non-academic audiences
Abstract
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non academic and theoretical practitioners.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistory and advancements in chemistry · Design Education and Practice