Category Archives: annoncement

Notice on POW 2025-13

Since there were no solutions submitted for POW 2025-13, we will postpone the due date of POW 2025-13 to Oct. 3 (Fri.) 3PM.

We remark that the problem is designed so that the answer with smallest number of punches earns +4, and the next four best answers earn +3 each. (In other words, you may earn some points even if your answer is not optimal.)

Notice on POW 2024-05 and POW 2024-06

It is found that there is a flaw in POW 2024-05; some students showed that the collection of all Knotennullstelle numbers is not a discrete subset of \( \mathbb{C} \). We again apologize for the inconvenience.

To acknowledge the students who reported the flaws in POW 2024-05 and POW 2024-06, we decided to give credits to 김준홍 (KAIST 수리과학과 20학번, +4) and 지은성 (KAIST 수리과학과 20학번, +3) for POW 2024-05 and Anar Rzayev (KAIST 전산학부 19학번, +4) for POW 2024-06.

Here is a “solution” of problem 2024-05.

POW 2024-06 Canceled

It is found that there is a flaw in POW 2024-06; the inequality in the problem is not satisfied with the given g(t). Since it is too late to revise the problem again with a new deadline, we decide to cancel POW 2024-06. We apologize for the inconvenience.