Problem 12120
(American Mathematical Monthly, Vol.126, June-July 2019) Proposed by M. Bataille (France).
For positive integers n and k with n ≥ k, let a(n, k) =Pk−1 j=0
n j3j. (a) Evaluate
n→∞lim 1 4n
n
X
k=1
a(n, k) k . (b) Evaluate
n→∞lim n 4nL −
n
X
k=1
a(n, k) k
!
where L is the limit in part (a).
Solution proposed by Roberto Tauraso, Dipartimento di Matematica, Universit`a di Roma “Tor Vergata”, via della Ricerca Scientifica, 00133 Roma, Italy.
Solution. We will prove a more general result: for x > 0 let An(x) :=Pn k=1
1 k
Pk−1 j=0
n
jxj then
n→∞lim
An(x) (x + 1)n = ln
1 + 1
x
and lim
n→∞n
(x + 1)nln
1 + 1
x
−An(x)
= 1 x. Therefore, for x = 3, the limits are: (a) ln(4/3) and (b) 1/3.
We first show that the following recurrence holds
A0(x) = 0 , An(x) = (x + 1)An−1(x) + 1
n for n ≥ 1.
We have that
An(x) − (x + 1)An−1(x) =
n
X
k=1
1 k
k−1
X
j=0
n j
xj−(x + 1)
n−1
X
k=1
1 k
k−1
X
j=0
n − 1 j
xj
= (x + 1)n−xn
n +
n−1
X
k=1
1 k
k−1
X
j=1
n − 1 j − 1
xj−
n−1
X
k=1
1 k
k−1
X
j=0
n − 1 j
xj+1
= (x + 1)n−xn
n +
n−1
X
k=1
1 k
k−1
X
j=1
n − 1 j − 1
xj−
n−1
X
k=1
1 k
k
X
j=1
n − 1 j − 1
xj
= (x + 1)n−xn
n −
n−1
X
k=1
1 k
n − 1 k − 1
xk= (x + 1)n−xn
n − 1
n
n−1
X
k=1
n k
xk
= (x + 1)n−xn
n −(1 + x)n−xn−1
n = 1
n. By the above recurrence, it follows that An(x) = (x + 1)nPn
k=1 1
k(x+1)k and the first limit is
n→∞lim
An(x) (x + 1)n =
∞
X
k=1
1
k(x + 1)k = ln 1 1 − x+11
!
= ln
1 + 1
x
. Finally, for the last limit, we use the Stolz-Cesaro Theorem,
n→∞lim n
(x + 1)nln
1 + 1
x
−An(x)
= lim
n→∞
ln 1 +x1
−Pn k=1 1
k(x+1)k 1
n(x+1)n SC= lim
n→∞
−(n+1)(x+1)1 n+1
1
(n+1)(x+1)n+1 −n(x+1)1 n
= lim
n→∞
1
−1 +n+1n (x + 1) = 1 x.