Factoring Odd Integers without Multiplication and Division
Charles Sauerbier
TL;DR
This paper introduces a practical algorithm for factoring odd integers that relies solely on addition and subtraction, avoiding multiplication and division, making it accessible for implementation by non-experts.
Contribution
It presents a non-theoretical, implementable method for factorization that eliminates the need for multiplication and division in the iterative process.
Findings
Feasible for implementation using only integer addition and subtraction.
Accessible to non-academic practitioners.
Provides an alternative approach to integer factorization.
Abstract
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and subtraction throughout. 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
TopicsPolynomial and algebraic computation · Numerical Methods and Algorithms · History and Theory of Mathematics