No label defined (Q4550427)

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 1788104
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1788104

      Statements

      0 references
      25 August 2002
      0 references
      Sophie Germain primes
      0 references
      Legendre formula for the number of primes
      0 references
      A prime \(p\) is called Sophie Germain (SG) prime when \(2p+1\) is also a prime (a history and connections with other objects of the number theory see, e.g., \textit{P. Ribenboim} [13 Lectures on Fermat's Last Theorem (1979; Zbl 0456.10006) or Fermat's Last Theorem for amateurs (1999; Zbl 0920.11016)]). Note that it is unknown whether there exist infinitely many such primes. The author proves a Legendre type formula relating to \(\pi _{\text{SG}}(t)\), the number of SG primes, which is analogous to the formula for the number of prime \(\leq t\) and studies SG prime chains of length \( l=l(q)\) for a prime \(q\) (that is, for prime \( q=q_1\), \(l\) integers \(q_1, q_2=2q_1+1,\dots ,q_l=2q_{l-1}+1\) are primes, but \(q_{l+1}=2q_l+1\) is not). In particular, for \(n\in \mathbb N\) the following question arises: Is there always an SG prime \(q\) having length \(l(q)\geq n\) ? The paper contains two different representations for \(\pi _{SG}(t)\). Based on the results proved the author expects that \[ \pi _{\text{SG}}(t)= O( L(t)t/\log t), \qquad t\in \mathbb N, \] where \[ L(t)= \prod _ {\substack{p\text{ odd}\\ p\leq (2t+1)/3}} \bigl (1-1/(p-1)\bigr). \] Reviewer's remark: On the page 66 line 8 the reference must be to Powell [3] instead of Powell [2].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references