A search for Wieferich and Wilson primes

From MaRDI portal
Revision as of 04:33, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5691023

DOI10.1090/S0025-5718-97-00791-6zbMath0854.11002OpenAlexW2041816918WikidataQ55966815 ScholiaQ55966815MaRDI QIDQ5691023

Karl Dilcher, Richard E. Crandall, Carl B. Pomerance

Publication date: 9 January 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00791-6




Related Items (55)

Trace representation and linear complexity of binary sequences derived from Fermat quotientsNested Squares and Evaluations of Integer ProductsOn the k-error linear complexity of binary sequences derived from polynomial quotientsPrime divisors of sparse values of cyclotomic polynomials and Wieferich primesMac Lane (co)homology of the second kind and Wieferich primesPseudoprimality related to the generalized Lucas sequencesA search for primes 𝑝 such that the Euler number 𝐸_{𝑝-3} is divisible by 𝑝A search for Wilson primesAn extension of binary threshold sequences from Fermat quotientsFermat quotients for composite moduliUnnamed ItemCongruences involving the Fermat quotientON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ONGalois module structure and Jacobians of Fermat curvesTrace representation of pseudorandom binary sequences derived from Euler quotientsA NOTE ON GENERALISED WALL–SUN–SUN PRIMESGENERALIZED WALL-SUN-SUN PRIMES AND MONOGENIC POWER-COMPOSITIONAL TRINOMIALSA new condition for \(k\)-Wall-Sun-Sun primesFast tabulation of challenge pseudoprimesOn Wieferich and non-Wieferich primes with prime basesOn the linear complexity of binary threshold sequences derived from Fermat quotientsUnnamed ItemOn the 𝑝-divisibility of Fermat quotientsOn the divisibility of Fermat quotientsOn some new arithmetic properties of the generalized Lucas sequencesComputer verification of the Ankeny--Artin--Chowla Conjecture for all primes less than $100000000000$Elliptic Wieferich primesUnnamed ItemBits of \(3^n\) in binary, Wieferich primes and a conjecture of ErdősProbabilistic study of Fermats quotientsOn Fibonacci and Lucas sequences modulo a prime and primality testingWilson quotients for composite moduliSolutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})Estimates for Wieferich numbersOn the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$Witt vectors and Fermat quotientsSearching for a counterexample to Kurepa’s conjectureAround Pelikán's conjecture on very odd sequencesNew congruences for central binomial coefficientsThe continuing search for Wieferich primesAbout a decomposition of the group \(\mathbb Z_{pq}\), where \(p\) and \(q\) are distinct odd primesA search for Fibonacci-Wieferich and Wolstenholme primesA new prime $p$ for which the least primitive root $({\rm mod} p)$ and the least primitive root $({\rm mod} p^2)$ are not equalCriteria for testing Wall’s questionTHE MULTIPLICATIVE ORDERS OF CERTAIN GAUSS FACTORIALSOn the solvability of regular subgroups in the holomorph of a finite solvable groupABC implies there are infinitely many non-Fibonacci-Wieferich primesA family of Markov shifts (almost) classified by periodic pointsWieferich pairs and Barker sequencesPeriodic points classify a family of Markov shiftsVALEURS IMPAIRES DE LA FONCTION DE PARTITION p(n)Congruences for Wolstenholme primesOn the rapid computation of various polylogarithmic constantsFaster deterministic integer factorizationAdditive character sums of polynomial quotients




Cites Work




This page was built for publication: A search for Wieferich and Wilson primes