set N = 6700417;
set a = 5;
A1:
5 |^ 1,5 are_congruent_mod 6700417
by INT_1:11;
A2:
5 |^ 2,25 are_congruent_mod 6700417
A3:
5 |^ 4,625 are_congruent_mod 6700417
A4:
5 |^ 8,390625 are_congruent_mod 6700417
A5:
5 |^ 16,5994701 are_congruent_mod 6700417
A6:
5 |^ 32,6477880 are_congruent_mod 6700417
A7:
5 |^ 64,6634739 are_congruent_mod 6700417
A8:
5 |^ 128,5231553 are_congruent_mod 6700417
A9:
5 |^ 256,374828 are_congruent_mod 6700417
A10:
5 |^ 512,1685928 are_congruent_mod 6700417
A11:
5 |^ 1024,2827699 are_congruent_mod 6700417
A12:
5 |^ 2048,6011821 are_congruent_mod 6700417
A13:
5 |^ 4096,2741794 are_congruent_mod 6700417
A14:
5 |^ 8192,1991541 are_congruent_mod 6700417
A15:
5 |^ 16384,4116535 are_congruent_mod 6700417
A16:
5 |^ 32768,3281950 are_congruent_mod 6700417
A17:
5 |^ 65536,757903 are_congruent_mod 6700417
A18:
5 |^ 131072,3608833 are_congruent_mod 6700417
A19:
5 |^ 262144,1394402 are_congruent_mod 6700417
A20:
5 |^ 524288,3130876 are_congruent_mod 6700417
A21:
5 |^ 1048576,2776809 are_congruent_mod 6700417
A22:
5 |^ 2097152,2549723 are_congruent_mod 6700417
A23:
5 |^ 4194304,1082062 are_congruent_mod 6700417
A24:
5 |^ 384,1909498 are_congruent_mod 6700417
A25:
5 |^ 1408,1448571 are_congruent_mod 6700417
A26:
5 |^ 3456,4182057 are_congruent_mod 6700417
A27:
5 |^ 7552,2283579 are_congruent_mod 6700417
A28:
5 |^ 15744,170659 are_congruent_mod 6700417
A29:
5 |^ 146816,4301975 are_congruent_mod 6700417
A30:
5 |^ 408960,216360 are_congruent_mod 6700417
A31:
5 |^ 2506112,6036253 are_congruent_mod 6700417
A32:
5 |^ 6700416,1 are_congruent_mod 6700417
A33:
1909497 gcd 6700417 = 1
reconsider n = 6700417 as 2 _greater Nat by NAT_6:def 1;
17449 divides n - 1
then reconsider s = 17449 as Divisor of n - 1 by NAT_6:def 2;
reconsider s = s as non trivial Divisor of n - 1 by NAT_2:def 1;
A36:
s > sqrt n
hence
6700417 is prime
by A36, A32, NAT_6:21; verum