Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-23T10:29:58.793Z Has data issue: false hasContentIssue false
  • English
  • Français

SOME REMARKS ON THE RIEMANN ZETA FUNCTION AND PRIME FACTORS OF NUMERATORS OF BERNOULLI NUMBERS

Part of: Sequences and sets

Published online by Cambridge University Press:  12 December 2011

FLORIAN LUCA  and
AMALIA PIZARRO-MADARIAGA
FLORIAN LUCA*
Affiliation:
Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089, Morelia, Michoacán, México (email: [email protected])
AMALIA PIZARRO-MADARIAGA
Affiliation:
Departamento de Matemáticas, Universidad de Valparaiso, Chile (email: [email protected])
*
✉For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We prove that the sequence {log ζ(n)}n≥2 is not holonomic, that is, does not satisfy a finite recurrence relation with polynomial coefficients. A similar result holds for L-functions. We then prove a result concerning the number of distinct prime factors of the sequence of numerators of even indexed Bernoulli numbers.

Keywords

Riemann zeta functionnonholonomicityprimesBernoulli numbers

MSC classification

Secondary: 11B68: Bernoulli and Euler numbers and polynomials
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 86 , Issue 2 , October 2012 , pp. 216 - 223
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2011

Footnotes

F. L. was supported in part by project SEP-CONACyT 79685. A. P. was supported in part by project Fondecyt No. 11100260.

References

[1]Ball, K. and Rivoal, T., ‘Irrationalité d’une infinité de valeurs de la fonction zeta aux entiers impairs’, Invent. Math. 146 (2001), 193–207.CrossRefGoogle Scholar
[2]Bell, J. P., Gerhold, S., Klazar, M. and Luca, F., ‘Non-holonomicity of sequences defined via elementary functions’, Ann. Comb. 12 (2008), 1–16.CrossRefGoogle Scholar
[3]Bugeaud, Y., Mignotte, M. and Siksek, S., ‘Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers’, Ann. of Math. (2) 163 (2006), 969–1018.CrossRefGoogle Scholar
[4]Halberstam, H. and Richert, H.-E., Sieve Methods (Academic Press, London, 1974).Google Scholar
[5]Matveev, E. M., ‘An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II’, Izv. Ross. Akad. Nauk Ser. Mat. 64 (2000), 125–180 English translation Izv. Math. 64 (2000), 1217–1269.Google Scholar