Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).
Human solution Solution 2 by Eric Naslund
We have that k=1∑∞(−1)k−1kA(k)=(k=1∑∞2k−1(−1)k−1)2=16π2.
Firstly, we would like to rearrange the terms in this series, but we have to be very careful in doing so as this is a conditionally convergent series. To do things rigorously, we have to truncate and take limits, and so define T(x)=k≤x∑(−1)k−1kA(k)
so that T=limx→∞T(x) is the series in question. Writing A(k)=d∣k,d oddd≤2k∑1
and switching the order of summation we obtain T(x)=k≤x∑k(−1)k−1d∣k,d oddd<2k∑1=d<2xd odd∑d2/2<k≤xd∣k∑k(−1)k−1=d<2xd odd∑d12d<k≤dx∑k(−1)k−1. Let S(x)=∑k≤xk(−1)k−1
and note that S(dx)=log2+O(xd). Hence T(x)=d≤2xd odd∑d1[S(dx)−S(2d)]=d≤2xd odd∑d1[log2−S(2d)]+O(x1) and so upon taking x→∞ we have that T=d odd∑d1k>2d∑k(−1)k−1=k=1∑∞k(−1)k−1d<2kd odd∑d1. Now, we can write this as 21k=1∑∞k(−1)k−1j=1∑k(2j−11+2k−(2j−1)1). Truncating the first sum at k=N, we have T=N→∞limj=1∑Nk=j∑N(2j−1)(2k−(2j−1))(−1)k−1.
Shifting the second sum to start at k=1, this becomes T=N→∞limj=1∑N(2j−1)(−1)j−1k=1∑N−j+1(2k−1)(−1)k−1=N→∞lim(j=1∑N(2j−1)(−1)j−1)2−N→∞limj=1∑N(2j−1)(−1)j−1N−j+2∑N(2k−1)(−1)k−1. Now, the second term goes to zero, and the first term is the square of the well known Leibniz series for π/4. Thus k=1∑∞(−1)k−1kA(k)=16π2.