- 78D4C49FFCA81897F9E4832F272A46DF2DD8258BCD4502FFF7C716E4D8B7E67F5C96AEA13E193D44374FFADC7BF3487AE14C512257875D95C3414FD37C69F03A
+ 690ACDD6451FC4E1C2263CA60E7240357C5438334C009521A1E32F12BBFB02370B9E68F6B66C00470A5BF440CA80827F82E090A5F72D447877542E6D9C09C7B8
ffa/libffa/fz_prime.adb
(194 . 7)(194 . 7)
1139 -- Generate Barrettoid(X) to use in all of the modulo-X operations:
1140 FZ_Make_Barrettoid(Modulus => X, Result => XBar);
1141
1142 -- Find R >= 1, and odd K, where X − 1 = 2^R * K :
1143 -- Find R >= 1, and odd K, where X - 1 = 2^R * K :
1144
1145 -- ... first, find R, the largest power of two which divides X - 1 :
1146 R := FZ_Count_Bottom_Zeros(X_Minus_One);