(i) Let p be a prime number and 0 < k < p. Show that p |...
Fantastic news! We've Found the answer you've been seeking!
Question:
(i) Let p be a prime number and 0 < k < p. Show that p | p k . (ii) Use (i) to show Fermat’s Little Theorem: a p ≡ a (mod p), for any a ∈ Z
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Posted Date: