A search for primes 𝑝 such that the Euler number 𝐸_{𝑝-3} is divisible by 𝑝

DOI10.1090/S0025-5718-2014-02814-7zbMath1370.11036arXiv1212.3602OpenAlexW2907392022MaRDI QIDQ3189459

Romeo Meštrović

Publication date: 10 September 2014

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

Full work available at URL: https://arxiv.org/abs/1212.3602

zbMATH Keywords

Euler numberFermat quotientsupercongruence\(E_{p-3}\)congruence modulo a prime

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65) Bernoulli and Euler numbers and polynomials (11B68) Congruences; primitive roots; residue systems (11A07)

Related Items (2)

Wolstenholme and Vandiver primes ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binomial coefficients, Catalan numbers and Lucas quotients
• On congruences related to central binomial coefficients
• On Delannoy numbers and Schröder numbers
• Congruences concerning Bernoulli numbers and Bernoulli polynomials
• Super congruences and Euler numbers
• Congruences involving Bernoulli and Euler numbers
• On congruences involving Bernoulli numbers and the quotients of Fermat and Wilson
• Eulersche Zahlen und großer Fermatscher Satz
• Irregular primes to 163 million
• A search for Fibonacci-Wieferich and Wolstenholme primes
• Cyclotomic Invariants and E-Irregular Primes
• On the 𝑝-divisibility of Fermat quotients
• On the converse of Wolstenholme's Theorem
• Fibonacci numbers and Fermat's last theorem
• A search for Wieferich and Wilson primes
• Note on Euler Number Criteria for the First Case of Fermat's Last Theorem
• Note on Irregular Primes

This page was built for publication: A search for primes 𝑝 such that the Euler number 𝐸_{𝑝-3} is divisible by 𝑝