Abstract
A new algorithm which correctly identifies every positive integer tested as being either prime or composite is considered. In fact, the first one hundred Carmichael numbers were tested and each one resulted composite as expected. It is well known that other primality tests exist that can also identify Carmichael numbers as composites, but the given algorithm seems to work without any exception. Yet, it is not a practical test for large integers since the operations required to verify such numbers are not feasible from a computational point of view.
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.
