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

Find all positive integers $a, b, c$ such that $ab + 1$, $bc + 1$, and $ca + 1$ are all equal to factorials of some positive integers. Proposed by [i]Nikola Velov, Macedonia[/i]
Let $ABCD$ be a convex quadrilateral, and let $P$, $Q$, $R$, and $S$ be points on the sides $AB$, $BC$, $CD$, and $DA$, respectively. Let the line segment $PR$ and $QS$ meet at $O$. Suppose that each of the quadrilaterals $APOS$, $BQOP$, $CROQ$, and $DSOR$ has an incircle. Prove that the lines $AC$, $PQ$, and $RS$ are either concurrent or parallel to each other.
The sum of the two $ 5$-digit numbers $ AMC10$ and $ AMC12$ is $ 123422$. What is $ A\plus{}M\plus{}C$? $ \textbf{(A)}\ 10 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 13 \qquad \textbf{(E)}\ 14$
A $\textit{cubic sequence}$ is a sequence of integers given by $a_n =n^3 + bn^2 + cn + d$, where $b, c$ and $d$ are integer constants and $n$ ranges over all integers, including negative integers. $\textbf{(a)}$ Show that there exists a cubic sequence such that the only terms of the sequence which are squares of integers are $a_{2015}$ and $a_{2016}$. $\textbf{(b)}$ Determine the possible values of $a_{2015} \cdot a_{2016}$ for a cubic sequence satisfying the condition in part $\textbf{(a)}$.
A positive integer $M$ has been represented as a product of primes. Each of these primes is increased by 1 . The product $N$ of the new multipliers is divisible by $M$ . Prove that if we represent $N$ as a product of primes and increase each of them by 1 then the product of the new multipliers will be divisible by $N$ . Alexandr Gribalko
Determine all polynomials $P(x)$ with degree $n\geq 1$ and integer coefficients so that for every real number $x$ the following condition is satisfied $$P(x)=(x-P(0))(x-P(1))(x-P(2))\cdots (x-P(n-1))$$
Let $a,b,c$ be the lengths of the sides of a triangle. Prove that, $\left|\frac {a}{b}+\frac {b}{c}+\frac {c}{a}-\frac {b}{a}-\frac {c}{b}-\frac {a}{c}\right|<1$
Let be given a semi-sphere $\Sigma$ whose base-circle lies on plane $p$. A variable plane $Q$, parallel to a fixed plane non-perpendicular to $P$, cuts $\Sigma$ at a circle $C$. We denote by $C'$ the orthogonal projection of $C$ onto $P$. Find the position of $Q$ for which the cylinder with bases $C$ and $C'$ has the maximum volume.
Let $x$ and $y$ be distinct positive integers below $15$. For any two distinct numbers $a, b$ from the set $\{2, x,y\}$, $ab + 1$ is always a positive square. Find all possible values of the square $xy + 1$.
Let $ ABC $ be an acutangle triangle and $ D $ any point on the $ BC $ side. Let $ E $ be the symmetrical of $ D $ in $ AC $ and $ F $ is the symmetrical $ D $ relative to $ AB $. $ A $ straight $ ED $ intersects straight $ AB $ at $ G $, while straight $ F D $ intersects the line $ AC $ in $ H $. Prove that the points $ A, E, F, G$ and $ H $ are on the same circumference.
What is the value of $$2^{\left(0^{\left(1^9\right)}\right)}+\left(\left(2^0\right)^1\right)^9\,?$$ $\textbf{(A) } 0 \qquad\textbf{(B) } 1 \qquad\textbf{(C) } 2 \qquad\textbf{(D) } 3 \qquad\textbf{(E) } 4$
At the round table, $10$ people are sitting, some of them are knights, and the rest are liars (knights always say pride, and liars always lie) . It is clear thath I have at least one knight and at least one liar. What is the largest number of those sitting at the table can say: ''Both of my neighbors are knights '' ? (A statement that is at least partially false is considered false.)
An acute triangle $\triangle ABC$ has incenter $I$, and the incircle hits $BC, CA, AB$ at $D, E, F$. Lines $BI, CI, BC, DI$ hits $EF$ at $K, L, M, Q$ and the line connecting the midpoint of segment $CL$ and $M$ hits the line segment $CK$ at $P$. Prove that $$PQ=\frac{AB \cdot KQ}{BI}$$
Kevin the Koala eats $1$ leaf on the first day of its life, $3$ leaves on the second, $5$ on the third, and in general eats $2n-1$ leaves on the $n$th day. What is the smallest positive integer $n>1$ such that the total number of leaves Kevin has eaten his entire $n$-day life is a perfect sixth power? [i]2015 CCA Math Bonanza Individual Round #4[/i]
Let $k$ be a positive real. $A$ and $B$ play the following game: at the start, there are $80$ zeroes arrange around a circle. Each turn, $A$ increases some of these $80$ numbers, such that the total sum added is $1$. Next, $B$ selects ten consecutive numbers with the largest sum, and reduces them all to $0$. $A$ then wins the game if he/she can ensure that at least one of the number is $\geq k$ at some finite point of time. Determine all $k$ such that $A$ can always win the game.
Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that $$\sqrt{\frac{a^3}{1+bc}}+\sqrt{\frac{b^3}{1+ac}}+\sqrt{\frac{c^3}{1+ab}}\geq 2$$ Are there any triples $(a,b,c)$, for which the equality holds? [i]Proposed by Konstantinos Metaxas.[/i]
In a right triangle rectangle $ABC$ such that $AB = AC$, $M$ is the midpoint of $BC$. Let $P$ be a point on the perpendicular bisector of $AC$, lying in the semi-plane determined by $BC$ that does not contain $A$. Lines $CP$ and $AM$ intersect at $Q$. Calculate the angles that form the lines $AP$ and $BQ$.
Determine the smallest integer of the form $\frac{ \overline{AB}}{B}$ .where $A$ and $B$ are three-digit positive integers and $\overline{AB}$ denotes the six-digit number that is form by writing the numbers $A$ and $B$ consecutively.
Prove that every real positive number may be represented as a sum of nine numbers whose decimal representation consists of the digits $0$ and $7$. (E Turkevich)
Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous function such that for all $x\in\mathbb{R}$ and for all $t\geqslant 0$, $$f(x)=f(e^tx)$$ Show that $f$ is a constant function.
Let $ ABCD $ be a convex quadrilateral with no pair of parallel sides, such that $ \angle ABC = \angle CDA $. Assume that the intersections of the pairs of neighbouring angle bisectors of $ ABCD $ form a convex quadrilateral $ EFGH $. Let $ K $ be the intersection of the diagonals of $ EFGH$. Prove that the lines $ AB $ and $ CD $ intersect on the circumcircle of the triangle $ BKD $.
A square with integer side length is cut into 10 squares, all of which have integer side length and at least 8 of which have area 1. What is the smallest possible value of the length of the side of the original square? $\textbf{(A)}\hspace{.05in}3 \qquad \textbf{(B)}\hspace{.05in}4 \qquad \textbf{(C)}\hspace{.05in}5 \qquad \textbf{(D)}\hspace{.05in}6 \qquad \textbf{(E)}\hspace{.05in}7 $
A line meets a segment $AB$ at point $C$. Which is the maximal number of points $X$ of this line such that one of angles $AXC$ and $BXC$ is equlal to a half of the second one?
Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]