I know it is believed that primes appear to be randomly distributed among the integers. Is there a formal conjecture or theorem that expressly states that the occurrence of the prime numbers is random?


closed as off-topic by Maarten Bodewes Dec 28 '18 at 9:14

  • This question does not appear to be about cryptography within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

  • 1
    $\begingroup$ Hi @Ollie, While this is related to cryptography, it probably belongs on the math.stackexchange.com $\endgroup$ – Maybe_Factor Dec 28 '18 at 3:54
  • $\begingroup$ @Maybe_Factor It does, but this Q/A would very probably marked as a dupe. I'll close it though. Welcome, Ollie, but unfortunately questions about prime numbers without a direct relation to crypto are off topic here. $\endgroup$ – Maarten Bodewes Dec 28 '18 at 9:13
  • 1
    $\begingroup$ I'm voting to close this question as off-topic because it is not about cryptography but math, where it has a dupe. $\endgroup$ – Maarten Bodewes Dec 28 '18 at 9:14
  • $\begingroup$ @Maybe_Factor, the reason that I ask this question here rather than at math.stackexchange.com is because if someone happens to discover that the prime numbers are not random what, if any, impact would it have on RSA specifically? Let's consider that a list of primes can be produced using a formula but without the ability to say what the next prime is given a known prime. $\endgroup$ – Ollie Dec 28 '18 at 20:05
  • $\begingroup$ Then you might want to reformulate your question to ask this directly - it can maybe be then reopened. $\endgroup$ – Geoffroy Couteau Dec 29 '18 at 10:44