Given a stick of length 1, we choose two points at random and break it into three pieces. Compute the probability that these three pieces form an acute triangle.

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

Here is his solution of problem 2018-10.

Alternative solutions were submitted by 고성훈 (2018학번, +3), 이종원 (수리과학과 2014학번, +3), 한준호 (수리과학과 2015학번, +3), 김태균 (수리과학과 2016학번, +2), 이본우 (수리과학과 2017학번, +2), 이준성 (상문고등학교 2학년, +2), Harrison Zhu (Imperial College London, +2).

For a positive integer \( n \), let \( S(n) \) be the sum of all decimal digits in \( n \), i.e., if \( n = n_1 n_2 \dots n_m \) is the decimal expansion of \( n \), then \( S(n) = n_1 + n_2 + \dots + n_m \). Find all positive integers \( n \) and \( r \) such that \( (S(n))^r = S(n^r) \).

The best solution was submitted by Lee, Jongwon (이종원, 수리과학과 2014학번). Congratulations!

Here is his solution of problem 2018-09.

Alternative solutions were submitted by 채지석 (수리과학과 2016학번, +3), 한준호 (수리과학과 2015학번, +3), 이본우 (수리과학과 2017학번, +3), 권홍 (중앙대 물리학과, +2).

Let \(a_1\), \(a_2\), \(\ldots\), \(a_m\) be distinct positive integers. Prove that if \(m>2\sqrt{N}\), then there exist \(i\), \(j\) such that the least common multiple of \(a_i\) and \(a_j\) is greater than \(N\).

The best solution was submitted by Bonwoo Lee (이본우, 수리과학과 2017학번). Congratulations!

Here is his solution of problem 2018-08.

Alternative solutions were submitted by 이종원 (수리과학과 2014학번, +3), 김태균 (수리과학과 2016학번, +3), 한준호 (수리과학과 2015학번, +3), 이재우 (함양고등학교 3학년, +3).

Let \( S \) be an \( (n+1) \times (n+1) \) matrix defined by
\[
S_{ij} = \begin{cases}
(n+1)-i & \text{ if } j=i+1, \\
i-1 & \text{ if } j=i-1, \\
0 & \text{ otherwise. }
\end{cases}
\]
Find all eigenvalues of \( S \).

The best solution was submitted by Lee, Jongwon (이종원, 수리과학과 2014학번). Congratulations!

Here is his solution of problem 2018-07.

Alternative solutions were submitted by 한준호 (수리과학과 2015학번, +3), 채지석 (수리과학과 2016학번, +3), Hitesh Kumar (Imperial College London, +2), 고성훈 (2018학번, +2).