Found problems: 1782
There are 100 apples on the table with total weight of 10 kg. Each apple weighs no less than 25 grams. The apples need to be cut for 100 children so that each of the children gets 100 grams. Prove that you can do it in such a way that each piece weighs no less than 25 grams.
Let $S$ denote the set of words $W = w_1w_2\ldots w_n$ of any length $n\ge0$ (including the empty string $\lambda$), with each letter $w_i$ from the set $\{x,y,z\}$. Call two words $U,V$ [i]similar[/i] if we can insert a string $s\in\{xyz,yzx,zxy\}$ of three consecutive letters somewhere in $U$ (possibly at one of the ends) to obtain $V$ or somewhere in $V$ (again, possibly at one of the ends) to obtain $U$, and say a word $W$ is [i]trivial[/i] if for some nonnegative integer $m$, there exists a sequence $W_0,W_1,\ldots,W_m$ such that $W_0=\lambda$ is the empty string, $W_m=W$, and $W_i,W_{i+1}$ are similar for $i=0,1,\ldots,m-1$. Given that for two relatively prime positive integers $p,q$ we have
\[\frac{p}{q} = \sum_{n\ge0} f(n)\left(\frac{225}{8192}\right)^n,\]where $f(n)$ denotes the number of trivial words in $S$ of length $3n$ (in particular, $f(0)=1$), find $p+q$.
[i]Victor Wang[/i]
The sum of 5 consecutive even integers is $ 4$ less than the sum of the first $ 8$ consecutive odd counting numbers. What is the smallest of the even integers?
$ \textbf{(A)}\ 6 \qquad
\textbf{(B)}\ 8 \qquad
\textbf{(C)}\ 10 \qquad
\textbf{(D)}\ 12 \qquad
\textbf{(E)}\ 14$
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
The sequence $ a_n$ is defined as follows: $ a_0\equal{}1, a_1\equal{}1, a_{n\plus{}1}\equal{}\frac{1\plus{}a_{n}^2}{a_{n\minus{}1}}$.
Prove that all the terms of the sequence are integers.
For each positive integer $n$, define $H_n(x)=(-1)^ne^{x^2}\frac{d^n}{dx^n}e^{-x^2}.$
(1) Find $H_1(x),\ H_2(x),\ H_3(x)$.
(2) Express $\frac{d}{dx}H_n(x)$ interms of $H_n(x),\ H_{n+1}(x).$ Then prove that $H_n(x)$ is a polynpmial with degree $n$ by induction.
(3) Let $a$ be real number. For $n\geq 3$, express $S_n(a)=\int_0^a xH_n(x)e^{-x^2}dx$ in terms of $H_{n-1}(a),\ H_{n-2}(a),\ H_{n-2}(0)$.
(4) Find $\lim_{a\to\infty} S_6(a)$.
If necessary, you may use $\lim_{x\to\infty}x^ke^{-x^2}=0$ for a positive integer $k$.
Find all functions $ f :\mathbb{R}\to\mathbb{R} $, satisfying the condition
$f (xf (y) + f (x)) = 2f (x) + xy$
for any real $x$ and $y$.
Consider $n$ points $A_1,A_2,A_3,\ldots, A_n$ ($n\geq 4$) in the plane, such that any three are not collinear. Some pairs of distinct points among $A_1,A_2,A_3,\ldots, A_n$ are connected by segments, such that every point is connected with at least three different points. Prove that there exists $k>1$ and the distinct points $X_1,X_2,\ldots, X_{2k}$ in the set $\{A_1,A_2,A_3,\ldots, A_n\}$, such that for every $i\in \overline{1,2k-1}$ the point $X_i$ is connected with $X_{i+1}$, and $X_{2k}$ is connected with $X_1$.
Real numbers $a_{1},a_{2},\dots,a_{n}$ satisfy $a_{i}\geq\frac{1}{i}$, for all $i=\overline{1,n}$. Prove the inequality:
\[\left(a_{1}+1\right)\left(a_{2}+\frac{1}{2}\right)\cdot\dots\cdot\left(a_{n}+\frac{1}{n}\right)\geq\frac{2^{n}}{(n+1)!}(1+a_{1}+2a_{2}+\dots+na_{n}).\]
Suppose all the pairs of a positive integers from a finite collection \[A=\{a_{1}, a_{2}, \cdots \}\] are added together to form a new collection \[A^{*}=\{a_{i}+a_{j}\;\; \vert \; 1 \le i < j \le n \}.\] For example, $A=\{ 2, 3, 4, 7 \}$ would yield $A^{*}=\{ 5, 6, 7, 9, 10, 11 \}$ and $B=\{ 1, 4, 5, 6 \}$ would give $B^{*}=\{ 5, 6, 7, 9, 10, 11 \}$. These examples show that it's possible for different collections $A$ and $B$ to generate the same collections $A^{*}$ and $B^{*}$. Show that if $A^{*}=B^{*}$ for different sets $A$ and $B$, then $|A|=|B|$ and $|A|=|B|$ must be a power of $2$.
Consider the sequence $ \{a_n\}_{n\geq1}$ defined as follows: $ a_1 \equal{} 1$, $ a_{2k} \equal{} 1 \plus{} a_k$ and $ a_{2k \plus{} 1} \equal{} \frac {1}{a_{2k}}$ for every $ k\geq 1$. Prove that every positive rational number appears on the sequence $ \{a_n\}$ exactly once.
Two real sequence $ \{x_{n}\}$ and $ \{y_{n}\}$ satisfies following recurrence formula;
$ x_{0}\equal{} 1$, $ y_{0}\equal{} 2007$
$ x_{n\plus{}1}\equal{} x_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(y_{n}\plus{}y_{n\plus{}1})$,
$ y_{n\plus{}1}\equal{} y_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(x_{n}\plus{}x_{n\plus{}1})$
Then show that for all nonnegative integer $ n$, $ {x_{n}}^{2}\leq 2007$.
In a small town, there are $n \times n$ houses indexed by $(i, j)$ for $1 \leq i, j \leq n$ with $(1, 1)$ being the house at the top left corner, where $i$ and $j$ are the row and column indices, respectively. At time 0, a fire breaks out at the house indexed by $(1, c)$, where $c \leq \frac{n}{2}$. During each subsequent time interval $[t, t+1]$, the fire fighters defend a house which is not yet on fire while the fire spreads to all undefended [i]neighbors[/i] of each house which was on fire at time t. Once a house is defended, it remains so all the time. The process ends when the fire can no longer spread. At most how many houses can be saved by the fire fighters?
A house indexed by $(i, j)$ is a [i]neighbor[/i] of a house indexed by $(k, l)$ if $|i - k| + |j - l|=1$.
Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation
\[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\]
that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$
\begin{quote}
Ted quite likes haikus, \\
poems with five-seven-five, \\
but Ted knows few words.
He knows $2n$ words \\
that contain $n$ syllables \\
for every int $n$.
Ted can only write \\
$N$ distinct haikus. Find $N$. \\
Take mod one hundred.
\end{quote}
Ted loves creating haikus (Japanese three-line poems with $5$, $7$, $5$ syllables each), but his vocabulary is rather limited. In particular, for integers $1 \le n \le 7$, he knows $2n$ words with $n$ syllables. Furthermore, words cannot cross between lines, but may be repeated. If Ted can make $N$ distinct haikus, compute the remainder when $N$ is divided by $100$.
[i]Proposed by Lewis Chen[/i]
Prove that
$$1\cdot 4 + 2\cdot 5 + 3\cdot 6 + \cdots + n(n+3) = \frac{n(n+1)(n+5)}{3}$$
for all positive integer $n$.
The sequence $\{u_n\}$ is defined by $u_1 = 1, u_2 = 1, u_n = u_{n-1} + 2u_{n-2} for n \geq 3$. Prove that for any positive integers $n, p \ (p > 1), u_{n+p} = u_{n+1}u_{p} + 2u_nu_{p-1}$. Also find the greatest common divisor of $u_n$ and $u_{n+3}.$
For positive integers $ m$ and $ n$, let $ f\left(m,n\right)$ denote the number of $ n$-tuples $ \left(x_1,x_2,\dots,x_n\right)$ of integers such that $ \left|x_1\right| \plus{} \left|x_2\right| \plus{} \cdots \plus{} \left|x_n\right|\le m$. Show that $ f\left(m,n\right) \equal{} f\left(n,m\right)$.
The eyes of a magician are blindfolded while a person $A$ from the audience arranges $n$ identical coins in a row, some are heads and the others are tails. The assistant of the magician asks $A$ to write an integer between $1$ and $n$ inclusive and to show it to the audience. Having seen the number, the assistant chooses a coin and turns it to the other side (so if it was heads it becomes tails and vice versa) and does not touch anything else. Afterwards, the bandages are removed from the magician, he sees the sequence and guesses the written number by $A$. For which $n$ is this possible?
[hide=Spoiler hint] The original formulation asks: a) Show that if $n$ is possible, so is $2n$; b) Show that only powers of $2$ are possible; I have omitted this from the above formulation, for the reader's interest. [/hide]
Let $S$ be a set of $n$ points in the coordinate plane. Say that a pair of points is [i]aligned[/i] if the two points have the same $x$-coordinate or $y$-coordinate. Prove that $S$ can be partitioned into disjoint subsets such that (a) each of these subsets is a collinear set of points, and (b) at most $n^{3/2}$ unordered pairs of distinct points in $S$ are aligned but not in the same subset.
$a_0 = a_1 = 1$ and ${a_{n+1} . a_{n-1}} = a_n . (a_n + 1)$ for all positive integers n.
prove that $a_n$ is one integer for all positive integers n.
Find all injective functions $ f : \mathbb{N} \to \mathbb{N}$ which satisfy
\[ f(f(n)) \le\frac{n \plus{} f(n)}{2}\]
for each $ n \in \mathbb{N}$.
In boxes labeled $0$, $1$, $2$, $\dots$, we place integers according to the following rules:
$\bullet$ If $p$ is a prime number, we place it in box $1$.
$\bullet$ If $a$ is placed in box $m_a$ and $b$ is placed in box $m_b$, then $ab$ is placed in the box labeled $am_b+bm_a$.
Find all positive integers $n$ that are placed in the box labeled $n$.
Let $n > 1$ be an integer. Find, with proof, all sequences $x_1 , x_2 , \ldots , x_{n-1}$ of positive integers with the following three properties:
(a). $x_1 < x_2 < \cdots < x_{n-1}$ ;
(b). $x_i + x_{n-i} = 2n$ for all $i = 1, 2, \ldots , n - 1$;
(c). given any two indices $i$ and $j$ (not necessarily distinct) for which $x_i + x_j < 2n$, there is an index $k$ such that $x_i + x_j = x_k$.
For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares.
$(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard?
$(b)$ When it is possible, find the minimum number of trominoes needed.