arXiv · 1905.06447
Strong Pseudo Primes to Base 2
Abstract
In this work, we add an additional condition to strong pseudo prime test to base 2. Then, we provide theoretical and heuristics evidences showing that the resulting algorithm catches all composite numbers. Our method is based on the structure of singular cubics' Jacobian groups on which we also define an effective addition algorithm.
Explore related subjects
Keep this discovery
Kubra Nari, Enver Ozdemir, Neslihan Aysen Ozkirisci. 2019-05-15. Strong Pseudo Primes to Base 2. https://arxiv.org/abs/1905.06447
Cite the original work for its findings. Save a collection to share your selection of sources.