Revision as of 10:02, 18 September 2024 edit DeadbeefBot (talk \| contribs) Bots 8,948 edits m implementing {{article history}} (BRFA) ← Previous edit		Revision as of 09:42, 18 January 2025 edit undo 2a01:e0a:401:a7c0:9d9:50bb:6262:e787 (talk) →In step details, what happens if the modulus isn’t a prime power ?: new section Tag: New topic Next edit →
Line 16: {{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 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)

Talk:Berlekamp–Rabin algorithm: Difference between revisions