Solution: 2018-15 Diophantine equation

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).

GD Star Rating
loading...

2018-15 Diophantine equation

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) \).

GD Star Rating
loading...

Solution: 2018-14 Forests and Planes

Suppose that the edges of a graph \(G\) can be colored by 3 colors so that there is no monochromatic cycle. Prove or disprove that \(G\) has two planar subgraphs \(G_1,G_2\) such that \(E(G)=E(G_1)\cup E(G_2)\).

The best solution was submitted by Huy Tùng Nguyễn (수리과학과 2016학번). Congratulations!

Here is his solution of problem 2018-14.

Alternative solutions were submitted by 강한필 (전산학부 2016학번, +3, solution) and 김일희 (수리과학과 2001학번 동문, +3, solution). There was one incorrect submission.

GD Star Rating
loading...

Status: 2018-14 Forests and Planes

At the moment, this problem remains open.

Suppose that the edges of a graph \(G\) can be colored by 3 colors so that there is no monochromatic cycle. Prove or disprove that \(G\) has two planar subgraphs \(G_1,G_2\) such that \(E(G)=E(G_1)\cup E(G_2)\).

Hint: The answer is NO. Disprove it.

GD Star Rating
loading...

2018-14 Forests and Planes

Suppose that the edges of a graph \(G\) can be colored by 3 colors so that there is no monochromatic cycle. Prove or disprove that \(G\) has two planar subgraphs \(G_1,G_2\) such that \(E(G)=E(G_1)\cup E(G_2)\).

GD Star Rating
loading...

Solution: 2018-13 Bernoulli vectors

Assume that \( x \in \mathbb{R}^n \) with at least \( k \) non-zero entries \( ( k> 0 ) \). Let
\[
A = \{ y \in \{-1, 1\}^n : y \cdot x = 0 \}.
\]
Prove that \( |A| \leq k^{-1/2} 2^n \).

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

Here is his solution of problem 2018-13.

An alternative solution was submitted by 이대석 (수리과학과 2017학번, +3). Two incorrect solutions were received.

GD Star Rating
loading...

Concluding 2018 Spring

Thanks all for participating POW actively. Here’s the list of winners:

1st prize (Gold): Lee, Jongwon (이종원, 수리과학과 2014학번)
2nd prize (Silver): Chae, Jiseok (채지석, 수리과학 과 2016학번)
2nd prize (Silver): Han, Joon Ho (한준호,수리과학과 2015학번)
2nd prize (Silver): Lee, Bonwoo (이본우, 수리과학과 2017학번)
3rd prize (Bronze): Ko, Sunghun (고성훈, 2018학번)

이종원 (수리과학과 2014학번) 40/40
채지석 (수리과학과 2016학번) 35/40
한준호 (수리과학과 2015학번) 35/40
이본우 (수리과학과 2017학번) 32/40
고성훈 (2018학번) 20/40
김태균 (수리과학과 2016학번) 19/40
최인혁 (물리학과 2015학번) 10/40
김건우 (수리과학과 2017학번) 8/40
최백규 (생명과학과 2016학번) 6/40
하석민 (수리과학과 2017학번) 6/40
길현준 (2018학번) 3/40
강한필 (전산학부 2016학번) 3/40
문정욱 (2018학번) 3/40
노우진 (물리학과 2015학번) 1/40
윤정인 (물리학과 2016학번) 1/40

GD Star Rating
loading...

Solution: 2018-12 Property of Eigenvectors

Let \(A\) be a \(2\times 2\) matrix. Prove that if \(Av_1=\lambda_1v_1\) and \(Av_2=\lambda_2v_2\) for distinct reals \(\lambda_1\) and \(\lambda_2\) and nonzero vectors \(v_1\) and \(v_2\), then both columns of \(A-\lambda_1 I\) is a multiple of \(v_2\).

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

Here is his solution of problem 2018-12.

Alternative solutions were submitted by 고성훈 (2018학번, +3), 권홍 (중앙대 물리학과, +3), 길현준 (2018학번, +3), 김태균 (수리과학과 2016학번, +3), 이본우 (수리과학과 2017학번, +3), 채지석 (수리과학과 2016학번, +3), 한준호 (수리과학과 2015학번, +3).

GD Star Rating
loading...

Solution: 2018-11 Fallacy

On a math exam, there was a question that asked for the largest angle of the triangle with sidelengths \(21\), \(41\), and \(50\). A student obtained the correct answer as follows:

Let \(x\) be the largest angle. Then,
\[
\sin x = \frac{50}{41} = 1 + \frac{9}{41}.
\]
Since \( \sin 90^{\circ} = 1 \) and \( \sin 12^{\circ} 40′ 49” = 9/41 \), the angle \( x = 90^{\circ} + 12^{\circ} 40′ 49” = 102^{\circ} 40′ 49”\).

Find the triangle with the smallest area with integer sidelengths and possessing this property (that the wrong argument as above gives the correct answer).

The best solution was submitted by Han, Junho (한준호, 수리과학과 2015학번). Congratulations!

Here is his solution of problem 2018-11.

Alternative solutions were submitted by 이종원 (수리과학과 2014학번, +3),
채지석 (수리과학과 2016학번, +3), 고성훈 (2018학번, +2), 이본우 (수리과학과 2017학번, +2). One incorrect solution was submitted.

GD Star Rating
loading...