Optimization finding prime numbers in C++

Authors

  • D.B. Alibiуev
  • M.A. Seksembayeva

Keywords:

prime numbers, Eratosthenes algorithm, Miller-Rabin test, BPSW algorithm, C++ language, computational optimization, algorithm

Abstract

In this article discusses ways to optimize for finding prime numbers using the Sieve of Eratosthenes algorithm, Miller-Rabin test and using an algorithm BPSW. In the work shows the results of the programs, where searching for prime numbers, such as a maximum for N = 2*1010. Also in the work shows programs in C++ optimized by time or by use memory. The results were reflected in the tables and as a graph for each of the considered algorithm.

Downloads

Published

2015-03-28

How to Cite

Alibiуev D., & Seksembayeva, M. (2015). Optimization finding prime numbers in C++. Bulletin of the Karaganda University. Mathematics Series, 77(1), 3–11. Retrieved from http://mts.buketov.edu.kz/index.php/mathematics-vestnik/article/view/3

Issue

2015 (77) 1

Section

MATHEMATICS