Carmichael's Conjecture
phi(m)=phi(pm)/p=phi(pm)/(p-1) [p->99999..., Euclid]
=> m==0 (mod p) and m>0 (mod p)
Therefore m1==0 (mod p) and m2>0 (mod p), at least, always exist
Copyright 1998 James Wanless