Please check that POW 2021-14 is slightly changed; there is an additional assumption that \( X \times Y \) is Hausdorff.
loading...
Please check that POW 2021-14 is slightly changed; there is an additional assumption that \( X \times Y \) is Hausdorff.
Let X, Y be compact spaces. Suppose \(X \times Y\) is perfectly normal, i.e, for every disjoint closed subsets E, F in \(X \times Y\), there exists a continuous function \( f: X \times Y \to [0, 1] \subset \mathbb{R} \) such that \( f^{-1}(0) = E, f^{-1}(1) = F \). Is it true that at least one of X and Y is metrizable?
(added Sep. 11, 8AM: Assume further that \( X \times Y\) is Hausdorff.)
Prove or disprove the following:
There exist an infinite sequence of functions \( f_n: [0, 1] \to \mathbb{R} , n=1, 2, \dots \) ) such that
(1) \( f_n(0) = f_n(1) = 0 \) for any \( n \),
(2) \( f_n(\frac{a+b}{2}) \leq f_n(a) + f_n(b) \) for any \( a, b \in [0, 1] \),
(3) \( f_n – c f_m \) is not identically zero for any \( c \in \mathbb{R} \) and \( n \neq m \).
The best solution was submitted by 김기택 (수리과학과 대학원생, +4). Congratulations!
Here is the best solution of problem 2021-13.
Other solutions were submitted by 강한필 (전산학부 2016학번, +3), 고성훈 (수리과학과 2018학번, +3), 김민서 (수리과학과 2019학번, +3), 박정우 (수리과학과 2019학번, +3), 신주홍 (수리과학과 2020학번, +3), 이도현 (수리과학과 2018학번, +3), 이본우 (수리과학과 2017학번, +3), 이호빈 (수리과학과 대학원생, +3).
Prove or disprove the following:
There exist an infinite sequence of functions \( f_n: [0, 1] \to \mathbb{R} , n=1, 2, \dots \) ) such that
(1) ( f_n(0) = f_n(1) = 0 ) for any ( n ),
(2) ( f_n(\frac{a+b}{2}) \leq f_n(a) + f_n(b) ) for any ( a, b \in [0, 1] ),
(3) ( f_n – c f_m ) is not identically zero for any ( c \in \mathbb{R} ) and ( n \neq m ).
In a graduation ceremony, \(n\) graduating students form a circle and their diplomas are distributed uniformly at random. Students who have their own diploma leave, and each of the remaining students passes the diploma she has to the student on her right, and this is one round. Again, each student with her own diploma leave and each of the remaining students passes the diploma to the student on her right and repeat this until everyone leaves. What is the probability that this process takes exactly \(k \) rounds until everyone leaves.
The best solution was submitted by 고성훈 (수리과학과 2018학번, +4). Congratulations!
Here is the best solution of problem 2021-12.
In a graduation ceremony, \(n\) graduating students form a circle and their diplomas are distributed uniformly at random. Students who have their own diploma leave, and each of the remaining students passes the diploma she has to the student on her right, and this is one round. Again, each student with her own diploma leave and each of the remaining students passes the diploma to the student on her right and repeat this until everyone leaves. What is the probability that this process takes exactly \(k \) rounds until everyone leaves.
Determine if there exist infinitely many perfect cubes such that the sum of the decimal digits coincides with the cube root. If there are only finitely many, how many are there?
The best solution was submitted by 박항 (전산학부 2013학번, +4). Congratulations!
Here is the best solution of problem 2021-11.
Other solutions were submitted by 강한필 (전산학부 2016학번, +3), 고성훈 (수리과학과 2018학번, +3), 김기수 (수리과학과 2018학번, +3), 최백규 (생명과학과 대학원, +3), 김기택 (2021학번, +3).
Determine if there exist infinitely many perfect cubes such that the sum of the decimal digits coincides with the cube root. If there are only finitely many, how many are there?
Let \( f: [0, 1] \to \mathbb{R} \) be a continuous function satisfying
\[
\int_x^1 f(t) dt \geq \int_x^1 t\, dt
\]
for all \( x \in [0, 1] \). Prove that
\[
\int_0^1 [f(t)]^2 dt \geq \int_0^1 t f(t) dt.
\]
The best solution was submitted by 김기택 (2021학번, +4). Congratulations!
Here is the best solution of problem 2021-10.
Other solutions were submitted by 강한필 (전산학부 2016학번, +3), 고성훈 (수리과학과 2018학번, +3), 최백규 (생명과학과 대학원, +3).
For given \(k\in \mathbb{N}\), determine the minimum natural number \(n\) satisfying the following: no matter how one colors each number in \(\{1,2,\dots, n\}\) red or blue, there always exists (not necessarily distinct) numbers \(x_0, x_1,\dots, x_k \in [n]\) with the same color satisfying \(x_1+\dots + x_k = x_0\).
The best solution was submitted by an anonymous participant. Congratulations!
Here is his/her solution of problem 2021-09.
Other solutions were submitted by 고성훈 (수리과학과 2018학번, +3), 김기수 (수리과학과 2018학번, +3).