Let \(A\) be a \(16 \times 16\) matrix whose entries are either \(1\) or \(-1\). What is the maximum value of the determinant of \(A\)?

The best solution was submitted by 이명규 (KAIST 전산학부 20학번, +4).

Congratulations!

Here is the best solution of problem 2024-08.

Other solutions were submitted by 김준홍 (KAIST 수리과학과 20학번, +3), 김지원 (KAIST 새내기과정학부 24학번, +3), 신정연 (KAIST 수리과학과 21학번, +3), 정영훈 (KAIST 새내기과정학부 24학번, +3), 지은성 (KAIST 수리과학과 20학번, +3), 채지석 (KAIST 수리과학과 석박통합과정 21학번, +3), Anar Rzayev (KAIST 전산학부 19학번, +3), 권오관 (연세대학교 수학과 22학번, +2).

Let \( N \) be the number of ordered tuples of positive integers \( (a_1, a_2, \dots, a_{27}) \) such that \( \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_{27}} = 1\). Compute the remainder of \( N \) when \( N \) is divided by \(33 \).

The best solution was submitted by 이명규 (KAIST 전산학부 20학번, +4). Congratulations!

Here is the best solution of problem 2023-19.

Other solutions were submitted by 강지민 (세마고 3학년, +3), 김기수 (KAIST 수리과학과 18학번, +3), 김민서 (KAIST 수리과학과 19학번, +3), 김준홍 (KAIST 수리과학과 20학번, +3), 김찬우 (연세대학교 수학과 22학번, +3), 박기윤 (KAIST 새내기과정학부 23학번, +3), 이도현 (KAIST 수리과학과 석박통합과정 23학번, +3), 조현준 (KAIST 수리과학과 22학번, +3), 지은성 (KAIST 수리과학과 20학번, +3), 채지석 (KAIST 수리과학과 석박통합과정 21학번, +3), Adnan Sadik (KAIST 새내기과정학부 23학번, +3), Dzhamalov Omurbek (KAIST 전산학부 22학번, +3), Kharchenka Yuliya (KAIST 물리학과 22학번, +3), Muhammadfiruz Hasanov (+3), Aiden Stock (+3).

Let \(p\) be a prime number at least three and let \(k\) be a positive integer smaller than \(p\). Given \(a_1,\dots, a_k\in \mathbb{F}_p\) and distinct elements \(b_1,\dots, b_k\in \mathbb{F}_p\), prove that there exists a permutation \(\sigma\) of \([k]\) such that the values of \(a_i + b_{\sigma(i)}\) are distinct modulo \(p\).

The best solution was submitted by 이명규 (KAIST 전산학부, +4). Congratulations!

Here is the best solution of problem 2023-12.

Other solutions were submitted by 김찬우 (연세대학교 수학과 22학번, +3), 박준성 (KAIST 수리과학과 석박통합과정 22학번, +3), 채지석 (KAIST 수리과학과 석박통합과정 21학번, +3), 최민규 (한양대학교 의학대학 졸업, +3), Anar Rzayev (KAIST 전산학부 19학번, +3). Late solutions were not graded.

Let \(A_1,\dots, A_k\) be presidential candidates in a country with \(n \geq 1\) voters with \(k\geq 2\). Candidates themselves are not voters. Each voter has her/his own preference on those \(k\) candidates.

Find maximum \(m\) such that the following scenario is possible where \(A_{k+1}\) indicates the candidate \(A_1\): for each \(i\in [k]\), there are at least \(m\) voters who prefers \(A_i\) to \(A_{i+1}\).

The best solution was submitted by 이명규 (KAIST 전산학부 20학번, +4). Congratulations!

Here is the best solution of problem 2022-09.

Other solutions were submitted by 조유리 (문현여고 3학년, +3), 박기찬 (KAIST 새내기과정학부 22학번, +3), 김기수 (KAIST 수리과학과 18학번, +3), 여인영 (KAIST 물리학과 20학번, +3).