Abstract
The paper proves that an odd composite integer N can be factorized in O(logN) time if N's big divisor is in the form 2α u + 1 or 2α u − 1 and its small divisor does not exceed 2α + 1 Theorems and corollaries around the conclusion are proved with detail mathematical reasoning. The results in the paper again demonstrate the significance of applying the valuated binary tree on analyzing the odd integers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
