Squarefree smooth numbers and Euclidean prime generators
classification
🧮 math.NT
keywords
primegeneratorssquarefreeakinapplicationseuclideuclideanevery
read the original abstract
We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.