Found problems: 85335
Given a natural number $n\ge 3$, determine all strictly increasing sequences $a_1<a_2<\cdots<a_n$ such that $\text{gcd}(a_1,a_2)=1$ and for any pair of natural numbers $(k,m)$ satisfy $n\ge m\ge 3$, $m\ge k$, $$\frac{a_1+a_2+\cdots +a_m}{a_k}$$ is a positive integer.
There are $12$ candies on the table, four of which are rare candies. Chad has a friend who can tell rare candies apart from regular candies, but Chad can’t. Chad’s friend is allowed to take four candies from the table, but may not take any rare candies. Can his friend always take four candies in such a way that Chad will then be able to identify the four rare candies? If so, describe a strategy. If not, prove that it cannot be done.
Note that Chad does not know anything about how the candies were selected (e.g. the order in which they were selected). However, Chad and his friend may communicate beforehand.
Let $x_1,x_2,...,x_n$ be real numbers in an interval $[m,M]$ such that $\sum_{i=1}^n x_i = 0$. Show that $\sum_{i=1}^n x_i ^2 \le -nmM$
For a triangle $T$ and a line $d$, if the feet of perpendicular lines from a point in the plane to the edges of $T$ all lie on $d$, say $d$ focuses $T$. If the set of lines focusing $T_1$ and the set of lines focusing $T_2$ are the same, say $T_1$ and $T_2$ are equivalent. Prove that, for any triangle in the plane, there exists exactly one equilateral triangle which is equivalent to it.
Suppose $15\%$ of $x$ equals $20\%$ of $y$. What percentage of $x$ is $y$?
$\textbf{(A)}\ 5~~\qquad\textbf{(B)}\ 35~~\qquad~~\textbf{(C)}\ 75\qquad~~\textbf{(D)}\ 133\frac13\qquad~~ \textbf{(E)}\ 300$
In triangle $ABC$, $\tan \angle CAB = 22/7$, and the altitude from $A$ divides $BC$ into segments of length 3 and 17. What is the area of triangle $ABC$?
[b](1)[/b] Find the number of positive integer solutions $(m,n,r)$ of the indeterminate equation $mn+nr+mr=2(m+n+r)$.
[b](2)[/b] Given an integer $k (k>1)$, prove that indeterminate equation $mn+nr+mr=k(m+n+r)$ has at least $3k+1$ positive integer solutions $(m,n,r)$.
Let $D$ and $E$ be points in the interiors of sides $AB$ and $AC$, respectively, of a triangle $ABC$, such that $DB = BC = CE$. Let the lines $CD$ and $BE$ meet at $F$. Prove that the incentre $I$ of triangle $ABC$, the orthocentre $H$ of triangle $DEF$ and the midpoint $M$ of the arc $BAC$ of the circumcircle of triangle $ABC$ are collinear.
How many integers belong to ($a,2008a$), where $a$ ($a > 0$) is given.
Find the shortest distance between the graphs of $y=x^2+5$ and $x=y^2+5$.
[i]Proposed by Nathan Ramesh
A crazy physicist has discovered a new particle called an omon. He has a machine, which takes two omons of mass $a$ and $b$ and entangles them; this process destroys the omon with mass $a$, preserves the one with mass $b$, and creates a new omon whose mass is $\frac 12 (a+b)$. The physicist can then repeat the process with the two resulting omons, choosing which omon to destroy at every step. The physicist initially has two omons whose masses are distinct positive integers less than $1000$. What is the maximum possible number of times he can use his machine without producing an omon whose mass is not an integer?
[i]Proposed by Michael Kural[/i]
The nine squares in the table shown are to be filled so that every row and every column contains each of the numbers $1,2,3$. Then $A+B=$
\[\begin{tabular}{|c|c|c|} \hline
1 & & \\ \hline
& 2 & A \\ \hline
& & B \\ \hline
\end{tabular}\]
$\text{(A)}\ 2 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 5 \qquad \text{(E)}\ 6$
Pablo buys popsicles for his friends. The store sells single popsicles for $\$1$ each, 3-popsicle boxes for $\$2$, and 5-popsicle boxes for $\$3$. What is the greatest number of popsicles that Pablo can buy with $\$8$?
$\textbf{(A)}\ 8\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 13\qquad\textbf{(E)}\ 15$
Determine all intergers $n\geq 2$ such that $a+\sqrt{2}$ and $a^n+\sqrt{2}$ are both rational for some real number $a$ depending on $n$
Show that the number of non-zero integers in the expansion of the $n$-th order determinant having zeroes in the main diagonal and ones elsewhere is
$$n ! \left(1- \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \cdots + \frac{(-1)^{n}}{n!} \right) .$$
Let $\sigma_n$ be a permutation of $\{1,\ldots,n\}$; that is, $\sigma_n(i)$ is a bijective function from $\{1,\ldots,n\}$ to itself. Define $f(\sigma)$ to be the number of times we need to apply $\sigma$ to the identity in order to get the identity back. For example, $f$ of the identity is just $1$, and all other permutations have $f(\sigma)>1$. What is the smallest $n$ such that there exists a $\sigma_n$ with $f(\sigma_n)=k$?
Let $f(x)$ be a continuous function, whose first and second derivatives are continuous on $[0,2\pi]$ and $f''(x) \geq 0$ for all $x$ in $[0,2\pi]$. Show that
\[\int_{0}^{2\pi} f(x)\cos x dx \geq 0\]
Point $M$ lies inside an isosceles right $\triangle ABC$ with hypotenuse $AB$ such that $MA=5$, $MB=7$, $MC=4\sqrt{2}$. Find $\angle AMC$.
For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$.
Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$.
[i]Proposed by Georgia[/i]
Evaluate
$$ \lim_{x\to \infty} \left( \frac{a^x -1}{x(a-1)} \right)^{1\slash x},$$
where $a>0$ and $a\ne 1.$
In triangle $ABC$ with $CA=CB$, point $E$ lies on the circumcircle of $ABC$ such that $\angle ECB=90^{\circ}$. The line through $E$ parallel to $CB$ intersects $CA$ in $F$ and $AB$ in $G$. Prove that the center of the circumcircle of triangle $EGB$ lies on the circumcircle of triangle $ECF$.
Proposed by Prithwijit De
Let $a_1=1,$ $a_2=2,$ $a_n=2a_{n-1}+a_{n-2},$ $n=3,4,\cdots.$ Prove that for any integer $n\geq5,$ $a_n$ has at least one prime factor $p,$ such that $p\equiv 1\pmod{4}.$
Let $ABC$ be a triangle in which no angle is $90^{\circ}$. For any point $P$ in the plane of the triangle, let $A_1, B_1, C_1$ denote the reflections of $P$ in the sides $BC,CA,AB$ respectively. Prove that
(i) If $P$ is the incenter or an excentre of $ABC$, then $P$ is the circumenter of $A_1B_1C_1$;
(ii) If $P$ is the circumcentre of $ABC$, then $P$ is the orthocentre of $A_1B_1C_1$;
(iii) If $P$ is the orthocentre of $ABC$, then $P$ is either the incentre or an excentre of $A_1B_1C_1$.
Prove that there exists a positive integer $k$ such that $k\cdot2^n+1$ is composite for every integer $n$.
Let $k>1$ be a positive integer and $n>2018$ an odd positive integer. The non-zero rational numbers $x_1,x_2,\ldots,x_n$ are not all equal and:
$$x_1+\frac{k}{x_2}=x_2+\frac{k}{x_3}=x_3+\frac{k}{x_4}=\ldots=x_{n-1}+\frac{k}{x_n}=x_n+\frac{k}{x_1}$$
Find the minimum value of $k$, such that the above relations hold.