3 Congruence
... During the course of the proof of theorem 3.10 , we proved the following useful result. Theorem 3.12 If ab ≡ ac mod n and if gcd(a, n) = 1, then we have b ≡ c mod n. In short, we can cancel the factor a from both sides of the congruence so long as gcd(a, n) = 1. In algebra, we learn that we “can div ...
... During the course of the proof of theorem 3.10 , we proved the following useful result. Theorem 3.12 If ab ≡ ac mod n and if gcd(a, n) = 1, then we have b ≡ c mod n. In short, we can cancel the factor a from both sides of the congruence so long as gcd(a, n) = 1. In algebra, we learn that we “can div ...
The Yellowstone permutation
... fC (n) defined implicitly by (9) is on the order of 5 n for n ≤ 107 . To summarize, our estimates for the curves fE (x) and fC (x) containing the terms of types E and C are given by (5) and (9). Equations (6) and (10) have a simpler form but are less precise. The primes lie on the curve fp (x) = 12 ...
... fC (n) defined implicitly by (9) is on the order of 5 n for n ≤ 107 . To summarize, our estimates for the curves fE (x) and fC (x) containing the terms of types E and C are given by (5) and (9). Equations (6) and (10) have a simpler form but are less precise. The primes lie on the curve fp (x) = 12 ...
