A complex number \(z \in S^1 \smallsetminus \{1\} \) is called a Knotennullstelle if there exists a Laurent polynomial \(p(t) \in \mathbb{Z} [t,t^{-1}]\) such that \(p(1) =\pm 1\) and \(p(z)=0\). Prove that the collection of all Knotennullstelle numbers is a discrete subset of \(\mathbb{C}\).
Prove the following: There exists a bounded real random variable \( Z \) such that
\[
E[Z] = 0, E[Z^2] = 1, E[Z^3] = x, E[Z^4] = y
\]
if and only if \( y \geq x^2 + 1 \). (Here, \( E \) denotes the expectation.)
Let \(P(z) = z^3 + c_1 z^2 + c_2 z+ c_3\) be a complex polynomial in \(\mathbb{C}\). Its complex derivative is given by \(P’(z) = 3z^{2} +2c_1z+c_{2}.\) Assume that there exist two points a, b in the open unit disc of complex plane such that P(a) = P(b) =0. Show that there is a point w belonging to the line segment joining a and b such that \({\rm Re} (P’(w)) = 0\).
A permutation \(\phi \colon \{ 1,2, \ldots, n \} \to \{ 1,2, \ldots, n \}\) is called a well-mixed if \(\phi (\{1,2, \ldots, k \}) \neq \{1,2, \ldots, k \}\) for each \(k<n\). What is the number of well-mixed permutations of \(\{ 1,2, \ldots, 15 \}\)?
Suppose that we roll \(n\) (6-sided, fair) dice. Let \(S_n\) be the sum of their faces. Find all positive integers \(k\) such that the probability that \(k\) divides \(S_n\) is \(1/k\) for all \(n \geq 1\).
Consider a function \(f: \{1,2,\dots, n\}\rightarrow \mathbb{R}\) satisfying the following for all \(1\leq a,b,c \leq n-2\) with \(a+b+c\leq n\).
\[ f(a+b)+f(a+c)+f(b+c) – f(a)-f(b)-f(c)-f(a+b+c) \geq 0 \text{ and } f(1)=f(n)=0.\]
Prove or disprove this: all such functions \(f\) always have only nonnegative values on its domain.
Acknowledgement: This problem arises during a research discussion between June Huh, Jaehoon Kim and Matt Larson.
Does there exist a nontrivial subgroup \(G\) of \( GL(10, \mathbb{C}) \) such that each element in \(G\) is diagonalizable but the set of all the elements of \(G\) is not simultaneously diagonalizable?
Find the following limit:
\[
\lim_{n \to \infty} \left( \frac{\sum_{k=1}^{n+2} k^k}{\sum_{k=1}^{n+1} k^k} – \frac{\sum_{k=1}^{n+1} k^k}{\sum_{k=1}^{n} k^k} \right)
\]
Can we find a sequence \(a_i, i=0,1,2,…\) with the following property: for each given integer \(n\geq 0\), we have \[\lim_{L\to +\infty}\sum_{i=0}^L 2^{ni} |a_i|\leq 23^{(n+11)^{10}} \quad \text{ and }\quad \lim_{L\to +\infty}\sum_{i=0}^L 2^{ni} a_i = (-1)^n ?\]
Let \(N\) be the number of ordered tuples of positive integers \( (a_1,a_2,\ldots, a_{27} )\) such that \( \frac{1}{a_1} + \frac{1}{a_2} + \cdots +\frac{1}{a_{27}} = 1\). Compute the remainder of \(N\) when \(N\) is divided by \(3\).