login
Lower bound for the multiplicity of a disjoint covering system of congruences.
0

%I #5 Mar 30 2012 18:39:15

%S 1,2,3,2,5,2,7,2,3,3,11,2,13,4,3,2,17,2,19,3,5,6,23,2,5,7,3,4,29,2,31,

%T 2,7,9,5,2,37,10,9,3,41,3,43,6,3,12,47,2,7,3,11,7,53,2,9,4,13,15,59,2,

%U 61,16,5,2,10,4,67,9,15,3,71,2,73,19,3,10,9,5,79,3,3,21,83,3,13,22,19,6,89

%N Lower bound for the multiplicity of a disjoint covering system of congruences.

%H T. Zamojski, <a href="http://www.math.mcgill.ca/~dsavitt/nt/projects/zamojski.ps">Survey on covering congruences</a>.

%F a(n) = floor(Lpf(n)*phi(n)/n) + 1 where Lpf(n) is the largest prime factor of n and phi is the Euler totient function.

%Y Cf. A080340.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Mar 20 2003