1 citations · 1 across the 12 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2017
Factoring Odd Integers without Multiplication and Division
Charles Sauerbier
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 i…
cs.DM2016
Prime Factoring and The Complexity Of
Charles Sauerbier
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; in…
cs.DM2010
A Polynomial Diophantine Generator Function for Integer Residuals
Charles Sauerbier
Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals [1,Floor(n^0.5…