Some facts
1) For any number N=Sigma(p_i), i=1..k, p_i are prime factors of N with any prime number cp, cp is not factor of N, there is: Mod(cp^LCM(p_i-1, i=1..k), N)=1. for some case, Mod(cp^(LCM(p_i-1, i=1..k)/2), N)= +/-1 Special: when N is prime, Mod(cp^(N-1), N)=1 For example: In[3]:= FactorInteger[66855224152] Out[3]= {{2, 3}, {19, 1}, {1549, 1}, {283949, 1}} […]
