A search for c-Wieferich primes
Alex Samuel Bamunoba, Jonas Bergstr\"om

TL;DR
This paper investigates c-Wieferich primes over finite fields, providing an existence criterion and an algorithm for their computation, and explores their behavior in polynomial extensions.
Contribution
It introduces a new criterion and algorithm for identifying c-Wieferich primes in finite field polynomial rings and analyzes their properties in extensions.
Findings
Established an existence criterion for c-Wieferich primes.
Developed an algorithm for computing these primes.
Studied their behavior in finite field extensions.
Abstract
Let be a power of a prime number , be a finite field with elements and be a subgroup of of order . We give an existence criterion and an algorithm for computing maximally -fixed c-Wieferich primes in . Using the criterion, we study how c-Wieferich primes behave in extensions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
