Found problems: 1782
For a given real number $a$ and a positive integer $n$, prove that:
i) there exists exactly one sequence of real numbers $x_0,x_1,\ldots,x_n,x_{n+1}$ such that
\[\begin{cases} x_0=x_{n+1}=0,\\ \frac{1}{2}(x_i+x_{i+1})=x_i+x_i^3-a^3,\ i=1,2,\ldots,n.\end{cases}\]
ii) the sequence $x_0,x_1,\ldots,x_n,x_{n+1}$ in i) satisfies $|x_i|\le |a|$ where $i=0,1,\ldots,n+1$.
[i]Liang Yengde[/i]
Let $t$ and $n$ be fixed integers each at least $2$. Find the largest positive integer $m$ for which there exists a polynomial $P$, of degree $n$ and with rational coefficients, such that the following property holds: exactly one of \[ \frac{P(k)}{t^k} \text{ and } \frac{P(k)}{t^{k+1}} \] is an integer for each $k = 0,1, ..., m$.
[i]Proposed by Michael Kural[/i]
Prove that for $N>1$ that $(N^{2})^{2014} - (N^{11})^{106}$ is divisible by $N^6 + N^3 +1$
Is this just a proof by induction or is there a more elegant method? I don't think calculating $N = 2$ was expected.
In terms of $n\ge2$, find the largest constant $c$ such that for all nonnegative $a_1,a_2,\ldots,a_n$ satisfying $a_1+a_2+\cdots+a_n=n$, the following inequality holds:
\[\frac1{n+ca_1^2}+\frac1{n+ca_2^2}+\cdots+\frac1{n+ca_n^2}\le \frac{n}{n+c}.\]
[i]Calvin Deng.[/i]
For a positive integer $n$ let $S(n)$ be the sum of digits in the decimal representation of $n$. Any positive integer obtained by removing several (at least one) digits from the right-hand end of the decimal representation of $n$ is called a [i]stump[/i] of $n$. Let $T(n)$ be the sum of all stumps of $n$. Prove that $n=S(n)+9T(n)$.
A directed graph has each vertex with outdegree 2. Prove that it is possible to split the vertices into 3 sets so that for each vertex $v$, $v$ is not simultaneously in the same set with both of the vertices that it points to.
[i]David Yang.[/i]
[hide="Stronger Version"]See [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=492100]here[/url].[/hide]
We call a set “sum free” if no two elements of the set add up to a third element of the set. What is the maximum size of a sum free subset of $\{ 1, 2, \ldots , 2n - 1 \}$.
Let a and b be non-negative integers such that $ab \ge c^{2}$ where $c$ is an integer. Prove that there is a positive integer n and integers $x_{1}$, $x_{2}$, $\cdots$, $x_{n}$, $y_{1}$, $y_{2}$, $\cdots$, $y_{n}$ such that \[{x_{1}}^{2}+\cdots+{x_{n}}^{2}=a,\;{y_{1}}^{2}+\cdots+{y_{n}}^{2}=b,\; x_{1}y_{1}+\cdots+x_{n}y_{n}=c\]
Find all strictly increasing functions $f: \mathbb{N}\to \mathbb{N}$ such that \[f(f(n))=3n.\]
Let $p$ be a prime. Prove that any complete graph with $1000p$ vertices, whose edges are labelled with integers, has a cycle whose sum of labels is divisible by $p$.
For any two rational numbers $ p$ and $ q$ in the interval $ (0,1)$ and function $ f$, there is always $ \displaystyle f \left( \frac{p\plus{}q}{2} \right) \leq \frac{f(p) \plus{} f(q)}{2}$. Then prove that for any rational numbers $ \lambda, x_1, x_2 \in (0,1)$, there is always:
\[ f( \lambda x_1 \plus{} (1\minus{}\lambda) x_2 ) \leq \lambda f(x_i) \plus{} (1\minus{}\lambda) f(x_2)\]
Let $ a_1\equal{}a_2\equal{}1$ and \[ a_{n\plus{}2}\equal{}\frac{n(n\plus{}1)a_{n\plus{}1}\plus{}n^2a_n\plus{}5}{n\plus{}2}\minus{}2\]for each $ n\in\mathbb N$. Find all $ n$ such that $ a_n\in\mathbb N$.
Let $ a\ge 3 $ and a polynom $ P. $ Show that:
$$ \max_{1\le k\le \text{grad} P} \left| a^{k-1}-P(k-1) \right| \ge 1 $$
Determine all possible values of positive integer $n$, such that there are $n$ different 3-element subsets $A_1,A_2,...,A_n$ of the set $\{1,2,...,n\}$, with $|A_i \cap A_j| \not= 1$ for all $i \not= j$.
Let $(a_{n})_{n=1}^{\infty}$ be a sequence of positive real numbers and let $\alpha_{n}$ be the
arithmetic mean of $a_{1},..., a_{n}$ . Prove that for all positive integers $N$ ,
\[\sum_{n=1}^{N}\alpha_{n}^{2}\leq 4\sum_{n=1}^{N}a_{n}^{2}. \]
Let $(a_n)$ be a sequence of non-negative real numbers satisfying $a_{n+m}\le a_n+a_m$ for all non-negative integers $m,n$.
Prove that if $n\ge m$ then $a_n\le ma_1+\left(\dfrac{n}{m}-1\right)a_m$ holds.
The sequence $ (x_n)_{n \geq 1}$ is defined by:
$ x_1\equal{}1$
$ x_{n\plus{}1}\equal{}\frac{x_n}{n}\plus{}\frac{n}{x_n}$
Prove that $ (x_n)$ increases and $ [x_n^2]\equal{}n$.
Determine if there exists a positive integer $n$ such that $n$ has exactly $2000$ prime divisors and $2^{n}+1$ is divisible by $n$.
Some blue and red circular disks of identical size are packed together to form a triangle. The top level has one disk and each level has 1 more disk than the level above it. Each disk not at the bottom level touches two disks below it and its colour is blue if these two disks are of the same colour. Otherwise its colour is red.
Suppose the bottom level has 2048 disks of which 2014 are red. What is the colour of the disk at the top?
Let $ G$ be a finite non-commutative group of order $ t \equal{} 2^nm$, where $ n, m$ are positive and $ m$ is odd. Prove, that if the group contains an element of order $ 2^n$, then
(i) $ G$ is not simple;
(ii) $ G$ contains a normal subgroup of order $ m$.
$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.
In the night, stars in the sky are seen in different time intervals. Suppose for every $k$ stars ($k>1$), at least $2$ of them can be seen in one moment. Prove that we can photograph $k-1$ pictures from the sky such that each of the mentioned stars is seen in at least one of the pictures.
(The number of stars is finite. Define the moments that the $n^{th}$ star is seen as $[a_n,b_n]$ that $a_n<b_n$.)
For every natural number $n$, denote $Q(n)$ the sum of the digits in the decimal representation of $n$. Prove that there are infinitely many natural numbers $k$ with $Q(3^{k})>Q(3^{k+1})$.
Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition
\[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \]
for all $a,b \in \mathbb{Z}_{p^n}.$
2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.