Talk:Cipolla's algorithm

From Rosetta Code
Revision as of 04:34, 26 March 2016 by Rdm (talk | contribs) (→‎Something seems to be missing here...: new section)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Something seems to be missing here...

We're supposed to solve x² ≡ n (mod p) but step 3 has us solving for ω given ω² in Fp². But if we could solve for ω given ω² in Fp² why do we need this algorithm? --Rdm (talk) 04:34, 26 March 2016 (UTC)