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

The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.

The result was: promoted by Cwmhiraeth (talk) 06:18, 21 August 2019 (UTC)

Berlekamp's root finding algorithm

(

• Back to T:TDYK
• Article history

)

• ... that the original article for Berlekamp's root finding algorithm did not contain a proof of correctness? Source: "The article [3] does not contain a proof for the validity of this algorithm" (Probabilistic Algorithms in Finite Fields)

Created/expanded by Adamant.pwn (talk). Self-nominated at 05:59, 28 July 2019 (UTC).

General: Article is new enough and long enough
New enough: Long enough:

Policy: Article is sourced, neutral, and free of copyright problems
Adequate sourcing: Neutral: Free of copyright violations, plagiarism, and close paraphrasing:

Hook: Hook has been verified by provided inline citation
Cited: - Offline/paywalled citation accepted in good faith Interesting:

QPQ: None required.

Overall: I've reworded the hook a bit, but it should now be good to go! — Bilorv (he/him) _(talk) 10:54, 28 July 2019 (UTC)