Processing math: 0%

Problem 5 (due on Monday, November 4).

Let an=ni=1nj=1gcd where \gcd(i,j) is the greatest common divisor of i and j. Prove that the sequence a_n converges.

The problem was solved by Prof. Vladislav Kargin and Dr. Mathew Wolak (who submitted two solutions). The submitted solutions are similar to our two in-house solutions. For details see the following link Solution.