• 検索結果がありません。

n=1 nk "3n n # 2n

N/A
N/A
Protected

Academic year: 2022

シェア "n=1 nk "3n n # 2n "

Copied!
6
0
0

読み込み中.... (全文を見る)

全文

(1)

AN EXPLICIT EVALUATION OF THE GOSPER SUM

Jorge Luis Cimadevilla Villacorta [email protected]

Received: 10/25/09, Revised: 4/4/10, Accepted: 5/12/10, Published: 10/8/10

Abstract

In this paper, we give a new method to derive a binomial series identity discovered by J.M. Borwein and R. Girgensohn.

– Dedicado a la memoria de Julia Villacorta

1. Introduction

The Gosper sum is defined by J.M. Borwein and R. Girgensohn as

b3(k) =!

n=1

nk

"3n n

# 2n

.

In a recent paper [3], Borwein and Girgensohn indicated that

b3(2) = π2 24 1

2ln22. (1)

This identity was later proved by N. Batir [2]. Batir showed using integrals that for

|x|<27/4, and integern≥2,

! k=1

xk k2

"3k k

# = 6 arctan2

$ 3

2φ(x)1

%

1

2ln2" φ3(x) + 1 (φ(x) + 1)3

#

, (2)

where

φ(x) =&272x+ 38112x 2x

'1/3 . By substitutingx= 1/2 in the above and the identities arctan(

π 144

)=2ϕ−13 and

ϕ3+1

(ϕ+1)3 = 12, whereϕ=φ(1/2) =*3

26 + 153,Batir deduced (1).

In the next section, we will present a generalization of (1). Our identity involves computations that seem to be less complicated than that of Batir.

(2)

INTEGERS: 10 (2010)

2. Main Theorem

Theorem 1. For−12 ≤t≤1, we have

! n=1

1 n2

"3n n

# t3n (1 +t)n =

! n=1

1 n2

" t 1 +t

#n

+2!

n=1

tn n2cos

$

narctan

$*(3−t)(1 +t) 1−t

%%

. (3)

Proof. We begin with the identity

(1−xf)(1−xg)(1−xh) = 1−x(f+g+h) +x2(f g+gh+f h)−x3f gh, (4) which is valid for all complex numbers x, f, g, h. Suppose f, g and h satisfy the relations

f+g+h=f gh, f g+gh+f h= 0.

Then

f = h+

1 +i√

3 + 4h2,

2(1 +h2) and g=h+

1−i√

3 + 4h2,

2(1 +h2) . (5) Substituting (5) into (4), we find that

(1−xh)

$ 1−x

$h+

1 +i√

3 + 4h2, 2(1 +h2)

%% $ 1−x

$h+

1−i√

3 + 4h2, 2(1 +h2)

%%

= 1 h3

1 +h2x(1 +x2). (6) We next replacexin (6) by−xand deduce that

(1 +xh)

$ 1 +x

$h+

1 +i√3 + 4h2, 2(1 +h2)

%% $ 1 +x

$h+

1−i√3 + 4h2, 2(1 +h2)

%%

= 1 + h3

1 +h2x(1 +x2). (7)

(3)

Multiplying (6) and (7), we obtain the identity (1−x2h2)

1−x2

$h+

1 +i√

3 + 4h2, 2(1 +h2)

%2

1−x2

$h+

1−i√

3 + 4h2, 2(1 +h2)

%2

= 1 h6

(1 +h2)2x2(1 +x2)2. (8) Next, we replaceh2 byhandx2by−xin (8) and rewrite (8) as

(1 +xh)

$

1 + xh (1 +h)

"

1 +i√3 + 4h 21 +h

#2%$

1 + xh (1 +h)

"

1−i√3 + 4h 21 +h

#2%

= 1 + h3

(1 +h)2x(1−x)2. (9) Writing

"

1 +i√3 + 4h 21 +h

#2

=eiarctan{3+4h/(1+2h)}, we deduce that

(1 +xh)

"

1 + xh

1 +heiarctan(4h+3/(1+2h))# "

1 + xh

1 +he−iarctan(4h+3/(1+2h))#

= 1 + h3

(1 +h)2x(1−x)2. (10) By taking the logarithm of both sides of (10), dividing byx, and then integrating over 0≤x≤1, we have

1 1 0

ln(1 +xh)

x dx+1 1 0

1 xln"

1 + xh

1 +heiarctan(4h+3/(1+2h))# dx +1 1

0

1 xln"

1 + xh

1 +he−iarctan(4h+3/(1+2h))# dx

=1 1 0

1 xln"

1 + h3

(1 +h)2x(1−x)2# dx

=

! n=1

(1)n+1 n

h3n (1 +h)2n

1 1 0

xn−1(1−x)2ndx. (11)

(4)

INTEGERS: 10 (2010)

In the left side of the last identity, the integration is valid for 12 ≤h≤1; in the right side the interval is 32[(21)13 (2 + 1)13]≤h≤3.

Using the result 1 1

0

xn−1(1−x)2ndx=(n1)!(2n)!

(3n)! = 1

n

"3n n

#,

and observing that 1 1

0

1 xln"

1 + xh

1 +heiarctan

!4h+3

1+2h

"# dx

=

! n=1

(1)n+1 n2

" h 1 +h

#n

×

"

cos

"

narctan

"4h+ 3 1 + 2h

##

+isin

"

narctan

"4h+ 3 1 + 2h

###

,

we deduce that

! n=1

(1)n+1

n2 hn+ 2!

n=1

(1)n+1 n2

"

h 1 +h

#n

cos"

narctan"4h+ 3 1 + 2h

##

=!

n=1

(1)n+1 n2

"3n n

# h3n (1 +h)2n.

If we set h/(1 +h) =−t in (11), then (3) follow. The left side of identity (3) can be write as:

! n=1

1 n2

"3n n

# t3n

(1 +t)n = t3

3(1 +t)·4F3

"

1,1,1,3 2;4

3,5

3,2; 4t3 27(1 +t)

#

where 4F3(a, b, c, d;e, f, g;z) is a hypergeometric function (see [1, Chapter 5] for the definition and properties). That implies the inequality |1+tt3 |< 274 or the more explicit result

3 2[(

21)13(

2 + 1)13]< t <3,

(5)

and in the case of the function2

n=1xncosnu

n2 ,whereuis a constant or a variable,

the radius of convergence is at least|x|≤1. !

Corollary 2Let t= 1. Then the series in (3)converges and we have

! n=1

1 n2

"1 2

#n

+ 2

! n=1

1 n2cos(

2

)=

! n=1

1 n2

"3n n

# 1

2n. (12)

Using Euler’s identity [4, pp. 39-41]

! n=1

1 n2

"1 2

#n

= π2 12 1

2(ln 2)2, and the identity

2!

n=1

1 n2cos(

2

)=−π2 24, we complete the proof of (1).

We can derive, using (3) and Batir’s evaluation, the next identity:

Corollary 3We have

6 arctan2

$

3 2φ(u)1

%

1

2ln2" φ3(u) + 1 (φ(u) + 1)3

#

=

! n=1

1 n2

" 12 cosu 2(1cosu)

#n

+ 2

! n=1

(12 cosu)n

n2 cosnu, (13)

where

φ(u) =

[27(1cosu)(12 cosu)3+3

81(1cosu)26(1cosu)(12 cosu)3]13

(12 cosu)

,

with the restriction 0cosu≤ 34.

AcknowledgementsThe author thanks Heng Huat Chan for his encouragement and his suggestions to improve the preliminary version of this article. The author also wishes to thank Diana Pereira for her support and encouragement.

(6)

INTEGERS: 10 (2010)

References

[1] M. Abramowitz and I.A. Stegun (Editors), Handbook of Mathematical Functions with For- mulas, Graphs, and Mathematical Tables, Dover, New York, 1972.

[2] N. Batir,On the series

! k=1

"

3k k

#−1

knxk, Proc. Indian Acad. Sci. (Math. Sci.)115(2005), 371-381.

[3] J.M. Borwein and R. Girgensohn,Evaluations of binomial series, Aequationes Math., 70 (2005) 25-36.

[4] L. Euler Euler,Opera Omnia, Ser. I, Vol. 14, Berlin, 1924.

参照

関連したドキュメント

STEGUN: Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables, USA National Bureau of Standards, Applied Math.. KARAMATA: Sur quelques problemes poses

The function g(n; h) seems to be worthy of study, not only because of its connections with known concepts in number theory, but also for the elegance of the formulas and identities

OPTIMAL PROBLEMS WITH DISCONTINUOUS INITIAL CONDITION.. systems governed by quasi-linear neutral differential equations with dis- continuous initial condition is considered.

Using congruences, second-order diophantine equations, and linear algebra, we iden- tify Jacobsthal and Jacobsthal-Lucas numbers that are also triangular

He was also awarded the Norbert Wiener Prize in 1975 from the American Mathematical Society and the Society for Industrial and Applied Mathematics.. In 1996 he was elected a member

In this paper, a new approach based on the mathematical programming technique is presented to model and solve the graceful labeling problem for different classes of graphs..

It is well known that in general Burkholder’s function (that is, the special function leading to a given martingale inequality) is not unique, see e.g.. Sometimes it is of interest

(Editors), Univalent Functions, Frac- tional Calculus and Their Applications, Jhon Wiley and Sons, New York, 1989. Department of Mathematics and Computer Science, Faculty of Science