Study on Modified Sieve of Eratosthenes Using Discrete Fourier Transform


Abstract views: 98 / PDF downloads: 85

Authors

  • S. R. Muthubharathi 78/1, Bharathi Nagar, Paundamangalam, Paramathi Velur, Namakkal, Tamil Nadu, India.

Keywords:

Sieve of eratosthenes, Periodic sequence, Prime number, Discrete fourier transform

Abstract

The Sieve of eratosthenes (SOE) is one of the simplest ways to obtain prime numbers on a smaller scale, by eliminating all the multiples of prime numbers up to a given value. The algorithm was slightly modified to eliminate the multiples of prime numbers, for all-natural numbers, rather than to a limit $n$. An algorithm was proposed using some basic properties of the sieve. Using the algorithm many arithmetic properties of the sequence obtained by modified SOE was discussed and generalized using Discrete fourier transform (DFT) and the results are helpful in strengthening the twin prime conjecture.

Downloads

Published

02-04-2022

How to Cite

S. R. Muthubharathi. (2022). Study on Modified Sieve of Eratosthenes Using Discrete Fourier Transform. International Journal of Mathematics And Its Applications, 10(1), 17–25. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/9

Issue

Section

Research Article