A function to calculate all relative prime numbers up to the product of\n the first n primes

2014/04/02 by Matthias Schmitt, Schmitt, Matthias · 1 citation
Computer Science · Mathematics · #Mathematics, Computing, and Information Processing #History and Theory of Mathematics

paper · pdf · doi:10.48550/arxiv.1404.0706

Abstract

We prove an isomorphism between the finite domain from 1 up to the product of\nthe first n primes and the new defined set of prime modular numbers. This\ndefinition provides some insights about relative prime numbers. We provide an\ninverse function from the prime modular numbers into this finite domain. With\nthis function we can calculate all numbers from 1 up to the product of the\nfirst n primes that are not divisible by the first n primes. This function\nprovides a non sequential way for the calculation of prime numbers.\n

Cited by

• On a Deterministic Property of the Category of k-almost Primes: A Deterministic Structure Based on a Linear Function for Redefining the k-almost Primes (∃ n∈ \rm N , 1≤ k ≤n) in Certain Intervals

Related

• A Functional Recurrence to obtain the Prime Numbers using the Smarandache Prime Function
• A prime prime primer
• On formula to compute primes and the nth prime
• The Prime Number Theorem and Primorial Numbers
• On a new method for calculation of the number of prime numbers in the\n given interval