Introduction on Bernoulli s numbers
|
|
- Gregory Grant Stephens
- 5 years ago
- Views:
Transcription
1 Introduction on Bernoulli s numbers Pascal Sebah and Xavier Gourdon numbers.computation.free.fr/constants/constants.html June 2, 2002 Abstract This essay is a general and elementary overview of some of the properties of the famous numbers introduced by Bernoulli and used by Euler to express the value of the zeta function at integer even values. Introduction Bernoulli s numbers play an important and quite mysterious role in mathematics and in various places like analysis, number theory and differential topology. They first appeared in Ars Conjectandi, page 97, a famous (and posthumous) treatise published in 73, by Jakob Bernoulli ( ) when he studied the sums of powers of consecutive integers n s p (n) = k p, () where p and n are two given positive integers. Bernoulli s numbers also appear in the computation of the numbers ζ(2p) = k 2p and in the expansion of many usual functions as tan(x), tanh(x), / sin(x), Perhaps one of the most important result is Euler-Maclaurin summation formula, where Bernoulli s numbers are contained and which allows to accelerate the computation of slow converging series (see the essay on Euler s constant at [9]). They also appear in numbers theory (Fermat s theorem) and in many other domains and have caused the creation of a huge literature (see the 2700 and more entries enumerated in [6]). According to Louis Saalschültz [7], the term Bernoulli s numbers was used for the first time by Abraham De Moivre ( ) and also by Leonhard Euler ( ) in 755.
2 2 Bernoulli s approach During the first years of the Calculus period and in its first integral computations of the function x x p, Pierre de Fermat (60-665) in 636 had to evaluate the sums s p (n) defined by (). You can see this by replacing the area under the curve x x p by it s rectangular approximations and naturally comes the need to compute s p (n). Also in 63, Johann Faulhaber ( ) developed explicit formulas for these sums up to p = 7 (read the excellent [2] for the beginnings of integration and [8] for some excerpts of Bernoulli s work). Thus, it was already known to Jakob Bernoulli that s 0 (n) = n s (n) = 2 n2 n(n ) n = 2 2 s 2 (n) = 3 n3 2 n2 + n(n )(2n ) n = 6 6 s 3 (n) = 4 n4 2 n3 + 4 n2 = n2 (n ) 2 s 4 (n) = 5 n5 2 n4 + 3 n3 30 n = n(n )(2n )(3n2 3n ) 30 s 5 (n) = 6 n6 2 n n4 2 n2 = n2 (2n 2 2n )(n ) Jakob Bernoulli then, empirically, noticed that the polynomials s p (n) have the form s p (n) = p + np+ 2 np + p 2 np + 0 n p In this expression, the numbers (, /2, /2, 0,...) are appearing and do not depend on p. More generally, the sums s p (n) can be written in the form 4 s p (n) = p = B 0 0! B k k! p! (p + k)! np+ k n p+ p + + B! np + B 2 2! pnp + B 3 3! p(p )np B p! n where the B k are numbers which are independent of p and called Bernoulli s numbers. We find by identification B 0 =, B = 2, B 2 = 6, B 3 = 0,... To illustrate the usefulness of his formula, Bernoulli computed the astonishing value of s 0 (000) with little effort (in less than half a quarter of an hour 2
3 he says... [8]) (you can check it!). To achieve this he needed to find B 0 up to B 0. There is good evidence that the famous Japanese mathematician, Seki Takakazu ( ) also discovered Bernoulli s numbers at the same time. The famous Indian mathematician Srinivasa Ramanujan ( ) independently studied and rediscovered those numbers in 904. He wrote one of his first article on this subject in 9 [5]. 3 A more modern definition An equivalent definition of the Bernoulli s numbers is obtained from the series expansion of the function z/(e z ): G(z) = z e z = z k B k k! z < 2π (2) In other words, the generating function of the Bernoulli s numbers B k is z/(e z ). The first terms of the expansion of this function are G(z) = ( + ) z2 + z2! 3! + z3 4! +... = z 2 + z2 2 z z z which permit to obtain the first value of the Bernoulli s numbers: B 0 =, B = 2, B 2 = 6, B 3 = 0, B 4 = 30 Further, we observe that G(z) + z 2 = z 2, B 5 = 0, B 6 = 42, B 7 = 0, B 8 = 30. ( 2 ) e z + = z e z/2 + e z/2 2 e z/2 e = z z/2 2 coth z 2, where coth is the hyperbolic tangent, hence G(z) + z/2 is an even function and consequently every Bernoulli s numbers of the form B 2k+ (k > 0) is null. 3. Bernoulli s polynomials With a little modification it s possible to define Bernoulli s polynomials B k (x) by G(z, x) = zezx e z = B k (x) zk k! 3
4 and G(z, 0) = G(z) hence the value of the function B k (x) at x = 0 is B k and because G x (z, x) = zg(z, x) = db k dx (x)zk k! it follows the important relation db k dx (x) = kb k (x). Then, it s easy to deduce that B k (x) are polynomials of degree k, and the first one are B 0 (x) = B (x) = x 2 B 2 (x) = x 2 x + 6 B 3 (x) = x x2 + 2 x B 4 (x) = x 4 2x 3 + x 2 30 B 5 (x) = x x x3 6 x... Thanks to Bernoulli s polynomials, it s possible to rewrite the expression of the sums s p (n) as n s p (n) = k p = p + (B p+(n) B p+ ). There are many relations with these polynomials, for example B k ( x) = ( ) k B k (x), ( ) k B k ( x) = B k (x) + kx k, B 2k (x) < B 2k k =, 2,... and 0 < x <, ( ) B k = ( 2 k )B k k = 0,, Consult [] for other formulas. 4
5 4 Properties 4. Recurrence relation In the expression we let n =, giving or equivalently s p (n) = 0 = p p B k k! B k k! B p = p + p! (p + k)! np+ k (p + k)! p ( p + k ) B k. (3) The recurrence relation (3) allows an easy generation of Bernoulli s numbers and shows that the numbers B p are all rational numbers. It s convenient to rewrite this relation as the symbolic equation (B + ) p+ B p+ = 0, and expand the binomial (B + ) p+ where each power B k must be replaced by B k. Example With p = 4 we have 5B 4 + 0B 3 + 0B 2 + 5B + B 0 = 0 thus 5B 4 + ( ) = 0 therefore B 4 = Bernoulli s numbers and the zeta function In 735, the solution of the Basel problem, expressed by Jakob Bernoulli some years before, was one of Euler s most sensational discovery. The problem was to find the limit of ζ(2) = n 2, n= he found it to be π 2 /6. He also discovered the values of the sums ζ(2k) = n= for k up to 3 ([8] and for more details [7]). n 2k 5
6 It s an extraordinary result that ζ(2k) can be expressed with Bernoulli s numbers ; the values of these sums are given by ζ(2k) = n= n 2k = 4k B 2k π 2k 2(2k)! k > 0, (4) (a proof based on two different expansions of z cot(z) is given in [4] p. 383). No similar expression is known for the odd values of the Zeta function. On the extension of this function to negative values, we also have ζ( 2k) = B 2k 2k k > 0, which may also be used to compute B 2k (see [5]). 4.3 Asymptotic expansion of Bernoulli s numbers From the previous relation (4) with the Zeta function, it s clear that B 2k = 2(2k)! ζ(2k) (5) (2π) 2k and because, when k becomes large, thanks to Stirling s formula we have ζ(2k), (2k)! (2k) 2k e 2k 4πk, ( ) 2k k B 2k 4 πk. πe In [6], the following results describes how the numerator N 2k of B 2k grows with k: log N 2k = 2k log(k) + O(k). 4.4 Bounds It may be useful to estimate bounds for B 2k, to achieve this we use the following relation between the function ζ(s) and the alternating series ζ a (s) ζ(s) = ζ a (s) = ζ a (s) 2 s ( ) n n s n= and since 2 s < ζ a(s) <, 6
7 we have the bounds for ζ(s) 2 s 2 s < ζ(s) < 2 s. If we use this relation with (5), the bounds for B 2k are therefore 2(2k)!( 4 k ) (2π) 2k ( 2.4 k ) < B 2(2k)! 2k < (2π) 2k ( 2.4 k ). 5 Clausen-von Staudt s theorem The following famous and important theorem was published in 840 by Karl von Staudt ( ) and it allows to compute easily the fractional part of Bernoulli s numbers (thus it also permits to compute the denominator of those numbers). This theorem was discovered the same year, independently, by Thomas Clausen (80-885). Theorem 2 The value B 2k, added to the sum of the inverse of prime numbers p such that (p ) divides 2k, is an integer. In other words, B 2k (p ) 2k p (mod ) Proof. A complete proof is given in [], p. 9. When k >, we observe that the primes p = 2, 3 are such as (p ) divides 2k. Let s illustrate this theorem with a few examples. For k =, it becomes B 2 (p ) 2 p = = 5 6 (mod ) B 2 6 (mod ) for k = 5 and for k = 8 B 6 B 0 B (p ) 0 (p ) 6 B p = = 6 66 (mod ) p = = (mod ) (mod ) (mod ) 7
8 Corollary 3 (due to Rado 934) For every prime numbers k of the form 3n+ B 2k 6 (mod ). Proof. It s an easy consequence of the Staudt s theorem since p divides 2k = 2(3n + ) only if p is one of, 2, 3n +, 6n + 2, that is p is one of 2, 3, 3n+2, 6n+3. But 6n+3 is divisible by 3 and 3n+2 is divisible by 2 because 3n + is prime so the only primes p candidates are 2 and 3. Example 4 The first primes of the form 3n+ are 7, 3, 9, 3, 37, 43, 6, 67,... hence we have B 4 B 26 B 38 B 62 B 74 B 86 B 22 B 34 6 (mod ). Clausen-von Staudt s theorem also permits to compute exactly a Bernoulli s number as soon as a sufficiently good approximation of it is known. 6 Expansion of usual functions In a previous section we gave the definition and the consequence z e z = z k B k k! z 2 coth z 2 = B 2k z < 2π z 2k (2k)!. It obviously leads to the two following expansions z coth(z) = z cot(z) = 4 k z 2k B 2k (2k)! = + z2 3 z z z < π ( 4) k z 2k B 2k (2k)! = z2 3 z4 45 2z z < π where cot(z) = cos(z)/ sin(z) = i coth(iz) is the cotangent function. Now it s possible to find the expansion for tanh(z) and tan(z), if we observe that 2 coth(2z) coth(z) = 2 cosh(2z) sinh(2z) cosh(z) sinh(z) = cosh2 (z) + sinh 2 (z) sinh(z) cosh(z) cosh(z) sinh(z) = tanh(z) so that tanh(z) = 4 k (4 k z 2k )B 2k (2k)! = z z z5 5 7z z < π 2 8
9 tan(z) = ( 4) k ( 4 k z 2k )B 2k (2k)! = z + z z z z < π 2. Bernoulli s numbers also occur in the expansions of other classical functions ( ) ( ) z sin(z), z sin(z) tan(z) sinh(z), log, log(cos(z)), log,... z z 6. Series Setting z = or z = in the expansion (2) of z/(e z ) leads to the fast converging series e = B k = k! 2 + B 2k (2k)! and B 2k (2k)! 2 (4π 2 ) k k. In one of his famous notebook, Ramanujan stated without proof the following result: Theorem 5 Let (a, b) two positive real numbers such as ab = π 2, let n > an integer, then a n Proof. See [3]. k 2n e 2ak ( b)n Corollary 6 Let n, then k 2n e 2bk = (an ( b) n ) B 2n 4n. k 4n+ e 2πk = B 4n+2 8n + 4. Proof. Just apply the theorem with a = b = π and replace n by 2n +. It s interesting to compare this result with the classical integral representation valid for n 0 x 2n e 2πx dx = B ( )n 2n 4n which implies that for n 0 x 4n+ e 2πx dx = B 4n+2 8n
10 7 Euler-Maclaurin formula Let f(x) be a function of class C 2p+2 on an interval [a, b] and let h = (b a)/m a subdivision of this interval into m equal parts then we have the important result: Theorem 7 There exist 0 < ϑ < and m f(a + kh) = h b a f(x)dx + 2 (f(a) + f(b)) + p + h2p+2 m (2p + 2)! B 2p+2 f (2p+2) (a + kh + ϑh). Proof. A proof is given in [0]. h 2k ( ) (2k)! B 2k f (2k ) (b) f (2k ) (a) This formula was first studied by Euler in 732 and independently by Colin Maclaurin ( ) in 742 [3]. Euler used it to compute sums of slow converging series and Maclaurin used it as a numerical quadrature formula. With the same conditions, setting n = m+, a =, b = n, h = the theorem becomes: Theorem 8 n f(k) = n f(x)dx+ 2 (f() + f(n))+ p where R n (f, p) is the remainder bounded by 7. Applications R n (f, p) 2 (2π) 2p n B ( ) 2k f (2k ) (n) f (2k ) () +R n (f, p), (2k)! f (2p+) (x) dx. f(x) = x 2, the remainder is null since f (p) (x) = 0 for p > 2: n k 2 = n = n3 3 x 2 dx n2 2 ( + n 2 ) + B 2 (2n 2) n 6 = n(n + )(2n + ) f(x) = /x, f (2k ) (x) = (2k )!/x 2k, Euler-Maclaurin formula yields for a given p: n k log(n) = 2 + 2n + p B 2k 2k ( ) n 2k + R n (f, p) 0
11 when n, the left hand side of the equality tends to γ (Euler s constant) and the equality gives finally n γ = 2 + p k log(n) = γ + 2n p B 2k 2k + R (f, p), B 2k 2k (check that R n (f, p) R (f, p) = O(/n 2p+2 ) ) n 2k + (R n(f, p) R (f, p)). 3. f(x) = log(x), with the same method (left as exercise) Euler-Maclaurin formula becomes n log(k) = n log(n) n+ log(n) 2 +log( 2π)+ p B 2k 2k(2k ) n 2k +O so, for example, with p = 3 log(n!) = n log(n) n + log( 2πn) + 2n ( ) 360n n 5 + O n 7 and taking the exponential n! = n n e n 2πn exp ( 2n ( )) 360n n 5 + O n 7. ( ) n 2p+ This is the asymptotic Stirling formula. Using the series expansion of the exponential function near the origin, it s more convenient to write it as n! = n n e n ( 2πn + 2n + 288n 2 39 ( )) 5840n n n 5 + O n 6 8 Bernoulli s numbers and Fermat s last theorem The famous Fermat s last theorem states that the equation x n + y n = z n never has non-zero integer solutions for n > 2. Since Fermat expressed this result around 630, the pursuit of a proof occupied generations of mathematicians.
12 A big step was made in 850 by Ernst Kummer (80-893) when he proved Fermat s theorem for n = p, whenever p is, what is called today, a regular prime. Kummer gave the beautiful regularity criterion: p is a regular prime if and only if p does not divide the numerator of B 2, B 4,..., B p 3. He showed that all primes before 37 where regular, hence Fermat s theorem was proved for those primes. 37 is the first non regular prime because it divides the numerator of B 32 = = The next irregular primes (less than 300) are 59, 67, 0, 03, 3, 49, 57, 233, 257, 263, 27, 283, 293,... For example, 57 divides the numerators of B 62 and B 0. Thanks to arithmetical properties of Bernoulli s numbers, Johann Ludwig Jensen ( ) proved in 95 that the number of irregular primes is infinite. Even if it s probable that the number of regular primes is infinite, a proof remains unknown [6]. 9 The first Bernoulli s numbers 9. First numbers Here is the list of the first Bernoulli s numbers. Except for B numbers of the form B 2k+ are null. B 0 = B = /2 B 2 = /6 B 4 = /30 B 6 = /42 B 8 = /30 B 0 = 5/66, B 2 = 69/2730 B 4 = 7/6 B 6 = 367/50 B 8 = 43867/798 B 20 = 746/330 B 22 = 85453/38 B 24 = /2730 2
13 B 26 = /6 B 28 = /870 B 30 = /4322 B 32 = /50 B 34 = /6 B 36 = /9990 B 38 = /6 B 40 = / More numbers are given in [] and in [7]. 9.2 Some computations Bernoulli himself computed the numbers that now bear his name up to B 0. Later, Euler computed these numbers up to B 30, then Martin Ohm extended the calculation up to B 62 in 840 [4]. A few years later, in 877, Adams made the impressive computation of all Bernoulli s numbers up to B 24 (or B 62 according to his convention) [2]. For instance, the numerator of B 24 has 0 digits and the denominator is the number 30. In 996, Simon Plouffe and Greg J. Fee computed B a huge number of about digits, the computation took about 2 hours on a work station. In 2002, the same authors improved the record to B which has digits by a 2 hours computation on a personal computer. The method is based on the formula (5) which allow a direct computation of the required number without the need to compute the previous ones. References [] M. Abramowitz and I. Stegun, Handbook of Mathematical Functions, Dover, New York, (964) [2] J.C. Adams, On the calculation of Bernoulli s numbers up to B 62 by means of Staudt s theorem, Rep. Brit. Ass., (877) [3] B.C. Berndt, Ramanujan s Notebooks, Part II, Springer-Verlag, New York, (989) [4] J.M. Borwein and P.B. Borwein, Pi and the AGM - A study in Analytic Number Theory and Computational Complexity, A Wiley-Interscience Publication, New York, (987) [5] P. Borwein, An efficient algorithm for the Riemann Zeta function, (995) [6] K. Dilcher, A Bibliography of Bernoulli Numbers, World Wide Web site at the address: 3
14 [7] W. Dunham, Euler The Master of Us All, The Mathematical Association of America, (999) [8] L. Euler, Introduction à l analyse infinitésimale (french traduction by Labey), Barrois, ainé, Librairie, (original 748, traduction 796), vol. [9] X. Gourdon and P. Sebah, Numbers, Constants and Computation, World Wide Web site at the address: (999) [0] R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, (994) [] G.H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford Science Publications, (979) [2] V.J. Katz, A History of Mathematics-An Introduction, Addison-Wesley, (998) [3] C. Maclaurin, A Treatise of fluxions, Edinburgh, (742) [4] M. Ohm, Etwas über die Bernoulli schen Zahlen, J. Reine Angew. Math., (840), vol. 20, p. -2 [5] S. Ramanujan, Some properties of Bernoulli s numbers, J. Indian Math. Soc., (9), vol. 3, p [6] P. Ribenboim, The new Book of Prime Number Records, Springer, (996) [7] L. Saalschütz, Vorlesungen über die Bernoullischen Zahlen, Berlin, Verlag von Julius Springer, (893) [8] D.E. Smith, A Source Book in Mathematics, Dover Publications, New York, (959, first edition 929) 4
SUMS OF POWERS AND BERNOULLI NUMBERS
SUMS OF POWERS AND BERNOULLI NUMBERS TOM RIKE OAKLAND HIGH SCHOOL Fermat and Pascal On September 22, 636 Fermat claimed in a letter that he could find the area under any higher parabola and Roberval wrote
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationBernoulli Numbers and their Applications
Bernoulli Numbers and their Applications James B Silva Abstract The Bernoulli numbers are a set of numbers that were discovered by Jacob Bernoulli (654-75). This set of numbers holds a deep relationship
More informationThe Bernoulli Summation Formula: A Pretty Natural Derivation
The Bernoulli Summation Formula: A Pretty Natural Derivation Mike Raugh Ph.D. in Math, Stanford University www.mikeraugh.org A Presentation for Los Angeles City College At The High School Math Contest
More informationMATHEMATICS BONUS FILES for faculty and students
MATHEMATICS BONUS FILES for faculty and students http://www2.onu.edu/~mcaragiu1/bonus_files.html RECEIVED: November 1, 2007 PUBLISHED: November 7, 2007 The Euler formula for ζ (2 n) The Riemann zeta function
More informationOld and new algorithms for computing Bernoulli numbers
Old and new algorithms for computing Bernoulli numbers University of New South Wales 25th September 2012, University of Ballarat Bernoulli numbers Rational numbers B 0, B 1,... defined by: x e x 1 = n
More informationON THE TAYLOR COEFFICIENTS OF THE HURWITZ ZETA FUNCTION
ON THE TAYLOR COEFFICIENTS OF THE HURWITZ ZETA FUNCTION Khristo N. Boyadzhiev Department of Mathematics, Ohio Northern University, Ada, Ohio, 45810 k-boyadzhiev@onu.edu Abstract. We find a representation
More informationRamanujan and Euler s Constant
Richard P. Brent MSI, ANU 8 July 2010 In memory of Ed McMillan 1907 1991 Presented at the CARMA Workshop on Exploratory Experimentation and Computation in Number Theory, Newcastle, Australia, 7 9 July
More informationA RECURRENCE RELATION FOR BERNOULLI NUMBERS
Hacettepe Journal of Mathematics and Statistics Volume 42 (4) (203), 39 329 A RECURRENCE RELATION FOR BERNOULLI NUMBERS Ömer Küçüksakallı Received : 06 : 202 : Accepted 4 : 0 : 203 Keywords: Abstract Inspired
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationThe Bernoulli Numbers. Kyler Siegel Stanford SUMO April 23rd, 2015
The Bernoulli Numbers Kyler Siegel Stanford SUMO April 23rd, 2015 Recall the formulas See https://gowers.wordpress.com/2014/11/04/sums-of-kth-powers/ See https://gowers.wordpress.com/2014/11/04/sums-of-kth-powers/
More informationPolyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH
Polyexponentials Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH 45810 k-boyadzhiev@onu.edu 1. Introduction. The polylogarithmic function [15] (1.1) and the more general
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationSome Interesting Properties of the Riemann Zeta Function
Some Interesting Properties of the Riemann Zeta Function arxiv:822574v [mathho] 2 Dec 28 Contents Johar M Ashfaque Introduction 2 The Euler Product Formula for ζ(s) 2 3 The Bernoulli Numbers 4 3 Relationship
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationComputing Bernoulli Numbers Quickly
Computing Bernoulli Numbers Quickly Kevin J. McGown December 8, 2005 The Bernoulli numbers are defined via the coefficients of the power series expansion of t/(e t ). Namely, for integers m 0 we define
More informationarxiv: v3 [math.co] 5 Sep 2011
Fast Computation of Bernoulli, Tangent and Secant Numbers Richard P. Brent and David Harvey arxiv:1108.0286v3 [math.co] 5 Sep 2011 Abstract We consider the computation of Bernoulli, Tangent (zag), and
More informationarxiv: v1 [math.nt] 19 Jul 2017
Some infinite series involving hyperbolic functions arxiv:707.06673v [math.nt] 9 Jul 07 Ce Xu School of Mathematical Sciences, Xiamen University Xiamen 36005, P.R. China Abstract This paper develops an
More informationof Classical Constants Philippe Flajolet and Ilan Vardi February 24, 1996 Many mathematical constants are expressed as slowly convergent sums
Zeta Function Expansions of Classical Constants Philippe Flajolet and Ilan Vardi February 24, 996 Many mathematical constants are expressed as slowly convergent sums of the form C = f( ) () n n2a for some
More informationThe Humble Sum of Remainders Function
DRAFT VOL. 78, NO. 4, OCTOBER 2005 1 The Humble Sum of Remainders Function Michael Z. Spivey Samford University Birmingham, Alabama 35229 mzspivey@samford.edu The sum of divisors function is one of the
More informationMathSciNet infinitude of prime
0 π(x) x π(x) > c log log x π(x) > c log x c MathSciNet infinitude of prime 2018/11/3 2012 arxiv Romeo Meštrović, Euclid s theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.
More informationFormulas for Odd Zeta Values and Powers of π
3 47 6 3 Journal of Integer Sequences, Vol. 4 (0), Article..5 Formulas for Odd Zeta Values and Powers of π Marc Chamberland and Patrick Lopatto Department of Mathematics and Statistics Grinnell College
More informationTHE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS
THE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS FRANCIS N. CASTRO, OSCAR E. GONZÁLEZ, AND LUIS A. MEDINA Abstract. In this work we explore the p-adic valuation of Eulerian numbers.
More informationThe Generating Functions for Pochhammer
The Generating Functions for Pochhammer Symbol { }, n N Aleksandar Petoević University of Novi Sad Teacher Training Faculty, Department of Mathematics Podgorička 4, 25000 Sombor SERBIA and MONTENEGRO Email
More informationNumerical evaluation of the Riemann Zeta-function
Numbers, constants and computation Numerical evaluation of the Riemann Zeta-function Xavier Gourdon and Pascal Sebah July 23, 2003 We expose techniques that permit to approximate the Riemann Zeta function
More informationEvaluating ζ(2m) via Telescoping Sums.
/25 Evaluating ζ(2m) via Telescoping Sums. Brian Sittinger CSU Channel Islands February 205 2/25 Outline 2 3 4 5 3/25 Basel Problem Find the exact value of n= n 2 = 2 + 2 2 + 3 2 +. 3/25 Basel Problem
More informationInvestigating Geometric and Exponential Polynomials with Euler-Seidel Matrices
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.4.6 Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices Ayhan Dil and Veli Kurt Department of Mathematics
More informationThe Value of the Zeta Function at an Odd Argument
International Journal of Mathematics and Computer Science, 4(009), no., 0 The Value of the Zeta Function at an Odd Argument M CS Badih Ghusayni Department of Mathematics Faculty of Science- Lebanese University
More informationarxiv:math/ v1 [math.nt] 9 Aug 2004
arxiv:math/0408107v1 [math.nt] 9 Aug 2004 ELEMENTARY RESULTS ON THE BINARY QUADRATIC FORM a 2 + ab + b 2 UMESH P. NAIR Abstract. This paper examines with elementary proofs some interesting properties of
More informationBernoulli Polynomials
Chapter 4 Bernoulli Polynomials 4. Bernoulli Numbers The generating function for the Bernoulli numbers is x e x = n= B n n! xn. (4.) That is, we are to expand the left-hand side of this equation in powers
More informationInternational Journal of Pure and Applied Sciences and Technology
Int. J. Pure Appl. Sci. Technol., 15(2) (2013), pp. 68-72 International Journal of Pure and Applied Sciences and Technology ISSN 2229-6107 Available online at www.ijopaasat.in Research Paper Generalization
More informationAn identity involving the least common multiple of binomial coefficients and its application
Amer. Math. Monthly, 116 (2009, p. 836-839. An identity involving the least common multiple of binomial coefficients and its application Bair FARHI bair.farhi@gmail.com Abstract In this paper, we prove
More information1 Question related to polynomials
07-08 MATH00J Lecture 6: Taylor Series Charles Li Warning: Skip the material involving the estimation of error term Reference: APEX Calculus This lecture introduced Taylor Polynomial and Taylor Series
More informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationNew asymptotic expansion for the Γ (x) function
New asymptotic epansion for the Γ function Gergő Nemes December 7, 2008 http://d.doi.org/0.3247/sl2math08.005 Abstract Using a series transformation, Stirling-De Moivre asymptotic series approimation to
More informationMath 229: Introduction to Analytic Number Theory Čebyšev (and von Mangoldt and Stirling)
ath 9: Introduction to Analytic Number Theory Čebyšev (and von angoldt and Stirling) Before investigating ζ(s) and L(s, χ) as functions of a complex variable, we give another elementary approach to estimating
More informationrama.tex; 21/03/2011; 0:37; p.1
rama.tex; /03/0; 0:37; p. Multiple Gamma Function and Its Application to Computation of Series and Products V. S. Adamchik Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA Abstract.
More informationSOME HINTS AND ANSWERS TO 18.S34 SUPPLEMENTARY PROBLEMS (Fall 2007)
SOME HINTS AND ANSWERS TO 18.S34 SUPPLEMENTARY PROBLEMS (Fall 2007) 2. (b) Answer: (n 3 + 3n 2 + 8n)/6, which is 13 for n = 3. For a picture, see M. Gardner, The 2nd Scientific American Book of Mathematical
More informationThe Continuing Story of Zeta
The Continuing Story of Zeta Graham Everest, Christian Röttger and Tom Ward November 3, 2006. EULER S GHOST. We can only guess at the number of careers in mathematics which have been launched by the sheer
More informationOn the Riesz and Báez-Duarte criteria for the Riemann Hypothesis arxiv: v1 [math.nt] 18 Jul 2008
On the Riesz and Báez-Duarte criteria for the Riemann Hypothesis arxiv:0807.97v [math.nt] 8 Jul 008 Jerzy Cis lo, Marek Wolf Institute of Theoretical Physics University of Wroc law pl. M.Borna 9, 50-05
More informationSome thoughts concerning power sums
Some thoughts concerning power sums Dedicated to the memory of Zoltán Szvetits (929 20 Gábor Nyul Institute of Mathematics, University of Debrecen H 00 Debrecen POBox 2, Hungary e mail: gnyul@scienceunidebhu
More information#A08 INTEGERS 9 (2009), ON ASYMPTOTIC CONSTANTS RELATED TO PRODUCTS OF BERNOULLI NUMBERS AND FACTORIALS
#A08 INTEGERS 9 009), 83-06 ON ASYMPTOTIC CONSTANTS RELATED TO PRODUCTS OF BERNOULLI NUMBERS AND FACTORIALS Bernd C. Kellner Mathematisches Institut, Universität Göttingen, Bunsenstr. 3-5, 37073 Göttingen,
More informationHypergeometric Forms of Well Known Partial Fraction Expansions of Some Meromorphic Functions
Global Journal of Science Frontier Research Volume Issue 6 Version.0 September 20 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN : 229-626
More information1. INTRODUCTION For n G N, where N = {0,1,2,...}, the Bernoulli polynomials, B (t), are defined by means of the generating function
CONGRUENCES RELATING RATIONAL VALUES OF BERNOULLI AND EULER POLYNOMIALS Glenn J. Fox Dept. of Mathematics and Computer Science, Emory University, Atlanta, GA 30322 E-mail: fox@mathcs.emory.edu (Submitted
More informationOn the stirling expansion into negative powers of a triangular number
MATHEMATICAL COMMUNICATIONS 359 Math. Commun., Vol. 5, No. 2, pp. 359-364 200) On the stirling expansion into negative powers of a triangular number Cristinel Mortici, Department of Mathematics, Valahia
More informationRiemann s ζ-function
Int. J. Contemp. Math. Sciences, Vol. 4, 9, no. 9, 45-44 Riemann s ζ-function R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, TN N4 URL: http://www.math.ucalgary.ca/
More informationHeuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn
Heuristics for Prime Statistics Brown Univ. Feb., 2006 K. Conrad, UConn Two quotes about prime numbers Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers,
More informationarxiv: v1 [math.gm] 31 Dec 2015
On the Solution of Gauss Circle Problem Conjecture Revised arxiv:60.0890v [math.gm] 3 Dec 05 Nikolaos D. Bagis Aristotle University of Thessaloniki Thessaloniki, Greece email: nikosbagis@hotmail.gr Abstract
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More informationThe Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(2k)
The Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(k) Cezar Lupu 1 1 Department of Mathematics University of Pittsburgh Pittsburgh, PA, USA Algebra,
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationA Note about the Pochhammer Symbol
Mathematica Moravica Vol. 12-1 (2008), 37 42 A Note about the Pochhammer Symbol Aleksandar Petoević Abstract. In this paper we give elementary proofs of the generating functions for the Pochhammer symbol
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationSUMMATION TECHNIQUES
SUMMATION TECHNIQUES MATH 53, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Scattered around, but the most cutting-edge parts are in Sections 2.8 and 2.9. What students should definitely
More informationp-regular functions and congruences for Bernoulli and Euler numbers
p-regular functions and congruences for Bernoulli and Euler numbers Zhi-Hong Sun( Huaiyin Normal University Huaian, Jiangsu 223001, PR China http://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers,
More informationPROBABILITY. Contents Preface 1 1. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8. Preface
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction. Combinatorial analysis 5 3. Stirling s formula 8 Preface These lecture notes are for the course Probability IA, given in Lent 09 at the University
More informationAbstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt
Roma Tre April 8 0, 08 4th Mini Symposium of the Roman umber Theory Association (RTA) Representation of integers by cyclotomic binary forms Michel Waldschmidt Institut de Mathématiques de Jussieu Paris
More informationHistory of Mathematics
History of Mathematics Paul Yiu Department of Mathematics Florida Atlantic University Spring 2014 10A: Newton s binomial series Issac Newton (1642-1727) obtained the binomial theorem and the area of a
More informationEXPONENTIAL POLYNOMIALS, STIRLING NUMBERS, AND EVALUATION OF SOME GAMMA INTEGRALS. Khristo N. Boyadzhiev
January 29, 2010 EXPONENTIAL POLYNOMIALS, STIRLING NUMBERS, AND EVALUATION OF SOME GAMMA INTEGRALS Khristo N. Boyadzhiev Department of Mathematics, Ohio Northern University Ada, Ohio 45810, USA k-boyadzhiev@onu.edu
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES In section 11.9, we were able to find power series representations for a certain restricted class of functions. INFINITE SEQUENCES AND SERIES
More informationPrime Number Theory and the Riemann Zeta-Function
5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no
More informationOn the Sylvester Denumerants for General Restricted Partitions
On the Sylvester Denumerants for General Restricted Partitions Geir Agnarsson Abstract Let n be a nonnegative integer and let ã = (a 1... a k be a k-tuple of positive integers. The term denumerant introduced
More informationModular Arithmetic. Examples: 17 mod 5 = 2. 5 mod 17 = 5. 8 mod 3 = 1. Some interesting properties of modular arithmetic:
Modular Arithmetic If a mod n = b, then a = c n + b. When you reduce a number a modulo n you usually want 0 b < n. Division Principle [Bar02, pg. 61]: Let n be a positive integer and let a be any integer.
More informationarxiv:math/ v1 [math.nt] 27 Feb 2004
arxiv:math/0402458v1 [math.nt] 27 Feb 2004 On simultaneous binary expansions of n and n 2 Giuseppe Melfi Université de Neuchâtel Groupe de Statistique Espace de l Europe 4, CH 2002 Neuchâtel, Switzerland
More informationIntroduction to Abstract Mathematics
Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of
More informationAn Euler-Type Formula for ζ(2k + 1)
An Euler-Type Formula for ζ(k + ) Michael J. Dancs and Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan University Bloomington, IL 670-900, USA Draft, June 30th, 004 Abstract
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationALL TEXTS BELONG TO OWNERS. Candidate code: glt090 TAKEN FROM
How are Generating Functions used in finding the closed form of sequences involving recurrence relations and in the analysis of probability distributions? Mathematics Extended Essay Word count: 3865 Abstract
More informationUnit 42 A Math Fleet on the Pascal s Triangle and Determinant Patterns of Reciprocals of Factorials Sea
Unit A Math Fleet on the Pascal s Triangle and Determinant Patterns of Reciprocals of Factorials Sea Heavier-than-air flying machines are impossible. Lord Kelvin, president of Royal Society (89) Pascal
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson
JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises
More informationOn a series of Ramanujan
On a series of Ramanujan Olivier Oloa To cite this version: Olivier Oloa. On a series of Ramanujan. Gems in Experimental Mathematics, pp.35-3,, . HAL Id: hal-55866 https://hal.archives-ouvertes.fr/hal-55866
More informationThe Prime Number Theorem
The Prime Number Theorem We study the distribution of primes via the function π(x) = the number of primes x 6 5 4 3 2 2 3 4 5 6 7 8 9 0 2 3 4 5 2 It s easier to draw this way: π(x) = the number of primes
More informationPartition Congruences in the Spirit of Ramanujan
Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research
More informationA PROBABILISTIC PROOF OF WALLIS S FORMULA FOR π. ( 1) n 2n + 1. The proof uses the fact that the derivative of arctan x is 1/(1 + x 2 ), so π/4 =
A PROBABILISTIC PROOF OF WALLIS S FORMULA FOR π STEVEN J. MILLER There are many beautiful formulas for π see for example [4]). The purpose of this note is to introduce an alternate derivation of Wallis
More informationTHE MATHEMATICS OF EULER. Introduction: The Master of Us All. (Dunham, Euler the Master xv). This quote by twentieth-century mathematician André Weil
THE MATHEMATICS OF EULER Introduction: The Master of Us All All his life he seems to have carried in his head the whole of the mathematics of his day (Dunham, Euler the Master xv). This quote by twentieth-century
More informationAlgorithmic Approach to Counting of Certain Types m-ary Partitions
Algorithmic Approach to Counting of Certain Types m-ary Partitions Valentin P. Bakoev Abstract Partitions of integers of the type m n as a sum of powers of m (the so called m-ary partitions) and their
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationA SUMMATION FORMULA FOR SEQUENCES INVOLVING FLOOR AND CEILING FUNCTIONS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 36, Number 5, 006 A SUMMATION FORMULA FOR SEQUENCES INVOLVING FLOOR AND CEILING FUNCTIONS M.A. NYBLOM ABSTRACT. A closed form expression for the Nth partial
More informationarxiv: v2 [math.nt] 5 Sep 2012
ON STRONGER CONJECTURES THAT IMPLY THE ERDŐS-MOSER CONJECTURE BERND C. KELLNER arxiv:1003.1646v2 [ath.nt] 5 Sep 2012 Abstract. The Erdős-Moser conjecture states that the Diophantine equation S k () = k,
More informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
More informationComputing Bernoulli numbers
Computing Bernoulli numbers David Harvey (joint work with Edgar Costa) University of New South Wales 27th September 2017 Jonathan Borwein Commemorative Conference Noah s on the Beach, Newcastle, Australia
More informationMORE APPLICATIONS OF DERIVATIVES. David Levermore. 17 October 2000
MORE APPLICATIONS OF DERIVATIVES David Levermore 7 October 2000 This is a review of material pertaining to local approximations and their applications that are covered sometime during a year-long calculus
More informationHypergeometric Forms of Well Known Partial Fraction Expansions of Some Meromorphic Functions
See discussions stats and author profiles for this publication at: https://www.researchgate.net/publication/277666463 Hypergeometric Forms of Well Known Partial Fraction Expansions of Some Meromorphic
More informationCalculus of Finite Differences. Andreas Klappenecker
Calculus of Finite Differences Andreas Klappenecker Motivation When we analyze the runtime of algorithms, we simply count the number of operations. For example, the following loop for k = 1 to n do square(k);
More informationA Note on the 2 F 1 Hypergeometric Function
A Note on the F 1 Hypergeometric Function Armen Bagdasaryan Institution of the Russian Academy of Sciences, V.A. Trapeznikov Institute for Control Sciences 65 Profsoyuznaya, 117997, Moscow, Russia E-mail:
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
More informationNew asymptotic expansion for the Γ (z) function.
New asymptotic expansion for the Γ z function. Gergő Nemes Institute of Mathematics, Eötvös Loránd University 7 Budapest, Hungary September 4, 007 Published in Stan s Library, Volume II, 3 Dec 007. Link:
More informationarxiv: v1 [math.co] 18 Oct 2016
ON SOME CLASS OF SUMS ANDREI K. SVININ Abstract. We consider some class of the sums which naturally include the sums of powers of integers. We suggest a number of conjectures concerning a representation
More informationOn integral representations of q-gamma and q beta functions
On integral representations of -gamma and beta functions arxiv:math/3232v [math.qa] 4 Feb 23 Alberto De Sole, Victor G. Kac Department of Mathematics, MIT 77 Massachusetts Avenue, Cambridge, MA 239, USA
More informationSome unusual identities for special values. of the Riemann zeta function. by William D. Banks. 1. Introduction p s ) 1
Some unusual identities for special values of the Riemann zeta function by William D Banks Abstract: In this paper we use elementary methods to derive some new identities for special values of the Riemann
More informationOn Generalized Fibonacci Polynomials and Bernoulli Numbers 1
1 3 47 6 3 11 Journal of Integer Sequences, Vol 8 005), Article 0553 On Generalized Fibonacci Polynomials and Bernoulli Numbers 1 Tianping Zhang Department of Mathematics Northwest University Xi an, Shaanxi
More informationThis theorem allows us to describe all integer solutions as follows:
On the Diophantine equation a 3 + b 3 + c 3 + d 3 = 0 by RACHEL GAR-EL and LEONID VASERSTEIN (University Park, PA) Introduction. The equation a 3 + b 3 + c 3 + d 3 = 0 (1) has been studied by many mathematicians
More informationAnalytic Aspects of the Riemann Zeta and Multiple Zeta Values
Analytic Aspects of the Riemann Zeta and Multiple Zeta Values Cezar Lupu Department of Mathematics University of Pittsburgh Pittsburgh, PA, USA PhD Thesis Overview, October 26th, 207, Pittsburgh, PA Outline
More informationMathematical Misnomers: Hey, who really discovered that theorem!
Mathematical Misnomers: Hey, who really discovered that theorem! Mike Raugh mikeraugh.org LACC Math Contest 24th March 2007 Who was buried in Grant s tomb? Ulysss S. Grant, of course! These are true too:
More information