Talk:Berlekamp–Rabin algorithm: Difference between revisions

Content deleted Content added

Revision as of 10:02, 18 September 2024 edit DeadbeefBot (talk \| contribs) Bots 8,948 edits m implementing {{article history}} (BRFA) ← Previous edit		Latest revision as of 18:02, 24 March 2025 edit undo Tom.Reding (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, Template editors 4,364,437 edits m {{Translated page\|small=no}} under banners Tag: AWB
(2 intermediate revisions by one other user not shown)
Line 1: {{Translated page\|ru\|Метод Берлекэмпа\|version=101287786}}▼ {{Did you know nominations/Berlekamp's root finding algorithm}} {{Article history Line 14 ⟶ 13: {{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)