Let \(n\) be an odd positive integer, and let
\[
f:\{-1,1\}^n\to\{-1,1\}.
\]
Interpret \(x_i=1\) as voter \(i\) voting for candidate \(A\), and \(x_i=-1\) as voter \(i\) voting for candidate \(B\). The value \(f(x_1,\dots,x_n)\) is the choice.

Find all functions \(f\) satisfying the following properties:
1. Anonymity: for every permutation \(\sigma\in S_n\),
\[
f(x_1,\dots,x_n)=f(x_{\sigma(1)},\dots,x_{\sigma(n)}).
\]
2. Neutrality:
\[
f(-x_1,\dots,-x_n)=-f(x_1,\dots,x_n).
\]
3. Monotonicity: if \(x=(x_1,\dots,x_n)\) and \(y=(y_1,\dots,y_n)\) satisfy
\[
x_i\le y_i \qquad \text{for all } i=1,\dots,n,
\]
then
\[
f(x)\le f(y).
\]

The best solution was submitted by 신민규 (수리과학과 24학번, +4). Congratulations!

Here is the best solution of problem 2026-04.

Other solutions were submitted by 기영인 (+3), 김범석 (인하대, +3), 김은성 (서울대 수리과학과, +3), 김준홍 (수리과학과 석박통합과정, +4), 이상주 (경남대 수학교육과, +3), 이재원 (새내기과정학부 26학번, +3), 장현준 (서울과학고 3학년, +3), 정서윤 (수리과학과 23학번, +3), 지은성 (수리과학과 석박통합과정, +3), Huseyn Ismayilov (전산학부 22학번, +3).

Let \(V\) be the set of tuples \((a_1,…,a_5)\) such that \(a_1 \leq a_2 \leq \cdots \leq a_5 \) belong to \(\mathbb{R}\) and satisfy \[ \sum_{1\leq i\leq 5} a_i >0, \quad \sum_{1\leq i<j \leq 5} a_i a_j >0, \quad \sum_{1\leq i<j< k \leq 5} a_ia_ja_k >0.\]

What is the maximum number \(p\) such that there exists a tuple \((a_1,…,a_5) \) in \(V\) whose \(a_p\leq 0 \)?

The best solution was submitted by 김준홍 (수리과학과 석박통합과정, +4). Congratulations!

Here is the best solution of problem 2026-03.

Other solutions were submitted by 김범석 (인하대, +3), 김은성 (서울대 수리과학과, +3), 김찬우 (연세대 수학과, +3), 신민규 (수리과학과 24학번, +3), 이상주 (경남대 수학교육과, +3), 장현준 (서울과학고 3학년, +3), 정서윤 (수리과학과 23학번, +3), 지은성 (수리과학과 석박통합과정, +3).

Find all positive integer \( k \) satisfying the following statement: For any positive integers \( m \) and \( n \),
\[
\frac{((k+1)m)! ((k+1)n)!}{m! n! ((k-1)m + n)! (m + (k-1)n)!}
\]
is an integer.

The best solution was submitted by 정서윤 (수리과학과 23학번, +4). Congratulations!

Here is the best solution of problem 2026-02.

Another solution was submitted by 김은성 (서울대 수리과학과, +3), 박영우 (전산학부 24학번, +3), 신민규 (수리과학과 24학번, +3), 장현준 (서울과학고 3학년, +3), Huseyn Ismayilov (전산학부 22학번, +3).

We want to find the maximum area of two disjoint, simply connected, congruent tiles that can be packed inside a right triangle, one of whose angles is \( \pi/6 \) (30 degrees). What would be the maximal coverage of the right triangle by the tiles? (There is no restriction on the shape of the tiles, especially it does not need to be rectangular, as long as they are simply connected.) (4 points will be given to the one with the best answer, and 3 points for the next four best answers.)

The best solution was submitted by 지은성 (수리과학과 석박통합과정, +4). Congratulations!

Here is the best solution of problem 2026-01.

Another solution was submitted by 김은성 (서울대 수리과학과, +3), 김준홍 (수리과학과 석박통합과정, +3), 김찬우 (연세대학교 수학과, +3), 박영우 (전산학부 24학번, +3), 신민규 (수리과학과 24학번, +3), 이상주 (경남대 수학교육과, +3), 정영훈 (수리과학과 24학번, +3), Huseyn Ismayilov (전산학부 22학번, +3), 정서윤 (수리과학과 23학번, +2).

Prove that for every positive integer \( k \) there exists a positive integer \( n \) such that
\[
\frac{(n+1)(n+2) \dots (2n-k)}{n(n-1) \dots (n-k+1)}
\]
is an integer and that \( k = o(n) \) for such \( n \).

The best solution was submitted by 김은성 (대구과학고등학교, +4). Congratulations!

Here is the best solution of problem 2025-19.

Another solution was submitted by 정영훈 (수리과학과 24학번, +3).

Find all integers \( k \) such that the sequence \( (3n^2 + 3nk^2 + k^3 )_{n=1, 2, \dots} \) contains infinitely many squares.

The best solution was submitted by 김은성 (대구과학고등학교, +4). Congratulations!

Here is the best solution of problem 2025-18.

Other (partial) solutions were submitted by 정영훈 (수리과학과 24학번, +2), Huseyn Ismayilov (전산학부 22학번, +2).

Prove the following identity:
\[
\sum_{k=0}^{n-1} \binom{z}{k} \frac{x^{n-k}}{n-k} = \sum_{k=1}^n \binom{z-k}{n-k} \frac{(x+1)^k -1}{k}.
\]

The best solution was submitted by 정서윤 (수리과학과 23학번, +4). Congratulations!

Here is the best solution of problem 2025-17.

Other solutions were submitted by 김은성 (대구과학고, +3), 김찬우 (연세대학교 수학과, +3), 정영훈 (수리과학과 24학번, +3), Huseyn Ismayilov (전산학부 22학번, +3).

Denote \(P = \{(x, y, z) \in \mathbb{R^3}: 10< x,y,z <31\}\). Suppose a function \(f (v): \mathbb{R^3} \to \mathbb{R_{\geq 0}}\) satisfies:
(a) \(f(\lambda v) = \lambda^{25} f(v)\) for all \(v\in P\) and \(0<\lambda \in \mathbb{R}\),
(b) \(f(v+w) \geq f(v)\) for every \(v, w \in P\),
(c) \(f (v)\) is locally bounded.
Show that \(f (v)\) is locally Lipschitz in \(P\).

The best solution was submitted by 정영훈 (수리과학과 24학번, +4). Congratulations!

Here is the best solution of problem 2025-15.

Show that any set of d + 2 points in R^d can be partitioned into two sets whose convex hulls intersect.

The best solution was submitted by 정영훈 (수리과학과 24학번, +4). Congratulations!

Here is the best solution of problem 2025-14.

Other solutions were submitted by 김은성 (대구과학고, +3), 김지원 (전산학부 24학번, +3), 김찬우 (연세대 수학과, +3), 신민규 (수리과학과 24학번, +3), 이태민 (경남대 수학교육과, +3), 정서윤 (수리과학과 학사과정, +3), 지은성 (수리과학과 석박통합과정, +3).