A search for primes p such that the Euler number E_p-3 is divisible by p

DOI10.1090/S0025-5718-2014-02814-7zbMATH Open1370.11036arXiv1212.3602OpenAlexW2907392022MaRDI QIDQ3189459FDOQ3189459

Authors: Romeo Meštrović 

Publication date: 10 September 2014

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

Abstract: Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with $gcd(xyz,p)=1$ if $$. Numerous combinatorial congruences recently obtained by Z.-W. Sun and by Z.-H. Sun involve the Euler numbers $E_{p-3}$. This gives a new significance to the primes $p$ for which $$. For the computation of residues of Euler numbers $E_{p-3}$ modulo a prime $p$, we use the congruence which runs significantly faster than other known congruences involving $E_{p-3}$. Applying this congruence, a computation via { t Mathematica 8} shows that only three primes less than $10^7$ satisfy the condition $$ (such primes are 149, 241 and 2946901, and they are given as a Sloane's sequence A198245). By using related computational results and statistical considerations similar to those on search for Wieferich and Fibonacci-Wieferich and Wolstenholme primes, we conjecture that there are infinitely many primes $p$ such that $$. Moreover, we propose a conjecture on the asymptotic estimate of number of primes $p$ in an interval $[x,y]$ such that $$ for some integer $A$ with $|A|in[K,L]$.

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

Recommendations

• On a congruence of Emma Lehmer related to Euler numbers
• A conjecture on Euler numbers
• On a congruence of the Euler numbers
• Some congruences involving Euler numbers
• On a conjecture of the Euler numbers

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Super congruences and Euler numbers
• Series associated with the zeta and related functions
• On congruences related to central binomial coefficients
• Irregular primes to 163 million
• On Delannoy numbers and Schröder numbers
• A search for Wieferich and Wilson primes
• Congruences concerning Bernoulli numbers and Bernoulli polynomials
• Congruences involving Bernoulli and Euler numbers
• Title not available (Why is that?)
• On the 𝑝-divisibility of Fermat quotients
• Title not available (Why is that?)
• A search for Fibonacci-Wieferich and Wolstenholme primes
• On the converse of Wolstenholme's Theorem
• Binomial coefficients, Catalan numbers and Lucas quotients
• A Wieferich prime search up to \(6.7 \times 10^{15}\)
• Eulersche Zahlen und großer Fermatscher Satz
• Fibonacci numbers and Fermat's last theorem
• Note on Euler Number Criteria for the First Case of Fermat's Last Theorem
• Note on Irregular Primes
• On congruences involving Bernoulli numbers and the quotients of Fermat and Wilson
• Cyclotomic Invariants and E-Irregular Primes

Cited In (2)

• On the \(p\)-adic valuation of generalized harmonic numbers
• Wolstenholme and Vandiver primes

Uses Software

• OEIS

This page was built for publication: A search for primes \(p\) such that the Euler number \(E_{p-3}\) is divisible by \(p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189459)