Loading ...
Sorry, an error occurred while loading the content.

Simpler proof that if N is Carmichael and p divides N, then (p-1) divides N/p - 1

Expand Messages
  • Kermit Rose
    Suppose N is Carmichael, and p is a prime which divides N (p-1) divides N-1 (p-1) divides (N/p)(p-1) (p-1) divides (N-1) - (N/p)(p-1) (p-1) divides (N-1) - N +
    Message 1 of 1 , Dec 18, 2010
    • 0 Attachment
      Suppose N is Carmichael, and p is a prime which divides N

      (p-1) divides N-1
      (p-1) divides (N/p)(p-1)

      (p-1) divides (N-1) - (N/p)(p-1)

      (p-1) divides (N-1) - N + (N/p)

      (p-1) divides -1 + (N/p)

      (p-1) divides (N/p) - 1


      Kermit
    Your message has been successfully submitted and would be delivered to recipients shortly.