2
$\begingroup$

How do I answer this question?

Find the largest value of $d$, and the corresponding value of $k$, for which the following theorem is true:

If all of $p, p + 2, p + 6$ and $p + 8$ are prime, then $p \equiv k \pmod d$ except in one case.

Find the value of $p$ that does not satisfy this theorem, then prove that the theorem is true in all other cases.

Thanks for any help :)

  • 0
    Is there any reason you want to delete your question after getting several good answers? Please note that this site helps everyone online - even though you've got the answer now, if someone had the same question as you, we'd want them to be able to see the answer here as well.2012-05-13
  • 0
    Oh, thats alright then.2012-05-14

2 Answers 2