| DATE: | Thursday, October 25, 2001 |
| TIME: | 4:30-5:30 PM |
| PLACE: | LN 2205 |
| SPEAKER: | Carl Pomerance (Bell Labs and University of Georgia) |
| TITLE: | Carmichael's Function |
Carmichael's function of n is the order of the largest cyclic subgroup of the multiplicative group of integers modulo n. What could be simpler? Actually, a lot could! Related to factoring, primality testing, Artin's conjecture, and Euler's function, there is still much that we don't know, and in some of the problems it is even hard to find the right conjecture.