Carmichael's Function

Carl Pomerance

Bell Labs - Lucent Technologies

November 9,
refreshments at 3:45pm


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.

Speaker's Contact Info: carlp(at-sign)

Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)

Page loaded on September 18, 2001 at 05:33 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.