Talk:Berlekamp–Rabin algorithm
 | Berlekamp–Rabin algorithm is currently a Mathematics and mathematicians good article nominee. Nominated by Adamant.pwn (talk) at 22:54, 27 July 2019 (UTC) An editor has indicated a willingness to review the article in accordance with the good article criteria and will decide whether or not to list it as a good article. Comments are welcome from any editor who has not nominated or contributed significantly to this article. This review will be closed by the first reviewer. To add comments to this review, click discuss review and edit the page.
|
 | This article contains a translation of Метод Берлекэмпа from ru.wikipedia. |
- 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)
( )
- ... 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 |
|---|
| Policy: Article is sourced, neutral, and free of copyright problems |
|---|
|
| Hook: Hook has been verified by provided inline citation |
|---|
|
| QPQ: None required. |
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) | A fact from Berlekamp–Rabin algorithm appeared on Wikipedia's Main Page in the Did you know column on 24 August 2019 (check views). The text of the entry was as follows:
|  |