Suppose that we are given 12 points evenly spaced on a circle. Starting from a point in the 12 o’clock position, a particle P will move to one of the adjacent positions with equal probably, 1/2. P stops if it visits all 12 points. What is the most likely point that P stops for the last?

The best solution was submitted by Ha, Seokmin (하석민, 수리과학과 2017학번). Congratulations!

Here is his solution of problem 2018-18.

An alternative solution was submitted by 채지석 (수리과학과 2016학번, +3).

For \( a > b > 0 \), find the value of
\[
\int_0^{\infty} \frac{e^{ax} – e^{bx}}{x(e^{ax}+1)(e^{bx}+1)} dx.
\]

The best solution was submitted by Ha, Seokmin (하석민, 수리과학과 2017학번). Congratulations!

Here is his solution of problem 2018-17.

Alternative solutions were submitted by 길현준 (2018학번, +3), 김태균 (수리과학과 2016학번, +3, solution), 이본우 (수리과학과 2017학번, +3), 채지석 (수리과학과 2016학번, +3), 서준영 (수리과학과 대학원생, +3), 이재우 (함양고등학교 3학년, +3).

Find the minimum \(m\) (if it exists) such that every convex function \(f:[-1,1]\to[-1,1]\) has a constant \(c\) such that \[ \int_{-1}^1 \lvert f(x)-c\rvert \,dx \le m.\]

The best solution was submitted by Daeseok Lee (이대석, 수리과학과 2017학번). Congratulations!

Here is his solution of problem 2018-16.

Alternative solutions were submitted by 이본우 (수리과학과 2017학번, +3), 이재우 (함양고등학교 3학년, +2).

Let \( n \) be a positive integer. Suppose that \( a_1, a_2, \dots, a_n \) are non-zero integers and \( b_1, b_2, \dots, b_n\) are positive integers such that \( (b_i, b_n) = 1 \) for \( i = 1, 2, \dots, n-1 \). Prove that the Diophantine equation
\[
a_1 x_1^{b_1} + a_2 x_2^{b_2} + \dots + a_n x_n^{b_n} = 0
\]
has infinitely many integer solutions \( (x_1, x_2, \dots, x_n) \).

The best solution was submitted by Chae, Jiseok (채지석, 수리과학과 2016학번). Congratulations!

Here is his solution of problem 2018-15.

An alternative solution was submitted by Saba Dzmanashvili (수리과학과 2017학번, +3), 강한필 (전산학부 2016학번, +3), 권홍 (중앙대 물리학과, +3), 이본우 (수리과학과 2017학번, +3), 이재우 (함양고등학교 3학년, +3), 최백규 (생명과학과 2016학번, +3), 길현준 (2018학번, +2), 김태균 (수리과학과 2016학번, +2).