Prime Factoring and The Complexity Of
Discrete Mathematics
2016-02-23 v1
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.
Cite
@article{arxiv.1602.06910,
title = {Prime Factoring and The Complexity Of},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:1602.06910},
year = {2016}
}
Comments
6 pages