Talk:Berlekamp–Rabin algorithm: Difference between revisions

Content deleted Content added
m template format
m {{Translated page|small=no}} under banners
 
(10 intermediate revisions by 9 users not shown)
Line 1:
{{GA nominee|22:54, 27 July 2019 (UTC)|nominator=[[User:Adamant.pwn|Adamant.pwn]] ([[User talk:Adamant.pwn|talk]])|page=1|subtopic=Mathematics and mathematicians|status=onhold|note=}}
{{Translated page|ru|Метод Берлекэмпа|version=101287786}}
{{Did you know nominations/Berlekamp's root finding algorithm}}
{{Article history
{{DYK talk|24 August|2019|entry= ... that the original article describing '''[[Berlekamp's root finding algorithm]]''' did not contain a [[Correctness (computer science)|proof of correctness]]?|nompage=Template:Did you know nominations/Berlekamp's root finding algorithm}}
|action1=GAN
|action1date=19:32, 22 September 2019 (UTC)
|action1link=/GA1
|action1result=failed
 
|currentstatus=FGAN
{{DYK talk|dykdate=24 August| 2019|entrydykentry= ... that the original article describing '''[[Berlekamp's root finding algorithm]]''' did not contain a [[Correctness (computer science)|proof of correctness]]?|nompagedyknom=Template:Did you know nominations/Berlekamp's root finding algorithm}}
|topic=Mathematics and mathematicians
}}
{{WikiProject banner shell|class=C|
{{WikiProject Mathematics|priority=low}}
}}
{{Translated page|ru|Метод Берлекэмпа|version=101287786|small=no}}
 
{{Talk:Berlekamp's root finding algorithm/GA1}}
 
== In step details, what happens if the modulus isn’t a prime power ? ==
 
Stupid question, but beside it doesn’t work, what happens in details if the modulus isn’t a prime power nor a prime ? [[Special:Contributions/2A01:E0A:401:A7C0:9D9:50BB:6262:E787|2A01:E0A:401:A7C0:9D9:50BB:6262:E787]] ([[User talk:2A01:E0A:401:A7C0:9D9:50BB:6262:E787|talk]]) 09:42, 18 January 2025 (UTC)