POW 2020-21 is still open and anyone who first submits a correct solution will get the full credit.

**GD Star Rating**

*loading...*

Leave a reply

POW 2020-21 is still open and anyone who first submits a correct solution will get the full credit.

Let \( S \) be the unit sphere in \( \mathbb{R}^n \), centered at the origin, and \( P_1 P_2 \dots P_{n+1} \) a regular simplex inscribed in \( S \). Prove that for a point \( P \) inside \( S \),

\[

\sum_{i=1}^{n+1} (PP_i)^4

\]

depends only on the distance \( OP \) (and \(n\)).

The best solution was submitted by 이준호 (수리과학과 2016학번, +4). Congratulations!

Here is his solution of problem 2020-22.

Other solutions was submitted by 고성훈 (수리과학과 2018학번, +3), 채지석 (수리과학과 2016학번, +3).

Let \( S \) be the unit sphere in \( \mathbb{R}^n \), centered at the origin, and \( P_1 P_2 \dots P_{n+1} \) a regular simplex inscribed in \( S \). Prove that for a point \( P \) inside \( S \),

\[

\sum_{i=1}^{n+1} (PP_i)^4

\]

depends only on the distance \( OP \) (and \(n\)).

POW 2020-20 is still open and anyone who first submits a correct solution will get the full credit.

Alice and Bob play the following game with \( S=\{1,\dots, 777\} \).

Alice picks a number \(x \in S\) without telling anyone and Bob will guess what the number is at the end of the game. Alice is malicious so that she can always change her number \(x\) at any time until the end of the game.

In each round, Bob picks a subset \(T\subseteq S\) and asks a following question to Alice: “is your \(x\) belong to \(T\)?” Alice must say either Yes or No. At the end of the game, Bob guesses her \(x\) first and then Alice reveals her number \(x\) (Alice can still change her number after she listen to Bob’s guess and before revealing her number). According to her final number \(x\), each of her previous answers are determined to be either a truth or a lie.

Bob wins if Alice end up lying more than three times or his answer is correct. Alice wins if Bob’s answer is wrong and at most three of her answers are lies. Prove that if a game consists of twenty rounds, then no matter what Bob does Alice can always win.

Let \(S_g\) denote the closed orientable connected surface of genus \(g\). Suppose we glue triangles along the edges so that the resulting space is \(S_g\) and the intersection of any two triangles are either empty or a single edge. Let \( n(g) \) be the minimum number of triangles one needs to make \(S_g\) while satisfying the above rule. What are \( n(1), n(2), n(3) \)? Does the limit \( \lim_{g \to \infty} n(g)/g \) exist?

Let \( n \) be a positive integer. Determine all continuous functions \(f: [0, 1] \to \mathbb{R}\) such that

\[

f(x_1) + \dots + f(x_n) =1

\]

for all \( x_1, \dots, x_n \in [0, 1] \) satisfying \( x_1 + \dots + x_n = 1\).

The best solution was submitted by 김유일 (2020학번) Congratulations!

Here is his solution of problem 2020-19.

Other solutions was submitted by 길현준 (수리과학과 2018학번, +3), 채지석 (수리과학과 2016학번, +3), 이준호 (수리과학과 2016학번, +2).

Let \( n \) be a positive integer. Determine all continuous functions \(f: [0, 1] \to \mathbb{R}\) such that

\[

f(x_1) + \dots + f(x_n) =1

\]

for all \( x_1, \dots, x_n \in [0, 1] \) satisfying \( x_1 + \dots + x_n = 1\).

POW will resume on Oct. 30.

Consider the cards with labels \( 1,\dots, n \) in some order. If the top card has label \(m \), we reverse the order of the top \( m \) cards. The process stops only when the card with label \( 1\) is on the top. Prove that the process must stop in at most \( (1.7)^n \) steps.

The best solution was submitted by 길현준 (수리과학과 2018학번). Congratulations!

Here is his solution of problem 2020-18.

Other solutions was submitted by 김유일 (2020학번, +3), 이준호 (수리과학과 2016학번, +3).