Category Archives: problem

2012-7 Product of Sine

Let X be the set of all postive real numbers c such that  \[\frac{\prod_{k=1}^{n-1} \sin\left( \frac{k \pi}{2n}\right)}{c^n} \]  converges as n goes to infinity. Find the infimum of X.

2012-6 Matrix modulo p

Let p be a prime number and let n be a positive integer. Let \(A=\left( \binom{i+j-2}{i-1}\right)_{1\le i\le p^n, 1\le j\le p^n} \) be a \(p^n \times p^n\) matrix. Prove that \( A^3 \equiv I \pmod p\), where I is the \(p^n \times p^n\) identity matrix.

2012-4 Sum of squares

Find the smallest and the second smallest odd integers n satisfying the following property: \[ n=x_1^2+y_1^2 \text{ and } n^2=x_2^2+y_2^2 \] for some positive integers \(x_1,y_1,x_2,y_2\) such that \(x_1-y_1=x_2-y_2\).

2012-2 sum with a permutation

Let n be a positive integer and let Sn be the set of all permutations on {1,2,…,n}. Assume \( x_1+x_2 +\cdots +x_n =0\) and \(\sum_{i\in A} x_i\neq 0 \) for all nonempty proper subsets A of {1,2,…,n}. Find all possible values of\[ \sum_{\pi \in S_n } \frac{1}{x_{\pi(1)}} \frac{1}{x_{\pi(1)}+x_{\pi(2)}}\cdots \frac{1}{x_{\pi(1)}+\cdots+ x_{\pi(n-1)}}. \]

2011-22 Seoul Subway Line 2

In Seoul Subway Line 2,  subway stations are placed around a circular subway line. Assume that each segment of Seoul Subway Line 2 has a fixed price. Suppose that you hid money at each subway station so that the sum of the money is only enough for one roundtrip around Seoul Subway Line 2.

Prove that there is a station that you can start and take a roundtrip tour of Seoul Subway Line 2 while paying each segment by the money collected at visited stations.