Generalized Rational Zeta Series for $\Zeta (2N) $ and $\Zeta (2N+ 1) $
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Generalized Rational Zeta Series with Two Parameters
Background Main results Extensions Generalized Rational Zeta Series with Two Parameters Derek Orr, University of Pittsburgh Algebra Research Seminar - University of Pittsburgh February 9, 2017 Derek Orr, University of Pittsburgh Generalized Rational Zeta Series with Two Parameters P That is, they are of the form qnζ(n; m) where qn 2 Q and ζ(n; m) is the Hurwitz zeta function, dened by 1 X 1 ζ(n; m) = : (m + k)n k=0 It can be shown that any real number can be written as a rational zeta series. Examples: 1 1 X X ζ(n) − 1 [ζ(n) − 1] = 1; = 1 − γ n n=2 n=2 n X 1 where γ = lim − log(n) is the Euler-Mascheroni n!1 1 k constant. k= Background Rational Zeta Series Main results Zeta and Beta function Extensions Clausen function A rational zeta series is a series consisting of rational numbers and either the Hurwitz zeta function or the Riemann zeta function. Derek Orr, University of Pittsburgh Generalized Rational Zeta Series with Two Parameters It can be shown that any real number can be written as a rational zeta series. Examples: 1 1 X X ζ(n) − 1 [ζ(n) − 1] = 1; = 1 − γ n n=2 n=2 n X 1 where γ = lim − log(n) is the Euler-Mascheroni n!1 1 k constant. k= Background Rational Zeta Series Main results Zeta and Beta function Extensions Clausen function A rational zeta series is a series consisting of rational numbers and either the Hurwitz zeta function or the Riemann zeta function. -
Computational Strategies for the Riemann Zeta Function Jonathan M
Journal of Computational and Applied Mathematics 121 (2000) 247–296 www.elsevier.nl/locate/cam Computational strategies for the Riemann zeta function Jonathan M. Borweina;∗, David M. Bradleyb, Richard E. Crandallc aCentre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, BC, Canada V5A 1S6 bDepartment of Mathematics and Statistics, University of Maine, 5752 Neville Hall, Orono, ME 04469-5752, USA cCenter for Advanced Computation, Reed College, Portland, OR, 97202, USA Received 30 December 1999; received in revised form 14 January 2000 Abstract We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of the argument, the desired speed of computation, and the incidence of what we call “value recycling”. c 2000 Elsevier Science B.V. All rights reserved. 1. Motivation for ecient evaluation schemes It was, of course, a profound discovery of Riemann that a function so superbly exploited by Euler, namely X∞ 1 Y (s)= = (1 − p−s)−1 (1) ns n=1 p prime could be interpreted – to great advantage – for general complex s-values. Sum (1) deÿnes the Riemann zeta function in the half-plane of absolute convergence R (s) ¿ 1, and in the entire complex plane (except for the pole at s = 1) by analytic continuation. The purpose of the present treatise is to provide an overview of both old and new methods for evaluating (s). Starting with Riemann himself, algorithms for evaluating (s) have been discovered over the ensuing century and a half, and are still being developed in earnest. -
Unified Algorithms for Polylogarithm, L-Series, and Zeta Variants
Also available in a new collection from PSIpress, Algorithmic reflections: Selected works 1 Unified algorithms for polylogarithm, L-series, and zeta variants Richard E. Crandall1 March 26, 2012 In memory of gentle colleague Jerry Keiper 1953-1995 Abstract: We describe a general computational scheme for evaluation of a wide class of number-theoretical functions. We avoid asymptotic expansions in favor of manifestly convergent series that lend themselves naturally to rigorous error bounds. By employing three fundamental series algorithms we achieve a unified strategy to compute the various functions via parameter selection. This work amounts to a compendium of methods to establish extreme-precision results as typify modern experimental mathematics. A fortu- itous byproduct of this unified approach is automatic analytic continuation over complex parameters. Another byproduct is a host of converging series for various fundamental constants. 1Center for Advanced Computation, Reed College. [email protected] Also available in a new collection from PSIpress, Algorithmic reflections: Selected works 2 Contents 1 Motivation 4 1.1 Acknowledgements and disclaimer . 5 2 Representations of the Lerch transcendent 5 2.1 Bernoulli-series representation of Lerch Φ . 7 2.2 Bernoulli multisectioning . 10 2.3 Erd´elyi-seriesrepresentation for Lerch Φ . 10 2.4 Riemann-splitting representation for Lerch variant Φ . 11 3 Riemann zeta function 14 3.1 Riemann{Siegel formula and Dirichlet L-functions . 14 3.2 Riemann-zeta derivatives . 15 3.3 Gamma- and incomplete-gamma calculus . 16 3.4 Γ and its derivatives . 16 3.5 Incomplete gamma and its outer derivatives . 17 3.6 Stark{Keiper and other \summation form" strategies . -
Music of the Primes in Search of Order
Music of the Primes In Search of Order PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Wed, 19 Jan 2011 04:12:59 UTC Contents Articles Prime number theorem 1 Riemann hypothesis 9 Riemann zeta function 30 Balanced prime 40 Bell number 41 Carol number 46 Centered decagonal number 47 Centered heptagonal number 48 Centered square number 49 Centered triangular number 51 Chen prime 52 Circular prime 53 Cousin prime 54 Cuban prime 55 Cullen number 56 Dihedral prime 57 Dirichlet's theorem on arithmetic progressions 58 Double factorial 61 Double Mersenne prime 75 Eisenstein prime 76 Emirp 78 Euclid number 78 Even number 79 Factorial prime 82 Fermat number 83 Fibonacci prime 90 Fortunate prime 91 Full reptend prime 92 Gaussian integer 94 Genocchi number 97 Goldbach's conjecture 98 Good prime 102 Happy number 103 Higgs prime 108 Highly cototient number 109 Illegal prime 110 Irregular prime 113 Kynea number 114 Leyland number 115 List of prime numbers 116 Lucas number 131 Lucky number 133 Markov number 135 Mersenne prime 137 Mills' constant 145 Minimal prime (recreational mathematics) 146 Motzkin number 147 Newman–Shanks–Williams prime 149 Odd number 150 Padovan sequence 153 Palindromic prime 157 Partition (number theory) 158 Pell number 166 Permutable prime 174 Perrin number 175 Pierpont prime 178 Pillai prime 179 Prime gap 180 Prime quadruplet 185 Prime triplet 187 Prime-counting function 188 Primeval prime 194 Primorial prime 196 Probable prime 197 Proth number 198 Pseudoprime