You can edit almost every page by Creating an account. Otherwise, see the FAQ.

Rassias' conjecture

From EverybodyWiki Bios & Wiki

In number theory, Rassias' conjecture is an open problem related to prime numbers. It was conjectured by Michael Th. Rassias while preparing for the International Mathematical Olympiad.[1][2][3][4][5][6][7] The conjecture states the following:

For every prime there exist two primes such that

Relation to other open problems[edit]

Rassias' conjecture can be stated equivalently as follows:

For any prime number there exist primes such that

This reformulation shows that the conjecture is a combination of a generalized Sophie Germain prime problem

strengthened by the additional condition that be prime too.[3][4] This makes it a special case of Dickson's conjecture. Note that Dickson's conjecture (and its generalization, Schinzel's hypothesis H) appeared much earlier than Rassias' conjecture. See the foreword of Preda Mihăilescu[7] for a presentation of interconnections of Rassias' conjecture with other known conjectures and open problems in number theory.

Also related are Cunningham chains, i.e. sequences of primes for fixed coprime positive integers . Unlike the breakthrough of Ben Green and Terence Tao[8] on primes in arithmetic progression, there is no general result known on large Cunningham chains to date. Rassias' conjecture is equivalent to the existence of Cunningham chains with parameters for such that is prime.[3][4]

References[edit]

  1. Andreescu, T.; Andrica, D. (2009). Number Theory: Structures, Examples and Problems. Birkhäuser, Boston, Basel. p. 12. Search this book on
  2. Balzarotti, G.; Lava, P. P. (2013). La Derivata Arithmetica. Editore Ulrico Hoepli Milano. pp. 140–141. Search this book on
  3. 3.0 3.1 3.2 Mihăilescu, Preda (2011). "Book Review". Newsletter of the European Math. Soc. 79: 45–47.
  4. 4.0 4.1 4.2 Mihăilescu, Preda (2014). "On some conjectures in Additive Number Theory". Newsletter of the European Math. Soc. 92: 13–16.
  5. Rassias, M. Th. (2005). "Open Problem No. 1825". Octogon Mathematical Magazine. 13: 885.
  6. Rassias, M. Th. (2007). "Problem 25". Newsletter of the European Math. Soc. 65: 47.
  7. 7.0 7.1 Rassias, M. Th. (2011). Problem-Solving and Selected Topics in Number Theory. Springer. pp. xi–xiii, 82. Search this book on
  8. Green, Ben; Tao, Terence (2008). "The primes contain arbitrarily long arithmetic progressions". Annals of Mathematics. 2: 481–547. doi:10.4007/annals.2008.167.481.


This article "Rassias' conjecture" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Rassias' conjecture. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.