Sums of Products of Bernoulli Numbers*
|
|
- Horatio Lee
- 5 years ago
- Views:
Transcription
1 journal of number theory 60, 234 (996) article no. 00 Sums of Products of Bernoulli Numbers* Karl Dilcher Department of Mathematics, Statistics, and Computing Science, Dalhousie University, Halifax, Nova Scotia, Canada, B3H 3J5 Communicated by W. Sinnott Received September, 994; revised November 6, 995 Closed expressions are obtained for sums of products of Bernoulli numbers of the 2n form ( 2j,..., 2j N ) B 2j }}}B 2jN, where the summation is extended over all nonnegative integers j,..., j N with j + j 2 +}}}+j N =n. Corresponding results are derived for Bernoulli polynomials, and for Euler numbers and polynomials. As easy corollaries we obtain formulas for sums of products of the Riemann zeta function at even integers and of other related infinite series. 996 Academic Press, Inc.. INTRODUCTION The Bernoulli numbers B n are defined by the generating function t e t & = n=0 t n B n, t <2?. (.) n! A well-nown relation among the Bernoulli numbers is (for n2) n& j=\ 2n 2j+ B 2jB 2n&2j =&(2n+) B 2n. (.2) This was found by many authors, including Euler; for references, see, e.g., [3]. Sitaramachandrarao and Davis [3] generalized (.2) to sums of products of 3 and 4 Bernoulli numbers \ 2n 2a, 2b,2c+ B 2aB 2b B 2c =(n+)(2n+) B 2n +n \n& 2+ B 2n&2, (.3) * Research supported in part by the Natural Sciences and Engineering Research Council of Canada X Copyright 996 by Academic Press, Inc. All rights of reproduction in any form reserved.
2 24 KARL DILCHER \ 2n 2a, 2b,2c,2d+ B 2aB 2b B 2c B 2d =& \2n B 2n& 4 3 n2 (2n&) B 2n&2, (.4) 2n where ( ) and ( 2n 2a, 2b,2c 2a, 2b,2c,2d ) are multinomial coefficients. The sum in (.3) ranges over all positive integers a, b, c with a+b+c=n (n3), and the sum in (.4) ranges over all positive integers a,..., d with a+ }}}+d=n (n4). The identities (.2)(.4) can be written in terms of the Riemann zeta function, via Euler's formula Thus, (.2) can be written as `(2n)=(&) n& (2?)2n B 2n. (.5) 2(2n)! n& j= `(2j) `(2n&2j)=(n+ 2 ) `(2n), n2, (.6) and similarly for (.3) and (.4). Sitaramachandrarao and Davis remared in [3] that it may be of interest to find formulas of the type (.2)(.4), (.6) for sums of products of N5 Bernoulli number, resp. zeta function factors. This was achieved by Sanarayanan [2] for N=5 and by Zhang [6] for N7. Before [6] appeared, Ramachandra and Sanarayanan [] proved that with we have Y(z) = n= Y N = (2z) 2n (&) n& B 2n (2n)! A j (z) z j d j Y dz j, (.7) where A j (z) are polynomials in z of degree at most () N, with rational coefficients. (In fact, a somewhat more general result was obtained). It is easy to see that (.7) will lead to expressions of the type (.2)(.4). It was remared in [] that the proof gives an algorithm for determining the A j (z); however, they are not explicitly given. It is one purpose of this paper to obtain explicit expressions, of the ind given in [2], [3], and [6], and valid for all N2 and all n (not
3 BERNOULLI NUMBERS 25 just for nn ). We will do this in Section 2. In Section 3 we prove corresponding results for the Bernoulli polynomials B n (x), and in Section 4 for the Euler polynomials E n (x). In both cases we obtain as easy consequences formulas for sums related to the Riemann zeta function. Section 5 contains some remars on related sums that occur in the literature. 2. BERNOULLI NUMBERS Before stating our first result, the generalization of (.2)(.4), we introduce some notation. We define the sequence b (N ) of rational numbers recursively by b () 0 = and b (N+) =& N b(n) + 4 b() &, (2.) with b (N ) =0 for <0 and for >[()2]. (Here and in what follows [x] denotes the greatest integer not exceceeding x). Furthermore, let f(t) = e t &, and f () (t) denote, as usual, the th derivative of f(t), with the convention that f (0) (t)=f(t). Lemma. For N we have \ 2 e t N N + & e &+ 2+ t \ [()2] = =0 b (N) f (N&2&) (t). (2.2) Proof. This is by induction on N. For N= we have e t + 2 e t & & 2 = e t & =f(t), which agrees with the right-hand side of (2.2). For N=2, the left-hand side of (2.2) becomes 4\ e2t +2e t + e 2t &2e t + & + = 4 4e t (e t &) 2=&f$(t), which again agrees with the right-hand side of (2.2).
4 26 KARL DILCHER For the induction step we first note that we have the following identity (for N) which is easy to verify \ e t N+ N+ + & 2 e &+ 2+ t \ =& d N dt{\ 2 + 4{\ 2 e t N N + & e &+ 2+ t \ e t N N +) & e &+ 2+ = t \. Assuming (2.2) is true for all exponents up to N, we thus obtain \ 2 e t + & e &+ 2+ t \ =& d Ndt [()2] =& [N2] = =0 { =0 [()2] =0 N b(n) & N b(n) [((N+)&)2] = =0 b (N) f (N&2&) (t)+ 4 [N2] f (N&2) (t)+ = + 4 b() & = f (N&2) (t) b (N+) f (N+&2&) (t), [(N&2)2] =0 4 b() & = b () f (N&2&2) (t) f (N&2) (t) where the last step follows from (2.). This completes the proof. Let N be given. Our aim is to evaluate the sum S N (n) = \ 2n 2j,2j 2,..., 2j N+ B 2j B 2j2 }}}B 2jN, (2.3) where the sum is taen over all nonnegative integers j,..., j N such that j +}}}+j N =n, and where is the multinomial coefficient. 2n \ 2j,..., 2j N+ = (2n)! (2j )!}}}(2j N )! K Theorem. For 2n>N we have S N (n)= (2n)! (2n&N)! [()2] =0 b (N) B 2n&2 2n&2. (2.4)
5 BERNOULLI NUMBERS 27 Before proving the theorem, we use it to write down some special cases. First we tabulate, by way of the recursion (2.), a few values of b (N ) N & & 6 & & 20 & 2 & With this table and (2.4) we obtain for N= the trivial S (n)=b 2n, and further S 2 (n)=&(2n&) B 2n ; (2.5) S 3 (n)= 2 (2n&)(2n&2) B 2n+ 2 n(2n&) B 2n&2; (2.6) S 4 (n)=& 6 (2n&)(2n&2)(2n&3) B 2n& 3 2n(2n&)(2n&3) B 2n&2; (2.7) these are equivalent to (.2)(.4) if we tae into account the slightly different ranges of summation. The first new identities are obtained for N=5 and N=6 S 5 (n)= \2n& 4 + B 2n+ 5 2 n(2n&)(2n&3)(2n&4) B 2n&2 + 8 n(2n&)(2n&2)(2n&3) B 2n&4; (2.8) S 6 (n)=& \2n& 5 + B 2n& 6 n(2n&)(2n&3)(2n&4)(2n&5) B 2n&2 & n(2n&)(2n&2)(2n&3)(2n&5) B 2n&4. (2.9) Proof of Theorem. We rewrite (.) as t e t & =& 2 t+ j= B 2j (2j)! t2j ; (2.0) hence f(t)= t & 2 + j= B 2j 2j t 2j& (2j&)!, (2.)
6 28 KARL DILCHER and therefore (N&2&)! f (N&2&) (t)=(&) t N&2 + j=[(n&2+)2] B 2j t 2j&&(N&2&) 2j (2j&N+2)!, (2.2) except when N&2&=0 in which case we have just (2.). Hence for N>2+ we have \ t 2 Now Lemma gives e t N N + = e &+ 2+ t \t t N f (N&2&) (t)=(&) (N&2&)! t 2 [()2] + =0 + b (N) j=[(n+)2] B 2j&2 2j&2 _ (N&2&)! t 2 + {(&) t 2j (2j&N)!. j=[(n+)2] B 2j&2 t 2j&2 (2j&N)!= & 2 a Nb (N) ()2 tn, (2.3) where a n =0 when N is even, and a N = when N is odd (from (2.)). On the other hand, with (2.0) we get t e t + 2 e t & = B 2j n=0 (2j)! t2j, and raising this to the Nth power gives, with (2.3), \ t 2 e t N + = e &+ t n=0 S N (n) t 2n (2n)!. (2.4) Finally, we compare coefficients of t 2n in (2.4) and (2.3), and thus obtain (2.4) for 2n>N, i.e., for n[(n+2)2]. K The proof of Theorem immediately gives expressions for S N (n) also in the case n[n2]. First we need a lemma about some special values of the coefficients b (N ).
7 BERNOULLI NUMBERS 29 Lemma 2. (a) (b) b (N) For N we have 0 =(&) ()!; b (N) ()2 =2&N+ for N odd. Proof. (a) By definition we have b () 0 = and b(n+) 0 =&(N ) b (N ) 0 ; the result now follows immediately by induction. (b) In this case (2.) gives b () 0 = and b(n+2) (N+)2 = 4 b(n) ()2 Theorem 2.. The result follows again by induction. K (a) (b) S 2n (n)= (2n)! n& (2n)! + 4 n 2n&2 b(2n) B 2n&2 ; =0 S N (n)=(&) (N&2n&)! (2n)! b (N) n, 0n _ 2 &, and in particular (c) S 2n+ (n)=(2n)! 4 &n. Proof. Parts (a) and (b) follow directly from (2.3) and (2.4), by comparing coefficients of t N. Note that for odd N, the two terms involving t N in (2.3) cancel each other, by Lemma 2(b). Part (c) follows from (b), with Lemma 2(b). K Although the recurrence relation (2.) provides a convenient way of determining the coefficients b (N ) occurring in Theorems and 2, it might be of interest of express the b (N ) in closed form in terms of nown functions. This can be done by first defining polynomials which have the b (N ) as coefficients. It is then easy to establish a three-term recurrence between these polynomials, which in turn gives rise to a generating function. Standard methods concerning generating functions are then used to obtain the explicit expression. Here and in the remainder of the paper we use the well-nown Stirling numbers of the first ind s(n, ). For definition an properties, see, e.g., [2, p. 22ff.]; a table can be found in [2, p. 30]. Lemma 3. b (N ) For N and 0[()2] we have 2 =(&) N i=0\ i + s(n&i, N&2) (N&i)! \ i. (2.5) 2+ Proof. While the procedure described above was used to obtain this expression, it now suffices to verify that the right-hand side of (2.5)
8 30 KARL DILCHER satisfies the recursion (2.). First we note that (2.5) gives b () 0 =s(, )=. Also from (2.5) we get, after changing the order of summation, 4 b() 2 & =(&) N i=2 2 (N&i)!\ i&2+ _s(n+&i, N+&2). (2.6) Using the ``triangular'' recurrence relation for the s(n, ) (see, e.g., [2, p. 24]), we obtain & 2 N b(n ) =(&) N i=0 Now we note that 2 (N&i)!\ i + [s(n+&i, N+&2) +(N&i) s(n&i, N+&2)] 2 =(&) { N 2 (N&i)!\ s(n+&i, N+&2) i + i= i= 2}2 (N&i)!\ i&+ s(n+&i, N+&2) =. (2.7) \ i + +2 \ i&+ + \ i&2+ = \ N i + + \ i&+ N = \N+ i + = N+&i\ N&i+ N. Hence with (2.6), (2.7) and (2.5) we obtain (2.), which was to be shown. (Note that the terms for i=0, in (2.6) and for i=0, 2+ in the last sum in (2.7) all vanish). K 3. BERNOULLI POLYNOMIALS The Bernoulli polynomials B n (x) can be defined by the generating function te xt e t & = n=0 B n (x) tn, t <2?. (3.) n!
9 BERNOULLI NUMBERS 3 These polynomials satisfy a large number of identities (see e.g., [6, Ch. 50] or [9]), including the sum n =0\ n + B (x) B n& (y) =n(x+y&) B n& (x+y)&(n&) B n (x+y). (3.2) In this section we will generalize (3.2) to sums of products of N2 Bernoulli polynomials, and derive some consequences. In analogy to (2.3) we denote S N (n; x, x 2,..., x N ) = \ n j,..., j N+ B j (x ) B j2 (x 2 )}}}B jn (x N ), (3.3) where the sum is taen over all nonnegative integers j,..., j N such that j +}}}+j N =n. It is possible to proceed just as in Section 2. However, here we can mae use of the well-developed theory of higher-order Bernoulli polynomials B (N ) n ( y) defined by the generating function see, e.g., [0, p. 45 ff.]. Lemma 4. t N e yt (e t &) N= n=0 B (N) n (y) tn, t =2?; (3.4) n! Let y =x +x 2 +}}}+x n.then for nn we have S N (n; x,..., x N )=(&) N N+ \n _B (N) j (&) j\ j + (y) B n&j(y). (3.5) n&j Proof. In (3.) we replace x by x, x 2,..., x n and multiply these N expressions together. With (3.3) and (3.4) we immediately obtain S N (n; x,..., x N )=B (N) n (y)(x +x 2 +}}}+x N ). Now the right-hand side of (3.5) comes directly from Equation (87) in [0, p. 48]. K
10 32 KARL DILCHER Theorem 3. Let y=x +}}}+x n.then for nn we have S N (n; x,..., x N )=(&) N N+ \n _ { j =0\ N&j&+ (&) j + s(n, N&j+) y= B n&j(y). n&j (3.6) Proof. From Equation (52.2.2) in [6, p. 350] we obtain, after appropriate substitutions, \ j + B(N) j j (y)= Now (3.6) follows directly from (3.5). =0\ N&j&+ + s(n, N&j+) y. (3.7) Examples. (i) N=2 With s(2, 2)=, s(2, )=&, (3.6) immediately gives (3.2). (ii) N=3 With s(3, )=2, s(3, 2)=&3, and s(3, 3)= we obtain for n3 n! i! j!! B i(x) B j (y) B (z) = n(n&) 2 2 _\ x+ y+z&3 & 2+ 4& B n&2(x+y+z)&n(n&2) K _ 2+ \x+y+z&3 B n&(x+y+z)+ (n&)(n&2) B n (x+y+z), 2 (3.8) where the sum is taen over all nonnegative integers, i, j, with i+ j+=n. Corollary. If x +}}}+x N =0 then we have for nn S N (n; x,..., x N )=N N+ \n (&) &j s(n, N&j) B n&j n&j. (3.9) This follows immediately from (3.6) with y=0; note that B j (0)=B j.in particular, with x =x 2 =}}}=x N =0 the right-hand side of (3.9) gives an expression for \ n j,..., j N+ B j }}}B jn.
11 BERNOULLI NUMBERS 33 Compare with (2.4); the difference lies in the fact that the above sum includes B =& 2. Remar. For the special case of Bernoulli numbers, i.e., when x =}}}=x N =y=0, the identity (3.9) (or (3.6)) was proved by Vandiver [5, Eq. (40)]. The equation (3.5) in this particular case occurs in [5] as identity (42). Apart from formulas for `(2n), such as (.6) and its generalizations, Sitaramachandrarao and Davis [3] also deal with formulas involving the alternating sums (in the notation of []) For instance, they show that n& j= '(n) = = (&) &. (3.0) n '(2j) '(2n&2j)=(n& 2) `(2n)&'(2n), (3.) and a formula for a sum of products of 3 factors. Using Theorem 3, we can easily generalize this to any number of factors. Theorem 4. For 2nN we have (&)N+n& (2?) 2n '(2j )}}}'(2j N )= ()! (2n&N)! 2 N [()2] _ { 2j =0\ N&2j&+ + s(n, N&2j+) \ N 2+ = _ B 2n&2j(N2), (3.2) 2n&2j with the convention '(0)= 2, and the sum on the left-hand side taen over all nonnegative integers j,..., j N with j +}}}+j N =n. Proof. From the definition (3.0) it is clear that for n> we have '(n)=(&2 &n ) `(n), (3.3) and with Euler's formula (.5) and the well-nown identity B n ( 2)=&(&2 &n ) B n (see, e.g., [, p. 805]) we obtain '(2n)=(&) n (2?)2n 2(2n)! B 2n\ 2+. (3.4)
12 34 KARL DILCHER Hence we use Theorem 3 (or Lemma 4) with x =}}}=x N = 2, so that y=n2. With (3.4) we have B (N) j \ N 2+ t j j! = tn e Nt2 (e t &) N= t N (e t2 &e &t2 ) N, and from this it is clear that the generating function is an even function; hence we have B (N ) j (N2)=0 for odd j. Now (3.2) follows directly from (3.5) and (3.6). K Remar. The right-hand side of (3.2) can be written again in terms of '(2n) or`(2n). Indeed, the well-nown difference equation B n (x+)&b n (x) =nx n& (see e.g., [, p. 804]) implies for N even, and B 2n&2j\ N (N2)& 2+ =(2n&2j) B 2n&2j\ N [N2]& 2+ =(2n&2j) =0 \ for N odd. Now use (.5), resp. (3.4) = 2n&2j& +B 2n&2j 2n&2j& + +B 2+ 2n&2j\ 2+ Example. (.5) give N=2. Note that s(2, 2)= and B 2n ()=B 2n. Then (3.2) and n '(2j) '(2n&2j)=(n& 2 ) `(2n). This is equivalent to (3.) (via '(0)= 2 ). 4. EULER NUMBERS AND POLYNOMIALS In complete analogy to the method of Section 3 one can obtain results concerning the Euler polynomials. They are defined by the generating function 2 e t + ext = n=0 E n (x) tn, t <? (4.) n!
13 BERNOULLI NUMBERS 35 (see, e.g., [, p. 804]). Again, many identities are nown; see, e.g., [9] or [6, Ch. 5]. For instance, we have in analogy to (3.2), n =0\ n + E (x) E n& (y)=2(&x&y) E n (x+y)+2e n+ (x+y). (4.2) In analogy to (3.3) and (2.3) we denote T N (n; x,..., x N )= \ n j,..., j N+ E j (x )}}}E jn (x N ), (4.3) where the sum is again taen over all nonnegative integers j,..., j N such that j +}}}+j N =n. We use the nth order Euler polynomials defined by \ 2 N e ++ t e yt = n=0 E (N) n (y) tn, t <?, (4.4) n! (see, e.g., [9, p. 43 ff.]). The following lemma and theorem are proved in complete analogy to Lemma 4 and Theorem 3. Here Equation (88) in [0, p. 48] is used. Lemma 5. Let y=x +}}}+x N.Then for nn we have T N (n; x,..., x N )= 2 ()! (&) j\ j + B(N) j (y) E n+&j (y). (4.5) Theorem 5. Let y=x +}}}+x N.Then for nn we have T N (n; x,..., x N )= 2 ()! (&) j _ { j =0\ N&j&+ s(n, N&j+) + y= _E n+&j (y). (4.6) The Euler numbers are defined by the generating function 2 e t +e &t= n=0 It follows from a comparison with (4.) that t n E n, t <?2. (4.7) n! E n ( 2 )=2&n E n. (4.8)
14 36 KARL DILCHER The left-hand side of (4.7) is an even function. Hence the odd-index Euler numbers are zero, and we have E 2n ( 2 )=2&2n E 2n, E 2n+ ( 2 )=0. If we now use (4.5) and (4.6) with x =}}}=x n = 2 and use the fact that (N2)=0 for odd j, we obtain the following result. B (N ) j Theorem 6. For 2nN we have \ 2n 2j,..., 2j N+ E 2j }}}E 2jN = 22n+ ()! [()2] { 2j =0\ N&2j&+ + s(n, N&2j+) \ N 2+ = _E 2n+&2j\ N 2+. (4.9) Remar. The case N=3 was recently considered by Zhang [7]. Another sum dealt with in [3] is (in the notation of [, p. 807]) It is nown that ;(n) = =0 (&) (2+) n. ;(2n+)=(&) n (?2)2n+ 2(2n)! E 2n (4.0) (see, e.g., [, p. 807]). With this and (4.9) we can easily obtain an expression for j +}}}+j N =n ;(2j +) }}} ;(2j +). (4.) The right-hand side of (4.9) can be written in terms of ;( j) or `( j), depending on the parity of N. Indeed, the difference equation E & (x+)+e & (x)=2x & gives upon repeated application E &\ N [N2] 2+ =2 = &\ (&) N & 2 & +(&) + [N2] E &\ N 2 & _ N 2&+. (4.2)
15 BERNOULLI NUMBERS 37 Now for odd N, (4.8) and (4.0) give the appropriate ;( j), while for even N we use the formula E & (0)=&2 2&+ & B &+ &+, & (4.3) (see, e.g., [, p. 805]) and Euler's formula (.5). A further obvious consequence of (4.6) is obtained when y=0. Upon changing the order of summation we get the following Corollary 2. If x +x 2 +}}}+x N =0 then we have for nn, T N (n; x,..., x N )= (&2) ()! (&) j s(n, j+) E n+j (0). (4.4) This corollary allows us to deal with yet another class of series related to the Riemann zeta function, some results for which were proved in [3]. Using the notation of [, p. 807], we define *(s)= =0 With (.5) and (4.3) we immediately obtain In [3] it was shown that i+j+=n i, j, (2+) s=(&2&s ) `(s), s>. (4.5)? 2n *(2n)=(&) n 4(2n&)! E 2n&(0). (4.6) *(2i) *(2j) *(2)= (n&)(2n&) *(2n)&?2 *(2n&2). (4.7) 4 6 We will now prove an extension to an arbitrary number of factors. Theorem 7. For mn we have *(2 )} }}} }*(2 N )= 2&N (2m&N)! [()2] (&) j? 2j (2m&2j&)! _ { 2j =0\ N s(n&, N&2j) *(2m&2j) (4.8) + 2 (&)!= where the sum on the left-hand side is taen over all positive integers,..., N, with +}}}+ N =m.
16 38 KARL DILCHER Proof. We use (4.4) with x =}}}=x N =0. To simplify notation, we set T N (n) =T N (n; 0,..., 0) (see (4.3)), and denote by T N(n) the sum T N (n) with all those summands removed for which at least one of j,..., j N is zero. Since by (4.) we have E 0 (0)=, the inclusion-exclusion principle (see, e.g., [2, p. 76 ff]) gives T N(n)=T N (n)& \N + T (n)+ \N 2+ T N&2(n)+}}} = =0 (&) \ N + T N&(n). Using (4.4) and changing the order of summation, we obtain T N(n)= =0 = (&) &j (&) j \ N + (&2)N&& (N&&)! =0 (&) N&& (&) j s(n&, j+) E n+j (0) \ N + (&2)N&& (N&&)! s(n&, j+) E n+j(0). We reverse the order of summation in the first sum and obtain T N(n)= j (&) +j =0 (&) \ N + (&2)N&& (N&&)! _s(n&, N&j) E n+&j (0). (4.9) First we consider the left-hand side of (4.9). By (4.3) and the fact that B 2n+ =0 for n it is clear that E 2n (0)=0 for n. Let j i =2 i & for i=, 2,..., N. Then n= j +}}}+j N =2( +}}}+ N )&N or equivalently 2( +}}}+ N )=n+n. Now we use (4.6) with n replaced by,..., N. Then (n+n)2 n!22n T N(n)=(&)? *(2 )} }}} }*(2 n+n N ), where the sum is taen over all positive integers,..., N with +}}}+ N =(n+n)2. If we set n+n=2m, then m (2m&N)! 4N T N(n)=(&) *(2? 2m )} }}} }*(2 N ), (4.20) where +}}}+ N =m, i (i=,..., N ).
17 BERNOULLI NUMBERS 39 To deal with the right-hand side of (4.9), we recall that E 2n (0)=0 for n; then [()2] T N(n)=(&) 2j =0 (&) \ N + (&2)N&& (N&&)! _s(n&, N&2j) E 2m&2j& (0). (4.2) Finally we use (4.6) with n replaced by m& j; then (4.20) combined with (4.2) gives (4.8). K Examples. (i) With N=2 we get immediately m& = *(2) *(2m&2)=(m& 2 ) *(2m) (see also [3, p. 80]). For N=3 we obtain (4.7) if we note that s(3, )=2, s(2, )=&, s(, )=. (ii) N=4 With s(4, 2)=, s(3, 2)=&3, s(2, 2)= we get the first apparently new formula *(2 )}}}*(2 4 )= 8\ 2m& 3 + *(2m)&?2 (2m&3) *(2m&2), 24 where +}}}+ 4 =m, i. 5. ADDITIONAL REMARKS. Theorem with Lemma 3 can also be proved with (3.9), by careful use of the inclusion-exclusion principle to tae care of the case B =& 2. This would be similar to the proof of Theorem 7, and would be somewhat shorter than the proof in Section. However, Theorem 2 cannot be obtained in this way. On the other hand, the method of Section could probably be used to prove the results in Sections 24, including analogues to Theorem Sums similar to the ones treated in this paper have occured in connection with the study of the Riemann zeta function at odd positive integer arguments. In particular, the well-nown formula (.2) occurs in [4], and the sum n 2n (&) j\ 2j+ B 2j B 2n&2j (5.)
18 40 KARL DILCHER occurs in the main result of [4]. A closed form for this alternating sum does not appear to be nown. Finally, a sum very similar to (2.3) plays a fundamental role in [3]; for each integer r>2, `(r) is shown to be an infinite series involving A 2m (r&2), where 2m A 2m \ 2i,..., 2i (r) = r+ B 2i }}}}}B 2ir [2i +][2(i +i 2 )+] } }}} }[2(i +i 2 +}}}+i r& )+], with the summation as in (2.3). In spite of the similarlity to the sum (2.3), it does not appear to be possible to treat this sum with the methods of the present paper. 3. Both Bernoulli and Euler numbers are special cases of the generalized Bernoulli numbers B n / belonging to a residue class character /. It may be of interest to have formulas of the type (.2), and possibly of type (2.4), also for generalized Bernoulli numbers. We note that the corresponding alternating sum (of type (5.)) occurs in [5], again in connection with integer values of the Riemann zeta function. 4. It is clear (via (.5)) that Theorem gives a formula for the sum j +}}}+j N =n `(2j )} }}} }`(2j N ), (5.2) with nonnegative integers j,..., j N and with the convention `(0)=& 2. The product `(2j )} }}} }`(2j N ) is obviously related to the multiple sum A( j,..., j N )= n >n 2 >}}}>n N (see [8]) and the sum (5.2) corresponds to j +}}}+j N =n n j n j 2 }}}}}n j 2 A(j,..., j N ), (5.3) with positive integers j,..., j N, and j >. It was conjetured by C. Moen that the sum (5.3) is equal to `(n) for all n and N<n; see [8], where this was verified for n6. 5. The following interesting ``inverse problem'' was discussed in [7] Given an integer and a sequence [s n ] with s n {0 for some n, is there a sequence [r ] such that n! s n = i!i 2!}}}i! r i r i2 }}}r i? i +}}}+i =n
19 BERNOULLI NUMBERS 4 Hauanen [7] proved that this is the case if and only if the least n for which s n {0 is a nonnegative multiple of ; similarly for s n = i +}}}+i =n r i r i2 }}}r i. Solutions to these questions are called th roots of [s n ] under the binomial, respectively the usual convolution. ACKNOWLEDGMENTS This paper was prepared while the author was visiting the Institut fu r Mathemati of the Technische Universita t Clausthal (Germany). The author thans the members of the Institut for their hospitality. REFERENCES. M. Abramowitz and I. A. Stegun, ``Handboo of Mathematical Functions,'' National Bureau of Standards, Washington, DC, L. Comtet, ``Advanced Combinatorics,'' Reidel, Dordrecht, J. A. Ewell, On values of the Riemann zeta function at integral arguments, Canad. Math. Bull. 34, No. (99), E. Grosswald, Die Werte der Riemannschen Zetafuntion an ungeraden Argumentstellen, Nachr. Aad. Wiss. Go ttingen Math. Phys. Kl. II (970), E. Grosswald, Remars concerning the values of the Riemann zeta function at integral, odd arguments, J. Number Theory 4 (972), E. R. Hansen, ``A Table of Series and Products,'' PrenticeHall, Englewood Cliffs, NJ, P. Hauanen, Roots of sequences under convolution, Fibonacci Quart. 32, No. 4 (994), M. Hoffmann, Multiple harmonic series, Pacific J. Math. 52, No. 2 (992), N. E. No rlund, Me moire sur les polynomes de Bernoulli, Acta Math. 43 (922), N. E. No rlund, ``Differenzenrechnung,'' Springer-Verlag, Berlin, K. Ramachandra and A. Sanaranarayanan, A remar on `(2n), Indian J. Pure Appl. Math. 8, No. 0 (987), A. Sanaranarayanan, An identity involving Riemann zeta function, Indian J. Pure Appl. Math. 8, No. 7 (987), R. Sitaramachandrarao and B. Davis, Some identities involving the Riemann zeta function, II, Indian J. Pure Appl. Math. 7, No. 0 (986), E. Y. State, A one-sided summatory function, Proc. Amer. Math. Soc. 60 (976), H. S. Vandiver, An arithmetical theory of the Bernoulli numbers, Trans. Amer. Math. Soc. 5 (942), W. P. Zhang, On the several identities of Riemann zeta-function, Chinese Sci. Bull. 36, No. 22 (99), W. P. Zhang, Some identities for Euler numbers (Chinese), J. Northwest Univ. 22, No. (992), 720.
On Tornheim s double series
ACTA ARITHMETICA LXXV.2 (1996 On Tornheim s double series by James G. Huard (Buffalo, N.Y., Kenneth S. Williams (Ottawa, Ont. and Zhang Nan-Yue (Beijing 1. Introduction. We call the double infinite series
More informationOn Tornheim's double series
ACTA ARITHMETICA LXXV.2 (1996) On Tornheim's double series JAMES G. HUARD (Buffalo, N.Y.), KENNETH S. WILLIAMS (Ottawa, Ont.) and ZHANG NAN-YUE (Beijing) 1. Introduction. We call the double infinite series
More informationMATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2
MATH 80: ENUMERATIVE COMBINATORICS ASSIGNMENT KANNAPPAN SAMPATH Facts Recall that, the Stirling number S(, n of the second ind is defined as the number of partitions of a [] into n non-empty blocs. We
More informationSome Congruences for the Partial Bell Polynomials
3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics
More informationB n (x) zn n! n=0. E n (x) zn n! n=0
UDC 517.9 Q.-M. Luo Chongqing Normal Univ., China) q-apostol EULER POLYNOMIALS AND q-alternating SUMS* q-полiноми АПОСТОЛА ЕЙЛЕРА ТА q-знакозмiннi СУМИ We establish the basic properties generating functions
More informationMATRIX REPRESENTATIONS FOR MULTIPLICATIVE NESTED SUMS. 1. Introduction. The harmonic sums, defined by [BK99, eq. 4, p. 1] sign (i 1 ) n 1 (N) :=
MATRIX REPRESENTATIONS FOR MULTIPLICATIVE NESTED SUMS LIN JIU AND DIANE YAHUI SHI* Abstract We study the multiplicative nested sums which are generalizations of the harmonic sums and provide a calculation
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 informationLinear transformations preserving the strong q-log-convexity of polynomials
Linear transformations preserving the strong q-log-convexity of polynomials Bao-Xuan Zhu School of Mathematics and Statistics Jiangsu Normal University Xuzhou, PR China bxzhu@jsnueducn Hua Sun College
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
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 RESULTS ON q-analogue OF THE BERNOULLI, EULER AND FIBONACCI MATRICES
SOME RESULTS ON -ANALOGUE OF THE BERNOULLI, EULER AND FIBONACCI MATRICES GERALDINE M. INFANTE, JOSÉ L. RAMÍREZ and ADEM ŞAHİN Communicated by Alexandru Zaharescu In this article, we study -analogues of
More informationHYPERGEOMETRIC BERNOULLI POLYNOMIALS AND APPELL SEQUENCES
HYPERGEOMETRIC BERNOULLI POLYNOMIALS AND APPELL SEQUENCES ABDUL HASSEN AND HIEU D. NGUYEN Abstract. There are two analytic approaches to Bernoulli polynomials B n(x): either by way of the generating function
More informationOn Certain Sums of Stirling Numbers with Binomial Coefficients
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015, Article 15.9.6 On Certain Sums of Stirling Numbers with Binomial Coefficients H. W. Gould Department of Mathematics West Virginia University
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 informationLinear Recurrence Relations for Sums of Products of Two Terms
Linear Recurrence Relations for Sums of Products of Two Terms Yan-Ping Mu College of Science, Tianjin University of Technology Tianjin 300384, P.R. China yanping.mu@gmail.com Submitted: Dec 27, 2010; Accepted:
More informationGeneralized Akiyama-Tanigawa Algorithm for Hypersums of Powers of Integers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 16 (2013, Article 1332 Generalized Aiyama-Tanigawa Algorithm for Hypersums of Powers of Integers José Luis Cereceda Distrito Telefónica, Edificio Este
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 informationApplications of Riordan matrix functions to Bernoulli and Euler polynomials
Illinois Wesleyan University From the SelectedWors of Tian-Xiao He 06 Applications of Riordan matrix functions to Bernoulli and Euler polynomials Tian-Xiao He Available at: https://worsbepresscom/tian_xiao_he/78/
More informationTakao Komatsu School of Mathematics and Statistics, Wuhan University
Degenerate Bernoulli polynomials and poly-cauchy polynomials Takao Komatsu School of Mathematics and Statistics, Wuhan University 1 Introduction Carlitz [6, 7] defined the degenerate Bernoulli polynomials
More informationarxiv: v4 [math.nt] 31 Jul 2017
SERIES REPRESENTATION OF POWER FUNCTION arxiv:1603.02468v4 [math.nt] 31 Jul 2017 KOLOSOV PETRO Abstract. In this paper described numerical expansion of natural-valued power function x n, in point x = x
More informationPolynomials Characterizing Hyper b-ary Representations
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.4.3 Polynomials Characterizing Hyper -ary Representations Karl Dilcher 1 Department of Mathematics and Statistics Dalhousie University
More informationRevisit nonlinear differential equations associated with Bernoulli numbers of the second kind
Global Journal of Pure Applied Mathematics. ISSN 0973-768 Volume 2, Number 2 (206), pp. 893-90 Research India Publications http://www.ripublication.com/gjpam.htm Revisit nonlinear differential equations
More informationPolyGamma Functions of Negative Order
Carnegie Mellon University Research Showcase @ CMU Computer Science Department School of Computer Science -998 PolyGamma Functions of Negative Order Victor S. Adamchik Carnegie Mellon University Follow
More informationOn Some Properties of Bivariate Fibonacci and Lucas Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.2.6 On Some Properties of Bivariate Fibonacci and Lucas Polynomials Hacène Belbachir 1 and Farid Bencherif 2 USTHB/Faculty of Mathematics
More informationTransformations Preserving the Hankel Transform
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 10 (2007), Article 0773 Transformations Preserving the Hankel Transform Christopher French Department of Mathematics and Statistics Grinnell College Grinnell,
More informationw = X ^ = ^ ^, (i*i < ix
A SUMMATION FORMULA FOR POWER SERIES USING EULERIAN FRACTIONS* Xinghua Wang Math. Department, Zhejiang University, Hangzhou 310028, China Leetsch C. Hsu Math. Institute, Dalian University of Technology,
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 informationSome new representation problems involving primes
A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationExplicit formulas for computing Bernoulli numbers of the second kind and Stirling numbers of the first kind
Filomat 28:2 (24), 39 327 DOI.2298/FIL4239O Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Explicit formulas for computing Bernoulli
More informationDefinition: A sequence is a function from a subset of the integers (usually either the set
Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset
More informationThe Fibonacci sequence modulo π, chaos and some rational recursive equations
J. Math. Anal. Appl. 310 (2005) 506 517 www.elsevier.com/locate/jmaa The Fibonacci sequence modulo π chaos and some rational recursive equations Mohamed Ben H. Rhouma Department of Mathematics and Statistics
More informationOn Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers
A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
More informationPOLYNOMIAL SOLUTIONS OF PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS
J. London Math. Soc. 67 (2003) 16 28 C 2003 London Mathematical Society DOI: 10.1112/S002461070200371X POLYNOMIAL SOLUTIONS OF PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS J. MCLAUGHLIN
More informationArithmetic properties of lacunary sums of binomial coefficients
Arithmetic properties of lacunary sums of binomial coefficients Tamás Mathematics Department Occidental College 29th Journées Arithmétiques JA2015, July 6-10, 2015 Arithmetic properties of lacunary sums
More informationAn example of generalization of the Bernoulli numbers and polynomials to any dimension
An example of generalization of the Bernoulli numbers and polynomials to any dimension Olivier Bouillot, Villebon-Georges Charpak institute, France C.A.L.I.N. team seminary. Tuesday, 29 th March 26. Introduction
More informationCOMPOSITIONS, PARTITIONS, AND FIBONACCI NUMBERS
COMPOSITIONS PARTITIONS AND FIBONACCI NUMBERS ANDREW V. SILLS Abstract. A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions
More informationMULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng
Indian J. pure appl. Math., 39(: 37-55, April 008 c Printed in India. MULTISECTION METHOD AND FURTHER FORMULAE FOR π De-Yin Zheng Department of Mathematics, Hangzhou Normal University, Hangzhou 30036,
More informationOn the Irrationality of Z (1/(qn+r))
JOURNAL OF NUMBER THEORY 37, 253-259 (1991) On the Irrationality of Z (1/(qn+r)) PETER B. BORWEIN* Department of Mathematics, Statistics, and Computing Science, Dalhousie University, Halifax, Nova Scotia,
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics ASYMPTOTIC EXPANSION OF THE EQUIPOISE CURVE OF A POLYNOMIAL INEQUALITY ROGER B. EGGLETON AND WILLIAM P. GALVIN Department of Mathematics Illinois
More informationTwo finite forms of Watson s quintuple product identity and matrix inversion
Two finite forms of Watson s uintuple product identity and matrix inversion X. Ma Department of Mathematics SuZhou University, SuZhou 215006, P.R.China Submitted: Jan 24, 2006; Accepted: May 27, 2006;
More informationK. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada D. Patterson
#A21 INTEGERS 11 (2011) PROJECTIVE P -ORDERINGS AND HOMOGENEOUS INTEGER-VALUED POLYNOMIALS K. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada johnson@mathstat.dal.ca
More informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationNOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials
NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written
More information*!5(/i,*)=t(-i)*-, fty.
ON THE DIVISIBILITY BY 2 OF THE STIRLING NUMBERS OF THE SECOND KIND T* Lengyel Occidental College, 1600 Campus Road., Los Angeles, CA 90041 {Submitted August 1992) 1. INTRODUCTION In this paper we characterize
More informationEXPLICIT INVERSE OF THE PASCAL MATRIX PLUS ONE
EXPLICIT INVERSE OF THE PASCAL MATRIX PLUS ONE SHENG-LIANG YANG AND ZHONG-KUI LIU Received 5 June 005; Revised September 005; Accepted 5 December 005 This paper presents a simple approach to invert the
More informationNew Multiple Harmonic Sum Identities
New Multiple Harmonic Sum Identities Helmut Prodinger Department of Mathematics University of Stellenbosch 760 Stellenbosch, South Africa hproding@sun.ac.za Roberto Tauraso Dipartimento di Matematica Università
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 informationLaura Chihara* and Dennis Stanton**
ZEROS OF GENERALIZED KRAWTCHOUK POLYNOMIALS Laura Chihara* and Dennis Stanton** Abstract. The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given.
More informationDiscrete Mathematics. Kishore Kothapalli
Discrete Mathematics Kishore Kothapalli 2 Chapter 4 Advanced Counting Techniques In the previous chapter we studied various techniques for counting and enumeration. However, there are several interesting
More informationHypergeometric series and the Riemann zeta function
ACTA ARITHMETICA LXXXII.2 (997) Hypergeometric series and the Riemann zeta function by Wenchang Chu (Roma) For infinite series related to the Riemann zeta function, De Doelder [4] established numerous
More informationResearch Article On Maslanka s Representation for the Riemann Zeta Function
International Mathematics and Mathematical Sciences Volume 200, Article ID 7447, 9 pages doi:0.55/200/7447 Research Article On Maslana s Representation for the Riemann Zeta Function Luis Báez-Duarte Departamento
More informationDeterminants of Partition Matrices
journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationA LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS
Applicable Analysis and Discrete Mathematics, 1 (27, 371 385. Available electronically at http://pefmath.etf.bg.ac.yu A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS H. W. Gould, Jocelyn
More informationSOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE
SOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE Abstract. We provide irreducibility criteria for multivariate
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationA q-analogue OF THE GENERALIZED FACTORIAL NUMBERS
J. Korean Math. Soc. 47 (2010), No. 3, pp. 645 657 DOI 10.4134/JKMS.2010.47.3.645 A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS Seok-Zun Song, Gi-Sang Cheon, Young-Bae Jun, and LeRoy B. Beasley Abstract.
More informationMEAN SQUARE ESTIMATE FOR RELATIVELY SHORT EXPONENTIAL SUMS INVOLVING FOURIER COEFFICIENTS OF CUSP FORMS
Annales Academiæ Scientiarum Fennicæ athematica Volumen 40, 2015, 385 395 EAN SQUARE ESTIATE FOR RELATIVELY SHORT EXPONENTIAL SUS INVOLVING FOURIER COEFFICIENTS OF CUSP FORS Anne-aria Ernvall-Hytönen University
More informationA Note on Extended Binomial Coefficients
A Note on Extended Binomial Coefficients Thorsten Neuschel arxiv:407.749v [math.co] 8 Jul 04 Abstract We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion
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 informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationSOME LINEAR RECURRENCES WITH CONSTANT COEFFICIENTS
SOME LINEAR RECURRENCES WITH CONSTANT COEFFICIENTS RICHARD J MATHAR Abstract Linear homogeneous s-order recurrences with constant coefficients of the form a(n) d a(n ) + d 2 a(n 2) + + d sa(n s), n n r,
More informationChebyshev polynomials, quadratic surds and a variation of Pascal s triangle
Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle Roland Bacher To cite this version: Roland Bacher. Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle.
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
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 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 informationOn certain generalized q-appell polynomial expansions
doi: 101515/umcsmath-2015-0004 ANNALES UNIVERSITATIS MARIAE CURIE-SKŁODOWSKA LUBLIN POLONIA VOL LXVIII, NO 2, 2014 SECTIO A 27 50 THOMAS ERNST On certain generalized -Appell polynomial expansions Abstract
More informationSome Fun with Divergent Series
Some Fun with Divergent Series 1. Preliminary Results We begin by examining the (divergent) infinite series S 1 = 1 + 2 + 3 + 4 + 5 + 6 + = k=1 k S 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + = k=1 k 2 (i)
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS
Hacettepe Journal of Mathematics and Statistics Volume 8() (009), 65 75 ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS Dursun Tascı Received 09:0 :009 : Accepted 04 :05 :009 Abstract In this paper we
More informationA Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)!
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.3 A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)! Ira M. Gessel 1 and Guoce Xin Department of Mathematics Brandeis
More informationFibonacci and Lucas Identities the Golden Way
Fibonacci Lucas Identities the Golden Way Kunle Adegoe adegoe00@gmail.com arxiv:1810.12115v1 [math.nt] 25 Oct 2018 Department of Physics Engineering Physics, Obafemi Awolowo University, 220005 Ile-Ife,
More informationBeukers integrals and Apéry s recurrences
2 3 47 6 23 Journal of Integer Sequences, Vol. 8 (25), Article 5.. Beukers integrals and Apéry s recurrences Lalit Jain Faculty of Mathematics University of Waterloo Waterloo, Ontario N2L 3G CANADA lkjain@uwaterloo.ca
More informationPOLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS arxiv: v1 [math.nt] 27 Dec 2018
POLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS arxiv:1812.10828v1 [math.nt] 27 Dec 2018 J. MC LAUGHLIN Abstract. Finding polynomial solutions to Pell s equation
More informationA196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers
Karlsruhe October 14, 2011 November 1, 2011 A196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers Wolfdieter L a n g 1 The sum of the k th power of the first n positive
More informationarxiv: v3 [math.nt] 9 May 2011
ON HARMONIC SUMS AND ALTERNATING EULER SUMS arxiv:02.592v3 [math.nt] 9 May 20 ZHONG-HUA LI Department of Mathematics, Tongji University, No. 239 Siping Road, Shanghai 200092, China Graduate School of Mathematical
More informationA Symbolic Operator Approach to Power Series Transformation-Expansion Formulas
A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas Tian- Xiao He Department of Mathematics and Computer Science Illinois Wesleyan University Bloomington, IL 61702-2900, USA
More informationParametric Euler Sum Identities
Parametric Euler Sum Identities David Borwein, Jonathan M. Borwein, and David M. Bradley September 23, 2004 Introduction A somewhat unlikely-looking identity is n n nn x m m x n n 2 n x, valid for all
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
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 informationStudy Guide for Math 095
Study Guide for Math 095 David G. Radcliffe November 7, 1994 1 The Real Number System Writing a fraction in lowest terms. 1. Find the largest number that will divide into both the numerator and the denominator.
More information{~}) n -'R 1 {n, 3, X)RU, k, A) = {J (" J. j =0
2l WEIGHTED STIRLING NUMBERS OF THE FIRST AND SECOND KIND II [Oct. 6. CONCLUSION We have proven a number-theoretical problem about a sequence, which is a computer-oriented type, but cannot be solved by
More informationMATHEMATICS OF COMPUTATION, VOLUME 26, NUMBER 118, APRIL An Algorithm for Computing Logarithms. and Arctangents. By B. C.
MATHEMATICS OF COMPUTATION, VOLUME 26, NUMBER 118, APRIL 1972 An Algorithm for Computing Logarithms and Arctangents By B. C. Carlson Abstract. An iterative algorithm with fast convergence can be used to
More informationFractional part integral representation for derivatives of a function related to lnγ(x+1)
arxiv:.4257v2 [math-ph] 23 Aug 2 Fractional part integral representation for derivatives of a function related to lnγ(x+) For x > let Mark W. Coffey Department of Physics Colorado School of Mines Golden,
More informationDISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k
DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationarxiv: v2 [math.nt] 1 Nov 2018
WEIGHTED SUM FORMULAS OF MULTIPLE ZETA VALUES WITH EVEN ARGUMENTS arxiv:16106563v [mathnt] 1 Nov 018 ZHONGHUA LI AND CHEN QIN Abstract We prove a weighted sum formula of the zeta values at even arguments,
More informationThe generalized order-k Fibonacci Pell sequence by matrix methods
Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University
More informationPRIME-REPRESENTING FUNCTIONS
Acta Math. Hungar., 128 (4) (2010), 307 314. DOI: 10.1007/s10474-010-9191-x First published online March 18, 2010 PRIME-REPRESENTING FUNCTIONS K. MATOMÄKI Department of Mathematics, University of Turu,
More informationAlgorithms for Bernoulli and Related Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007, Article 07.5.4 Algoriths for Bernoulli Related Polynoials Ayhan Dil, Veli Kurt Mehet Cenci Departent of Matheatics Adeniz University Antalya,
More informationSMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS. Kai Diethelm. Abstract
SMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS Kai Diethelm Abstract Dedicated to Prof. Michele Caputo on the occasion of his 8th birthday We consider ordinary fractional
More information