2014/10/06 by Vineet Kumar, Kumar, Vineet
Computer Science · Mathematics · #11A41 #11A51 #Advanced Mathematical Identities #FOS: Mathematics #General Mathematics (math.GM) #Numerical Methods and Algorithms #Polynomial and algebraic computation #math.GM #msc:11A41 #msc:11A51
paper · pdf · doi:10.48550/arxiv.1411.3356
PO-03-1498 Abstract Book [Poster Session], ICM 2014, Seoul, South Korea
arxiv created 2014/10/06 · openalex publication_date 2014/10/06 · arxiv updated 2014/11/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the number line. Generally the different categories of prime numbers found till date, satisfy the form of this function. We present some absolute and probabilistic conditions for the primality of the number generated by this method. This function is capable of leading to highly efficient algorithms for generating prime numbers.