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

Let $x_1=y_1=x_2=y_2=1$, then for $n\geq 3$ let $x_n=x_{n-1}y_{n-2}+x_{n-2}y_{n-1}$ and $y_n=y_{n-1}y_{n-2}-x_{n-1}x_{n-2}$. What are the last two digits of $|x_{2012}|?$
Triangle $ ABC$ has incentre $ I$ and the incircle touches $ BC, CA$ at $ D, E$ respectively. Let $ BI$ meet $ DE$ at $ G$. Show that $ AG$ is perpendicular to $ BG$.
Let $n$ be a positive integer. Let $D_n$ be the set of all divisors of $n$ and let $f(n)$ denote the smallest natural $m$ such that the elements of $D_n$ are pairwise distinct in mod $m$. Show that there exists a natural $N$ such that for all $n \geq N$, one has $f(n) \leq n^{0.01}$.
Let $ f(n)$ be a function defined on the set of all positive integers and having its values in the same set. Suppose that $ f(f(n) \plus{} f(m)) \equal{} m \plus{} n$ for all positive integers $ n,m.$ Find the possible value for $ f(1988).$
Find all positive integers $n$ such that the set $S=\{1,2,3, \dots 2n\}$ can be divided into $2$ disjoint subsets $S_1$ and $S_2$, i.e. $S_1 \cap S_2 = \emptyset$ and $S_1 \cup S_2 = S$, such that each one of them has $n$ elements, and the sum of the elements of $S_1$ is divisible by the sum of the elements in $S_2$. [i]Proposed by Viktor Simjanoski[/i]
Determine the minimum value of $a^{2} + b^{2}$ when $(a,b)$ traverses all the pairs of real numbers for which the equation \[ x^{4} + ax^{3} + bx^{2} + ax + 1 = 0 \] has at least one real root.
There are at least $3$ subway stations in a city. In this city, there exists a route that passes through more than $L$ subway stations, without revisiting. Subways run both ways, which means that if you can go from subway station A to B, you can also go from B to A. Prove that at least one of the two holds. $\text{(i)}$. There exists three subway stations $A$, $B$, $C$ such that there does not exist a route from $A$ to $B$ which doesn't pass through $C$. $\text{(ii)}$. There is a cycle passing through at least $\lfloor \sqrt{2L} \rfloor$ stations, without revisiting a same station more than once.
If the value of $20$ quarters and $10$ dimes equals the value of $10$ quarters and $n$ dimes, then $n=$ $\text{(A)}\ 10 \qquad \text{(B)}\ 20 \qquad \text{(C)}\ 30 \qquad \text{(D)}\ 35 \qquad \text{(E)}\ 45$
Prove that the number of solutions in $ \left( \mathbb{N}\cup\{ 0 \} \right)\times \left( \mathbb{N}\cup\{ 0 \} \right)\times \left( \mathbb{N}\cup\{ 0 \} \right) $ of the parametric equation $$ \sqrt{x^2+y+n}+\sqrt{y^2+x+n} = z, $$ is greater than zero and finite, for nay natural number $ n. $
The figure below shows a ring made of six small sections which you are to paint on a wall. You have four paint colors available and will paint each of the six sections a solid color. Find the number of ways you can choose to paint each of the six sections if no two adjacent section can be painted with the same color. [asy] size(3cm); draw(unitcircle); draw(scale(0.6)*unitcircle); for(int i = 0; i < 6; ++i){ draw(dir(60*i)--0.6*dir(60*i)); } [/asy]
A rectangle is divided into $2\times 1$ and $1\times 2$ dominoes. In each domino, a diagonal is drawn, and no two diagonals have common endpoints. Prove that exactly two corners of the rectangle are endpoints of these diagonals.
Does there exist a non-constant infinite sequence of distinct natural numbers such that for all large enough $k$ we have that sum of any $k$-sized sub-sequence is square-free if and only if $k$ is square-free. [i]Proposed by Alireza Haqi, Amir Rezaie Moghadam [/i] [b]Rated 3[/b]
$A, B, C$, and $D$ are all on a circle, and $ABCD$ is a convex quadrilateral. If $AB = 13$, $BC = 13$, $CD = 37$, and $AD = 47$, what is the area of $ABCD$?
Let $r_k$ denote the remainder when ${127 \choose k}$ is divided by $8$. Compute$ r_1 + 2r_2 + 3r_3 + · · · + 63r_{63}.$
The inscribed circle of the triangle $ABC$ touches its sides $AB, BC, CA$, at points $K,N, M$ respectively. It is known that $\angle ANM = \angle CKM$. Prove that the triangle $ABC$ is isosceles. (Vyacheslav Yasinsky)
What is the sum of the leading (first) digits of the integers from $ 1$ to $2019$ when the integers are written in base $3$? Give your answer in base $10$.
In the binomial expansion of $(\sqrt{x}+2)^{2n+1}$, sum of coefficients that power of $x$ is an integer is________.
In a long line of people, the 1013th person from the left is also the 1010th person from the right. How many people are in the line? $ \textbf{(A) }2021 \qquad \textbf{(B) }2022 \qquad \textbf{(C) }2023 \qquad \textbf{(D) }2024 \qquad \textbf{(E) }2025 \qquad $
Suppose $a$, $b$, $c$ are three positive real numbers with $a + b + c = 3$. Prove that $$\frac{a}{b^2 + c}+\frac{b}{c^2 + a}+\frac{c}{a^2 + b}\geq \frac{3}{2}$$
A set of (unit) squares of a $n\times n$ table is called [i]convenient[/i] if each row and each column of the table contains at least two squares belonging to the set. For each $n\geq 5$ determine the maximum $m$ for which there exists a [i]convenient [/i] set made of $m$ squares, which becomes in[i]convenient [/i] when any of its squares is removed.
Let B,C be fixed points and A be roving point. Let H, G be orthecentre and centroid of triagle ABC. Known midpoint of HG lies on BC, find locus of A
Suppose $a,b,c$ are the sides of a triangle. Prove that \[ a^2(b+c-a)+b^2(a+c-b)+c^2(a+b-c) \leq 3abc \]
In a table tennis tournament every participant played every other participant exactly once. Although there were twice as many right-handed players as left-handed players, the number of games won by left-handed players was $40\%$ more than the number of games won by right-handed players. (There were no ties and no ambidextrous players.) What is the total number of games played? $\textbf{(A) }15\qquad\textbf{(B) }36\qquad\textbf{(C) }45\qquad\textbf{(D) }48\qquad\textbf{(E) }66$
In triangle $ABC$, let $A'$, $B'$ and $C'$ be points on the sides $BC$, $CA$ and $AB$, respectively, such that$$\frac{BA'}{A'C}=\frac{CB'}{B'A}=\frac{AC'}{C'B}.$$ The line parallel to $B'C'$ passing through $A'$ intersects line $AC$ at $P$ and line $AB$ at $Q$. Prove that$$\frac{PQ}{B'C'} \geqslant 2.$$
$1989$ equal circles are arbitrarily placed on the table without overlap. What is the least number of colors are needed such that all the circles can be painted with any two tangential circles colored differently.