The Sieve of Atkin is a modern algorithm for finding prime numbers that has better asymptotic complexity than the ancient Sieve of Eratosthenes. The Sieve of Eratosthenes has a time complexity of O(n ...

This project provides a C++ implementation of a modified version of the Sieve of Atkin algorithm using concurrent principles (parallelism). The Sieve of Atkin is a modern algorithm for finding all ...

ABSTRACT: This paper provides several generalizations of Gauss theorem that counts points on special elliptic curves. It is demonstrated how to implement these generalizations for computation of ...