Template:Did you know nominations/Berlekamp's root finding algorithm: Difference between revisions

Revision as of 07:02, 28 July 2019

Revision as of 10:55, 28 July 2019

Line 11:

-->

* ... that the original article for '''[[Berlekamp's root finding algorithm|root finding algorithm]]''' did not contain a validityproof proofof correctness? <small>Source: "The article [3] does not contain a proof for the validity of this algorithm" ([https://epubs.siam.org/doi/10.1137/0209024 Probabilistic Algorithms in Finite Fields])</small>

:*

<small>Created/expanded by [[User:Adamant.pwn|Adamant.pwn]] ([[User talk:Adamant.pwn|talk]]). Self-nominated at 05:59, 28 July 2019 (UTC).</small>

Line 18:

-->

{{DYK checklist

:* <!-- REPLACE THIS LINE TO WRITE FIRST COMMENT, KEEPING :* -->

|newness = y

|length = y

|eligibilityother =

|sourced = y

|neutral = y

|plagiarismfree = y

|policyother =

|hookcited = AGF

|hookinterest = y

|hookother =

|picfree = NA

|picused =

|picclear =

|qpq = NA

|status = y

|comments = I've reworded the hook a bit, but it should now be good to go!

|sign = <span class="nowrap">— '''[[User:Bilorv|Bilorv]]''' (he/him) _{[[User talk:Bilorv|('''talk''')]]}</span> 10:54, 28 July 2019 (UTC)

}}

}}<!--Please do not write below this line or remove this line. Place comments above this line.-->