Category Archives: problem

2011-10 Multivariable polynomial

Let \(t_1,t_2,\ldots,t_n\) be positive integers. Let \(p(x_1,x_2,\dots,x_n)\) be a polynomial with n variables such that \(\deg(p)\le t_1+t_2+\cdots+t_n\). Prove that \(\left(\frac{\partial}{\partial x_1}\right)^{t_1} \left(\frac{\partial}{\partial x_2}\right)^{t_2}\cdots \left(\frac{\partial}{\partial x_n}\right)^{t_n} p\) is equal to \[\sum_{a_1=0}^{t_1} \sum_{a_2=0}^{t_2}\cdots \sum_{a_n=0}^{t_n} (-1)^{t_1+t_2+\cdots+t_n+a_1+a_2+\cdots+a_n}\left( \prod_{i=1}^n \binom{t_i}{a_i} \right)p(a_1,a_2,\ldots,a_n).\]

GD Star Rating
loading...

2011-7 Factorial

Let f(n) be the largest integer k such that n! is divisible by \(n^k\). Prove that \[ \lim_{n\to \infty} \frac{(\log n)\cdot \max_{2\le i\le n} f(i)}{n \log\log n}=1.\]

GD Star Rating
loading...

2011-6 Equal sums

Let \(a_1\le a_2\le \cdots \le a_k\) and \(b_1\le b_2\le \cdots \le b_l\) be sequences of positive integers at most M. Prove that if \[ \sum_{i=1}^{k} a_i^n = \sum_{j=1}^l b_j^n\] for all \(1\le n\le M\), then \(k=l\) and \(a_i=b_i\) for all \(1\le i\le k\).

GD Star Rating
loading...

2011-3 Counting functions

Let us write \([n]=\{1,2,\ldots,n\}\). Let \(a_n\) be the number of all functions \(f:[n]\to [n]\) such that \(f([n])=[k]\) for some positive integer \(k\). Prove that \[a_n=\sum_{k=0}^{\infty} \frac{k^n}{2^{k+1}}.\]

GD Star Rating
loading...