Talk:Cipolla's algorithm: Difference between revisions

No edit summary
Line 68:
::::::::::: No working implementation ... I agree :-) --[[User:G.Brougnard|G.Brougnard]] ([[User talk:G.Brougnard|talk]]) 17:20, 27 March 2016 (UTC)
 
== Delete this task? (edit: looks like no, just need to better describe the algorithm) ==
 
Since this is a bogus algorithm, should we delete this task?
Line 105:
 
:::::: For sure ω , which is '''not''' in Fp, violates the rules on Fp, this is the aim of the game . How ω , which defines Fp2 , constructs Fp2 , is the soul of Fp2 cannot be in Fp2 ? Remember , Fp2 is the set { x + y ω } . Make x =0, y=1 and you will find ω in Fp2. And , I agree with you, ω² remains a valid value in both, which is quite useful.
 
::::::: Looking at your algorithm, you do not use ω in Fp2. You only use ω². In other words, while the math may be bogus, that just means that it does not adequately describe the algorithm. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 18:08, 28 March 2016 (UTC)
 
::::::: In our p=13 Fp world, the square roots of -6, or 7 simply do not exist. And - I never said it is the same - it is an analogy i feel useful to try to understand things , the square root of -1 do not exists either (in R) . --[[User:G.Brougnard|G.Brougnard]] ([[User talk:G.Brougnard|talk]]) 16:43, 28 March 2016 (UTC)
6,951

edits