A Wieferich prime search up to 6.7 10¹⁵
zbMATH Open1278.11003MaRDI QIDQ3100152FDOQ3100152
Authors: François G. Dorais, Dominic Klyve 
Publication date: 22 November 2011
Full work available at URL: http://www.emis.de/journals/JIS/VOL14/Klyve/klyve3.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- The continuing search for Wieferich primes
- A new prime \(p\) for which the least primitive root \(\pmod p\) and the least primitive root \(\pmod {p^2}\) are not equal
- A search for Wieferich and Wilson primes
- Search for Wieferich primes through the use of periodic binary strings
- A search for Fibonacci-Wieferich and Wolstenholme primes
Wieferich primewheel sieveFibonacci-Wieferich primemagic sieveMontgomery arithmeticWall-Sun-Sun prime
Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Primality (11Y11) Software, source code, etc. for problems pertaining to number theory (11-04)
Cited In (29)
- Irregular primes with respect to Genocchi numbers and Artin's primitive root conjecture
- Title not available (Why is that?)
- Indices of subfields of cyclotomic \({\mathbb Z}_p\)-extensions and higher degree Fermat quotients
- The largest known Wieferich numbers
- Fibonacci numbers and real quadratic \(p\)-rational fields
- New generalized cyclotomic binary sequences of period \(p^2\)
- Strong pseudoprimes to twelve prime bases
- Title not available (Why is that?)
- Complexities of self-dual normal bases
- Strong pseudoprimes to the first eight prime bases
- On Tribonacci-Wieferich primes
- Extremal values for the sum \(\sum^\tau_{r=1} e(a2^r/q)\)
- The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
- Search for Wieferich primes through the use of periodic binary strings
- Prime power divisors of Mersenne numbers and Wieferich primes of higher order
- A search for primes \(p\) such that the Euler number \(E_{p-3}\) is divisible by \(p\)
- Lucas sequences and quadratic orders
- Optimal conflict-avoiding codes of odd length and weight three
- The continuing search for Wieferich primes
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Divisibility and arithmetic properties of a class of sparse polynomials
- On Wieferich and non-Wieferich primes with prime bases
- A search for Fibonacci-Wieferich and Wolstenholme primes
- Title not available (Why is that?)
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
- Infinitely many twin prime polynomials of odd degree
- The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
- Nonexistence of two classes of generalized bent functions
- A new series of optimal tight conflict-avoiding codes of weight 3
Uses Software
This page was built for publication: A Wieferich prime search up to \(6.7 \times 10^{15}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100152)
