Primes at a (Somewhat Lengthy) Glance
The authors prove that any prime \(n\geq 11\) can be represented as a sum of integers, \(n=N_1+\cdots+N_k\), such that if \(p_1,\ldots,p_k\) are all the primes up to \(\sqrt{n}\) then \(| N_j| <\prod_{i=1}^{k}p_i\) and the prime divisors of \(N_j\) are precisely \(\{p_1,\ldots,p_k\}\setminus\{p_j\}\), for all \(j=1,\ldots,k\). They give an elementary constructive proof, determining all such representations. Conversely, it is clear that if an integer can be represented as above, then it is prime. So, this gives a nice primality proof, which has just a theoretical interest. Indeed, as noted by the authors themselves, `` the representation is, in practice, ridiculously long, and one needs to know all of the primes up to \(\sqrt{n} \).
- Products of shifted primes. Multiplicative analogues of Goldbach's problems. II
- A journey through the world of primes
- Primes at a Glance
- Primes and consecutive sums in arithmetic progressions
- scientific article; zbMATH DE number 1090056 (Why is no real title available?)
- A constructive proof of scherk's theorem on the representation of primes
- scientific article; zbMATH DE number 7351476 (Why is no real title available?)
- How strong can primes be
This page was built for publication: Primes at a (Somewhat Lengthy) Glance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390501)