General -product function.
Loveless, Andrew D. (2006)
Integers
Similarity:
Loveless, Andrew D. (2006)
Integers
Similarity:
Kühleitner, Manfred (1998)
Mathematica Pannonica
Similarity:
Broughan, Kevin A. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Bordellès, Olivier (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Zhang, Deyu, Zhai, Wenguang (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Ekkehard Krätzel, Werner Nowak, László Tóth (2012)
Open Mathematics
Similarity:
The paper deals with asymptotics for a class of arithmetic functions which describe the value distribution of the greatest-common-divisor function. Typically, they are generated by a Dirichlet series whose analytic behavior is determined by the factor ζ2(s)ζ(2s − 1). Furthermore, multivariate generalizations are considered.
Tóth, László (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Manfred Kühleitner, Werner Nowak (2013)
Open Mathematics
Similarity:
The paper deals with lower bounds for the remainder term in asymptotics for a certain class of arithmetic functions. Typically, these are generated by a Dirichlet series of the form ζ 2(s)ζ(2s−1)ζ M(2s)H(s), where M is an arbitrary integer and H(s) has an Euler product which converges absolutely for R s > σ0, with some fixed σ0 < 1/2.
Keiju Sono (2014)
Open Mathematics
Similarity:
In this paper, we give certain upper bounds for the 2k-th moments, k ≥ 1/2, of derivatives of Dirichlet L-functions at s = 1/2 under the assumption of the Generalized Riemann Hypothesis.
Ledoan, A.H., Zaharescu, A. (2010)
Integers
Similarity:
Goldston, D. A., Yıldırım, C. Y. (2003)
Integers
Similarity:
Manfred Kühleitner, Werner Nowak (2006)
Open Mathematics
Similarity:
The arithmetic function ρ(n) counts the number of ways to write a positive integer n as a difference of two squares. Its average size is described by the Dirichlet summatory function Σn≤x ρ(n), and in particular by the error term R(x) in the corresponding asymptotics. This article provides a sharp lower bound as well as two mean-square results for R(x), which illustrates the close connection between ρ(n) and the number-of-divisors function d(n).