Talk:Cipolla's algorithm

From Rosetta Code
Revision as of 08:56, 26 March 2016 by rosettacode>G.Brougnard (value of ω)

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)

Precision added to step 3 . The result is x + 0 * ω in Fp2 , that is x in Fp. The 'value' of ω is not needed.Same thing : we do'nt need the 'value' of i when dealing with complex numbers. Thx. --G.Brougnard (talk) 08:56, 26 March 2016 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:Cipolla%27s_algorithm?oldid=266533"