×

On a conjecture of the Euler numbers. (English) Zbl 1197.11027

Summary: The main purpose of this paper is to prove a conjecture of the Euler numbers and its generalization by using analytic methods. That is, for any prime \(p \equiv 1\pmod 4\) and integer \(\alpha\geq 1\) we prove \(E_{\varphi(p^{\alpha})/2}\not\equiv 0\pmod {p^{\alpha}}\), where \(E_{2n}\) are the Euler numbers and \(\varphi(n)\) the Euler function.

MSC:

11B68 Bernoulli and Euler numbers and polynomials
11A07 Congruences; primitive roots; residue systems
Full Text: DOI

References:

[1] Guy, R. K., Unsolved Problem in Number Theory (1994), Springer-Verlag: Springer-Verlag New York, p. 101 · Zbl 0805.11001
[2] Zhang, W., Some identities involving the Euler and the central factorial numbers, Fibonacci Quart., 36, 2, 154-157 (1998) · Zbl 0919.11018
[3] Lehmer, E., On congruences involving Bernoulli numbers and the quotients of Fermat and Wilson, Ann. of Math., 39, 350-360 (1938) · JFM 64.0095.04
[4] Liu, G., Identities and congruences involving higher-order Euler-Bernoulli numbers and polynomials, Fibonacci Quart., 39, 3, 279-284 (2001) · Zbl 0992.11021
[5] Liu, G., The solution of problem for Euler numbers, Acta Math. Sin., 47, 4, 825-828 (2004) · Zbl 1130.11308
[6] Apostol, T. M., Introduction to Analytic Number Theory (1976), Springer-Verlag: Springer-Verlag New York · Zbl 0335.10001
[7] Yuan, P., A conjecture on Euler numbers, Proc. Japan Acad. Ser. A, 80, 180-181 (2004) · Zbl 1080.11018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.