On the congruence of n modulo Euler's function φ(n)
D.H.Lehmer was first to raise the question of whether φ(n) divides n-1 for any composite integer n, where φ is Euler's function. In this talk, we show that the number of such integers n≤x is o√x as x―∞.
Date : October 15, 2008 (Wednesday)
Time : 15.40
Place: Mathematics Seminar Room SA141
Tea will be served before the seminar.