Content deleted Content added
maths rating|class=C|priority=low |
Tom.Reding (talk | contribs) m {{Translated page|small=no}} under banners |
||
(5 intermediate revisions by 4 users not shown) | |||
Line 1:
{{FailedGA|19:32, 22 September 2019 (UTC)|topic=Mathematics and mathematicians|page=1}}▼
{{maths rating|class=C|priority=low}}▼
{{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}}{{WikiProject banner shell|class=}}▼
|action1=GAN
|action1date=19:32, 22 September 2019 (UTC)
|action1link=/GA1
|action1result=failed
|currentstatus=FGAN
▲
}}
{{WikiProject banner shell|class=C|
}}
▲{{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)
|