For a natural number \(n\), let \(a_n\) be the number of congruence classes of triangles whose all three sides have integer length and its perimeter is \(n\). Obtain a formula for \(a_n\).

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.)

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? 

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\).

Prove or disprove that if C is any nonempty connected, closed, self-antipodal (ie., invariant under the antipodal map) set on \(S^2\), then it equals the zero locus of an odd, smooth function \(f:S^2 -> \mathbb{R}\).  

Let \(\mathcal{A}_n\) be the collection of all sequences \( \mathbf{a}= (a_1,\dots, a_n) \) with \(a_i \in [i]\) for all \(i\in [n]=\{1,2,\dots, n\}\). A nondecreasing \(k\)-subsequence of \(\mathbf{a}\) is a subsequence \( (a_{i_1}, a_{i_2},\dots, a_{i_k}) \) such that \(i_1< i_2< \dots < i_k\) and \(a_{i_1}\leq a_{i_2}\leq \dots \leq a_{i_k}\). For given \(k\), determine the smallest \(n\) such that any sequence \(\mathbf{a}\in \mathcal{A}_n\) has a nondecreasing \(k\)-subsequence.