Category Archives: solution

Solution: 2016-21 Bound on the number of divisors

For a positive integer \( n \), let \( d(n) \) be the number of positive divisors of \( n \). Prove that, for any positive integer \( M \), there exists a constant \( C>0 \) such that \( d(n) \geq C ( \log n )^M \) for infinitely many \( n \).

The best solution was submitted by Kim, Taegyun (김태균, 2016학번). Congratulations!

Here is his solution of problem 2016-21.

Alternative solutions were submitted by 신준형 (수리과학과 2015학번, +3), 장기정 (수리과학과 2014학번, +3, alternative solution), 국윤범 (수리과학과 2015학번, +3), 이상민 (수리과학과 2014학번, +3), 윤준기 (전기및전자공학부 2014학번, +3), 이정환 (수리과학과 2015학번, +3), Ivan Adrian Koswara (전산학부 2013학번, +3), 조준영 (수리과학과 2012학번, +3), 이시우 (포항공대 수학과 2013학번, +3).

GD Star Rating
loading...

Solution: 2016-20 Finding a subspace

Let \(V_1,V_2,\ldots\) be countably many \(k\)-dimensional subspaces of \(\mathbb{R}^n\). Prove that there exists an \((n-k)\)-dimensional subspace \(W\) of \(\mathbb{R}^n\) such that \(\dim V_i\cap W=0\) for all \(i\).

The best solution was submitted by Shin, Joonhyung (신준형, 수리과학과 2015학번). Congratulations!

Here is his solution of problem 2016-20.

Alternative solutions were submitted by 김태균 (2016학번, +3), 국윤범 (수리과학과 2015학번, +3), 장기정 (수리과학과 2014학번, +3, alternative solution). One incorrect solution was submitted.

GD Star Rating
loading...

Solution: 2016-19 Zeta function

Let
\[
P(k) = \sum_{i_1=1}^{\infty} \dots \sum_{i_k=1}^{\infty} \frac{1}{i_1 \dots i_k (i_1 + \dots + i_k)}
\]
for a positive integer \( k \). Find \( \zeta(k+1) / P(k) \), where \( \zeta \) is the Riemann-zeta function.

The best solution was submitted by Lee, Sangmin (이상민, 수리과학과 2014학번). Congratulations!

Here is his solution of problem 2016-19.

Alternative solutions were submitted by 신준형 (수리과학과 2015학번, +3), 장기정 (수리과학과 2014학번, +3), 이종원 (수리과학과 2014학번, +3), 김태균 (2016학번, +3).

GD Star Rating
loading...

Solution: 2016-18 Partitions with equal sums

Suppose that we have a list of \(2n+1\) integers such that whenever we remove any one of them, the remaining can be partitioned into two lists of \(n\) integers with the same sum. Prove that all \(2n+1\) integers are equal.

The best solution was submitted by Joonhyung Shin (신준형, 수리과학과 2015학번). Congratulations!

Here is his solution of problem 2016-18.

Alternative solutions were submitted by 국윤범 (수리과학과 2015학번, +3), 장기정 (수리과학과 2014학번, +3), 이종원 (수리과학과 2014학번, +3, solution), 김태균 (2016학번, +3), 윤준기 (전기및전자공학부 2014학번, +3), 김재현 (2016학번, +3), 채지석 (2016학번, +3), 강한필 (2016학번, +3), Ivan Adrian Koswara (전산학부 2013학번, +3), 김기현 (수리과학과 대학원생, +3). One incorrect solution was received.

GD Star Rating
loading...

Solution: 2016-17 Integral with two variables

Set \[ L(z,w)=\int_{-2}^2\int_{-2}^2 ( \log(z-x)-\log(z-y))( \log(w-x)-\log(w-y))Q(x,y) dx dy, \]
for \(z,w\in \mathbb{C}\setminus(-\infty, 2] \), where \[ Q(x,y)= \frac{4-xy}{(x-y)^2\sqrt{4-x^2}\sqrt{4-y^2}}. \]
Prove that \[ L(z,w)=2\pi^2 \log \left[ \frac{(z+R(z))(w+R(w))}{2(zw-4+R(z)R(w))} \right], \]
where \(R(z)=\sqrt{z^2-4}\) with branch cut \([-2,2]\).

The best solution was submitted by Choi, Daebeom (최대범, 2016학번). Congratulations!

Here is his solution of problem 2016-17. (There are a few typos.)

No alternative solutions were submitted.

GD Star Rating
loading...

Solution: 2016-16 Column spaces

Let \(A\) be a square matrix with real entries such that \[ A A^T+A^T A = A+A^T.\] Prove that \(A\) and \(A^T\) have the same column space.

The best solution was submitted by Koon, Yun Bum (국윤범, 수리과학과 2015학번). Congratulations!

Here is his solution of problem 2016-16.

Alternative solutions were submitted by 장기정 (수리과학과 2014학번, +3), 이종원 (수리과학과 2014학번, +3), 최인혁 (물리학과 2015학번, +3), 신준형 (수리과학과 2015학번, +3), 최대범 (2016학번, +3), 김태균 (2016학번, +3), 윤준기 (전기및전자공학부 2014학번, +3), 위성군 (수리과학과 2015학번, +3), 이정환 (수리과학과 2015학번, +3). Two incorrect solutions were received.

GD Star Rating
loading...

Solution: 2016-15 Pair of integers

Find all pairs of positive integers \( a \) and \( b \) such that \( a | (b^2 + b + 1) \) and \( b | (a^2 + a + 1) \).

The best solution was submitted by Kijoung Jang (장기정, 수리과학과 2014학번). Congratulations!

Here is his solution of problem 2016-15.

Alternative solutions were submitted by 국윤범 (수리과학과 2015학번, +3), 김강식 (포항공대 수학과 2013학번, +3), 김기택 (수리과학과 2015학번, +3), 김재현 (2016학번, +3), 김태균 (2016학번, +3), 박기연 (2016학번, +3), 박찬우 (서울대학교 통계학과 2016학번, +3), 신준형 (수리과학과 2015학번, +3), 윤준기 (전기및전자공학부 2014학번, +3), 이상민 (수리과학과 2014학번, +3), 이종원 (수리과학과 2014학번, +3, alternative solution), 채지석 (2016학번, +3), 최대범 (2016학번, +3), 최인혁 (물리학과 2015학번, +3), 박현준 (물리학과 2014학번, +3), 위성군 (수리과학과 2015학번, +3), 김영헌 (개성고등학교 3학년, +3), Saba Dzmanashvili (+3), Jonathan French (+2), 정의현 (수리과학과 2015학번, +2).

GD Star Rating
loading...

Solution: 2016-13 How to divide camels

A rich old man had \( k \) sons and \( N \) camels in the herd. The will of the father stated that his \( r \)-th son should receive \( 1/ N_r\) of his camels for \( r = 1, 2, \dots, k\). Since \( N+1 \) is a common multiple of \( N_1, N_2, \dots, N_k \), the sons could not divided \( N \) camels as their father wished. The sons visited a wise man to solve the issue. The wise man listened about the will, and he brought his own camel, which he added to the herd. The herd was then divided up according to the old man’s wishes. The wise man then took back the one camel that remained, which was his own. For given \( k \), find the maximal number of camels \( N \equiv N(k) \) for which there is a solution to the problem where \( N_1, N_2, \dots, N_k\) are positive integers.

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

Here is his solution of problem 2016-13.

Alternative solutions were submitted by 최인혁 (물리학과 2015학번, +3), 국윤범 (수리과학과 2015학번, +3), 신준형 (수리과학과 2015학번, +3), 장기정 (수리과학과 2014학번, +3), 최대범 (2016학번, +3), 김재현 (2016학번, +2), 김태균 (2016학번, +2), 한준호 (수리과학과 2015학번, +2), 이상민 (수리과학과 2014학번, +2). One incorrect solution was submitted.

GD Star Rating
loading...

Solution: 2016-12 A series

Let \(k\) be a positive integer. Let \(a_n=1\) if \(n\) is not a multiple of \(k+1\), and \(a_n=-k\) if \(n\) is a multiple of \(k+1\). Compute \[\sum_{n=1}^\infty \frac{a_n}{n}.\]

The best solution was submitted by Choi, Inhyeok (최인혁, 물리학과 2015학번). Congratulations!

Here is his solution of problem 2016-12.

Alternative solutions were submitted by 강한필 (2016학번, +3), 국윤범 (수리과학과 2015학번, +3), 김기택 (수리과학과 2015학번, +3), 김재현 (2016학번, +3), 김태균 (2016학번, +3), 김태형 (EEWS대학원 석사과정, +3), 박찬우 (서울대학교 통계학과 2016학번, +3), 신준형 (수리과학과 2015학번, +3), 오동우 (2015학번, +3), 유찬진 (수리과학과 2015학번, +3), 이정환 (수리과학과 2015학번, +3), 이종원 (수리과학과 2014학번, +3), 임성혁 (2016학번, +3), 장기정 (수리과학과 2014학번, +3), 채지석 (2016학번, +3), 최대범 (2016학번, +3), 한준호 (수리과학과 2015학번, +3), Muhammaadfiruz Hasanov (2014학번, +3), 박기연 (2016학번, +2), 박진호 (물리학과 2015학번, +2), 송교범 (서대전고등학교 3학년, +2), 송민학 (월촌중학교 3학년, +2), 윤준기 (전기및전자공학부 2014학번, +2), 정성진 (수리과학과 2013학번, +2), 이본우 (대구과학고등학교 3학년, +2), 이상민 (수리과학과 2014학번, +2), 이시우 (포항공대 수학과 2013학번, +2). There were 2 incorrect solutions and 2 submissions by email missing attachments.

GD Star Rating
loading...

Solution: 2016-11 Infinite series

For a positive integer \( n \), define \( f(n) \) by
\[
f(n) =
\begin{cases}
0 & \text{ if } n \equiv 0 \pmod{5} \\
1 & \text{ if } n \equiv \pm 1 \pmod{5} \\
-1 & \text{ if } n \equiv \pm 2 \pmod{5}
\end{cases}.
\]
Compute the infinite series
\[
\sum_{n=1}^{\infty} \frac{f(n)}{n} = 1 – \frac{1}{2} – \frac{1}{3} + \frac{1}{4} + \frac{1}{6} – \dots.
\]

The best solution was submitted by Kook, Yun Bum (국윤범, 수리과학과 2015학번). Congratulations!

Here is his solution of problem 2016-11.

Alternative solutions were submitted by 이상민 (수리과학과 2014학번, +3), 박정우 (한국과학영재학교 2016학번, +2), 윤준기 (전기및전자공학부 2014학번, +2), 최백규 (2016학번, +2).

GD Star Rating
loading...