This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

Define the sequence $A_1, A_2, A_3, \dots$ by $A_1 = 1$ and for $n=1,2,3,\dots$ $$A_{n+1}=\frac{A_n+2}{A_n +1}.$$ Define the sequences $B_1, B_2, B_3,\dots$ by $B_1=1$ and for $n=1,2,3,\dots$ $$B_{n+1}=\frac{B_n^2 +2}{2B_n}.$$ Prove that $B_{n+1}=A_{2^n}$ for all non-negative integers $n$.
Let $ABCD$ and $WXYZ$ be two squares that share the same center such that $WX \parallel AB$ and $WX < AB.$ Lines $CX$ and $AB$ intersect at $P,$ and lines $CZ$ and $AD$ intersect at $Q.$ If points $P, W,$ and $Q$ are collinear, compute the ratio $AB/WX.$
A jar contains $2$ yellow candies, $4$ red candies, and $6$ blue candies. Candies are randomly drawn out of the jar one-by-one and eaten. The probability that the $2$ yellow candies will be eaten before any of the red candies are eaten is given by the fraction $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
A circle is divided into $n$ sectors ($n \geq 3$). Each sector can be filled in with either $1$ or $0$. Choose any sector $\mathcal{C}$ occupied by $0$, change it into a $1$ and simultaneously change the symbols $x, y$ in the two sectors adjacent to $\mathcal{C}$ to their complements $1-x$, $1-y$. We repeat this process as long as there exists a zero in some sector. In the initial configuration there is a $0$ in one sector and $1$s elsewhere. For which values of $n$ can we end this process?
A function $g$ is such that for all integer $n$: $$g(n)=\begin{cases} 1\hspace{0.5cm} \textrm{if}\hspace{0.1cm} n\geq 1 & \\ 0 \hspace{0.5cm} \textrm{if}\hspace{0.1cm} n\leq 0 & \end{cases}$$ A function $f$ is such that for all integers $n\geq 0$ and $m\geq 0$: $$f(0,m)=0 \hspace{0.5cm} \textrm{and}$$ $$f(n+1,m)=\Bigl(1-g(m)+g(m)\cdot g(m-1-f(n,m))\Bigr)\cdot\Bigl(1+f(n,m)\Bigr)$$ Find all the possible functions $f(m,n)$ that satisfies the above for all integers $n\geq0$ and $m\geq 0$
Prove the inequality $$ \frac{y^2-x^2}{2x^2+1}+\frac{z^2-y^2}{2y^2+1}+\frac{x^2-z^2}{2z^2+1} \geq 0$$ where $x$, $y$ and $z$ are real numbers
Prove that $\frac{ab}{a+b}+\frac{bc}{b+c}+\frac{ca}{c+a}\le \frac{a+b+c}{2}$, where $a,b,c\in\mathbb{R}^{+}$.
At the beginning of the school year, Lisa’s goal was to earn an A on at least $ 80\%$ of her $ 50$ quizzes for the year. She earned an A on $ 22$ of the first $ 30$ quizzes. If she is to achieve her goal, on at most how many of the remaining quizzes can she earn a grade lower than an A? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$
Let $ f ( x , y ) = ( x + y ) / 2 , g ( x , y ) = \sqrt { x y } , h ( x , y ) = 2 x y / ( x + y ) $, and let $$ S = \{ ( a , b ) \in \mathrm { N } \times \mathrm { N } | a \neq b \text { and } f( a , b ) , g ( a , b ) , h ( a , b ) \in \mathrm { N } \} $$ where $\mathbb{N}$ denotes the positive integers. Find the minimum of $f$ over $S$.
Let $ABC$ be a triangle such that $\angle CAB = 60^o$. Consider $D, E$ points on sides $AC$ and $AB$ respectively such that $BD$ bisects angle $\angle ABC$ , $CE$ bisects angle $\angle BCA$ and let $I$ be the intersection of them. Prove that $|ID| =|IE|$.
Let $ABCD$ be a cyclic quadrilateral such that the lines $AB$ and $CD$ intersects in $K$, let $M$ and $N$ be the midpoints of $AC$ and $CK$ respectively. Find the possible value(s) of $\angle ADC$ if the quadrilateral $MBND$ is cyclic.
What is $3^{2002}$ in $\bmod 11$? $ \textbf{a)}\ 1 \qquad\textbf{b)}\ 3 \qquad\textbf{c)}\ 4 \qquad\textbf{d)}\ 5 \qquad\textbf{e)}\ \text{None of above} $
Compute the unique real numbers $x<3$ such that $$\sqrt{(3-x)(4-x)}+\sqrt{(4-x)(6-x)}+\sqrt{(6-x)(3-x)}=x.$$
$\triangle ABC$ satisfies $\angle A=60^{\circ}$. Call its circumcenter and orthocenter $O, H$, respectively. Let $M$ be a point on the segment $BH$, then choose a point $N$ on the line $CH$ such that $H$ lies between $C, N$, and $\overline{BM}=\overline{CN}$. Find all possible value of \[\frac{\overline{MH}+\overline{NH}}{\overline{OH}}\]
After how much time will the particle first return to the origin? (A) $\text{0.785 s}$ (B) $\text{1.26 s}$ (C) $\text{1.57 s}$ (D) $\text{2.00 s}$ (E) $\text{3.14 s}$
Positive integer numbers $k$ and $n$ satisfy the inequality $k > n!$. Prove that there exist pairwisely different prime numbers $p_1, p_2, \ldots, p_n$ which are divisors of the numbers $k+1, k+2, \ldots, k+n$ respectively (i.e. $p_i|k+i$).
Let $ m$ a positive integer and $ p$ a prime number, both fixed. Define $ S$ the set of all $ m$-uple of positive integers $ \vec{v} \equal{} (v_1,v_2,\ldots,v_m)$ such that $ 1 \le v_i \le p$ for all $ 1 \le i \le m$. Define also the function $ f(\cdot): \mathbb{N}^m \to \mathbb{N}$, that associates every $ m$-upla of non negative integers $ (a_1,a_2,\ldots,a_m)$ to the integer $ \displaystyle f(a_1,a_2,\ldots,a_m) \equal{} \sum_{\vec{v} \in S} \left(\prod_{1 \le i \le m}{v_i^{a_i}} \right)$. Find all $ m$-uple of non negative integers $ (a_1,a_2,\ldots,a_m)$ such that $ p \mid f(a_1,a_2,\ldots,a_m)$. [i](Pierfrancesco Carlucci)[/i]
Each of the sides of a square $ S_1$ with area $ 16$ is bisected, and a smaller square $ S_2$ is constructed using the bisection points as vertices. The same process is carried out on $ S_2$ to construct an even smaller square $ S_3$. What is the area of $ S_3$? $ \textbf{(A)}\ \frac {1}{2} \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$
If $a$ and $b$ are integers such that $x^2 - x - 1$ is a factor of $ax^3 + bx^2 + 1$, then $b$ is $ \textbf{(A)}\ -2\qquad\textbf{(B)}\ -1\qquad\textbf{(C)}\ 0\qquad\textbf{(D)}\ 1\qquad\textbf{(E)}\ 2 $
For $n \ge 3$, let $S=a_1+a_2+\cdots+a_n$ and $T=b_1b_2\cdots b_n$ for positive real numbers $a_1,a_2,\ldots,a_n, b_1,b_2 ,\ldots,b_n$, where the numbers $b_i$ are pairwise distinct. (a) Find the number of distinct real zeroes of the polynomial \[f(x)=(x-b_1)(x-b_2)\cdots(x-b_n)\sum_{j=1}^n \frac{a_j}{x-b_j}\] (b) Prove the inequality \[\frac1{n-1}\sum_{j=1}^n \left(1-\frac{a_j}{S}\right)b_j > \left(\frac{T}{S}\sum_{j=1}^{n} \frac{a_j}{b_j}\right)^{\frac1{n-1}}\]
$-15+9\times (6\div 3) =$ $\text{(A)}\ -48 \qquad \text{(B)}\ -12 \qquad \text{(C)}\ -3 \qquad \text{(D)}\ 3 \qquad \text{(E)}\ 12$
Find all functions from the reals to the reals satisfying \[f(xf(y) + x) = xy + f(x)\]
In triangle $[ABC]$, the bisector in $C$ and the altitude passing through $B$ intersect at point $D$. Point $E$ is the symmetric of point $D$ wrt $BC$ and lies on the circle circumscribed to the triangle $[ABC]$. Prove that the triangle is $[ABC]$ isosceles.
14 students attend the IMO training camp. Every student has at least $k$ favourite numbers. The organisers want to give each student a shirt with one of the student's favourite numbers on the back. Determine the least $k$, such that this is always possible if: $a)$ The students can be arranged in a circle such that every two students sitting next to one another have different numbers. $b)$ $7$ of the students are boys, the rest are girls, and there isn't a boy and a girl with the same number.
Compute $\displaystyle \sum_{k=1}^{1009} (-1)^{k+1} \dbinom{2018-k}{k-1} 2^{2019 - 2k}$.