Primes at a (Somewhat Lengthy) Glance (Q4390501)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1156454
Language Label Description Also known as
default for all languages
No label defined
    English
    Primes at a (Somewhat Lengthy) Glance
    scientific article; zbMATH DE number 1156454

      Statements

      Primes at a (Somewhat Lengthy) Glance (English)
      0 references
      0 references
      0 references
      0 references
      7 April 1999
      0 references
      primes
      0 references
      primality
      0 references
      representations of integers as sums
      0 references
      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} \)''.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references