3

An example in my textbook, but I'm not quite sure how to set this one up, because of the $p \ge 5$ part. How do I start it off?

mathlove
  • 139,939
JCMcRae
  • 843

1 Answers1

7

If $p\ge 5$, then $p$ is odd. So, the remainder has to be odd. But, the remainder cannot be $3$ because $p\ge 5$ cannot be the form $6m+3$ which is divisible by $3$.

mathlove
  • 139,939
  • Okay, and then how would I show that the remainder has to be odd? I can do examples and see that it is true, but how would I generally prove it? – JCMcRae Oct 10 '14 at 20:13
  • 1
    @J-Play: If the remainder is even $2m$, $p$ can be represented as $p=6k+2m$. This is even, which is a contradiction (a prime number $p\ge 5$ is odd). – mathlove Oct 10 '14 at 20:16