All theorems, corollaries, and definitions listed in the book's order:
I will only use theorems or facts that are proved before this question. So you will not see that I quote theorems or facts from the later chapters.
Find a prime divisor of the integer $N = 4(3 \cdot 7 \cdot 11) - 1$ of the form $4n + 3$. Do the same for $N = 4(3 \cdot 7 \cdot 11 \cdot 15) - 1$.
(I wrote a program for this question)
For $N = 4(3 \cdot 7 \cdot 11) - 1 = 923$:
The rest is for paying subscribers only (7 days free trial)Subscribe
Already have an account? Log in