You are viewing a single comment's thread. Return to all comments →
Having implemented generic quadratic congruence solver (Tonelli-Shanks algorithm) is very helpful in this task.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #216: Investigating the primality of numbers of the form 2n² - 1
You are viewing a single comment's thread. Return to all comments →
Having implemented generic quadratic congruence solver (Tonelli-Shanks algorithm) is very helpful in this task.