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

Revision as of 06:00, 28 July 2019

Latest revision as of 19:42, 23 April 2021

(3 intermediate revisions by 3 users not shown)

Line 1:

<includeonly>{{#ifeq:{{NAMESPACE}}|Talk|</includeonly>{{#ifeq:{{NAMESPACE}}|Template|[[Category:Passed DYK nominations from July 2019]]|}}<div style="background-color: #F3F9FF; margin: 2em 0 0 0; padding: 0 10px 0 10px; border: 1px solid #AAAAAA;">

{{DYKsubpage

:''The following is an archived discussion of the DYK nomination of the article below. <span style="color:red">'''Please do not modify this page.'''</span> Subsequent comments should be made on the appropriate discussion page (such as [[{{TALKPAGENAME}}|this nomination's talk page]], [[Talk:{{SUBPAGENAME}}|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'''.''

|monthyear=July 2019

|passed=<!--When closing discussion, enter yes, no, or withdrawn -->

The result was: '''promoted''' by [[User:Cwmhiraeth|Cwmhiraeth]] ([[User talk:Cwmhiraeth|talk]]) 06:18, 21 August 2019 (UTC)<br />

|2=

{{DYK conditions}}

{{DYK header|Berlekamp's root finding algorithm}}

{{DYK nompage links|nompage=Berlekamp's root finding algorithm|Berlekamp's root finding algorithm}}

* ... that the original article for '''[[Berlekamp's root finding algorithm|root finding algorithm]]''' did not contain validitya proof? of 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>

<!--

Please do not edit above this line unless you are a DYK volunteer who is closing the discussion.

-->

* ... that original article for '''[[Berlekamp's root finding algorithm|root finding algorithm]]''' did not contain validity proof? <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>

<!--

* {{DYKmake|Berlekamp's root finding algorithm|Adamant.pwn|subpage=Berlekamp's root finding algorithm}}

-->

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

{{DYK checklist

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

|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)

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