5. Let *n* = *p* 1 *k* 1 *p* 2 *k* 2 ... *p* *m* *k* *m*...
Question:
5. Let *n* = *p*1*k*1 *p*2*k*2 ... *p**m**k**m* be the unique prime factorization of *n*. Define λ(*n*) as the least common multiple (see p. 259) of all φ(*p**i**k**i*), where *i* = 1, 2, ..., *m*. Prove:
(a) λ(*n*) | φ(*n*);
(b) *a*λ(*n*) = 1 mod *n* for all [*a*]*n* ∈ Z*n*;
(c) if *n* is a Carmichael number, then *k**i* = 1 for all *i* = 1, 2, ..., *m*;
(d) if *n* is a Carmichael number, then *n* is the product of at least three different primes.
(e) Is 27935017 a Carmichael number?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Secure Communicating Systems Design Analysis And Implementation
ISBN: 9780521807319
1st Edition
Authors: Michael R. A. Huth
Question Posted: