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 $m, n$ be positive integers. Show that the polynomial $$f(x)=x^m(x^2-100)^n-11$$ cannot be expressed as a product of two non-constant polynomials with integral coefficients.
Let the $ABCD$ be a quadrilateral without parallel sides, inscribed in a circle. Let $P$ and $Q$ be the intersection points between the lines containing the quadrilateral opposite sides. Show that the bisectors to the angles at $P$ and $Q$ are parallel to the bisectors of the angles at the intersection point of the diagonals of the quadrilateral.
Big Al, the ape, ate 100 bananas from May 1 through May 5. Each day he ate six more bananas than on the previous day. How many bananas did Big Al eat on May 5? $ \textbf{(A)}\ 20\qquad\textbf{(B)}\ 22\qquad\textbf{(C)}\ 30\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 34 $
Show that the number \[\sqrt[n]{\sqrt{2019} + \sqrt{2018}} + \sqrt[n]{\sqrt{2019} - \sqrt{2018}}\] is irrational for any $n\ge 2$.
In $\vartriangle ABC$, the incircle is tangent to the sides $BC, CA, AB$ at $D, E, F$ respectively. Let $P$ and $Q$ be the midpoints of $DF$ and $DE$ respectively. Lines $P C$ and $DE$ intersect at $R$, and lines $BQ$ and$ DF$ intersect at $S$. Prove that a) Points $B, C, P, Q$ lie on a circle. b) Points $P, Q, R, S$ lie on a circle.
Each point on the plane is colored either red, green, or blue. Prove that there exists an isosceles triangle whose vertices all have the same color.
Two lines parallel to the $x$-axis cut the graph of $y=ax^3+bx^2+cx+d$ in points $A,C,E$ and $B,D,F$ respectively, in that order from left to right. Prove that the length of the projection of the segment $CD$ onto the $x$-axis equals the sum of the lengths of the projections of $AB$ and $EF$.
Let $\omega_{1}$ be a circle with centre $O$. $P$ is a point on $\omega_{1}$. $\omega_{2}$ is a circle with centre $P$, with radius smaller than $\omega_{1}$. $\omega_{1}$ meets $\omega_{2}$ at points $T$ and $Q$. Let $TR$ be a diameter of $\omega_{2}$. Draw another two circles with $RQ$ as the radius, $R$ and $P$ as the centres. These two circles meet at point $M$, with $M$ and $Q$ lie on the same side of $PR$. A circle with centre $M$ and radius $MR$ intersects $\omega_{2}$ at $R$ and $N$. Prove that a circle with centre $T$ and radius $TN$ passes through $O$.
Inside the segment $AC$, an arbitrary point $B$ is selected and circles with diameters $AB$ and $BC$ are constructed. Points $M$ and $L$ are chosen on the circles (in one half-plane with respect to $AC$), respectively, so that $\angle MBA = \angle LBC$. Points $K$ and $F$ are marked, respectively, on rays $BM$ and $BL$ so that $BK = BC$ and $BF = AB$. Prove that points $M, K, F$ and $L$ lie on the same circle.
In the following diagram, $O$ is the center of the circle. If three angles $\alpha, \beta$ and $\gamma$ be equal, find $\alpha.$ [asy] unitsize(40); import graph; size(300); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen ttttff = rgb(0.2,0.2,1); pen ffttww = rgb(1,0.2,0.4); pen qqwuqq = rgb(0,0.39,0); draw(circle((0,0),2.33),ttttff+linewidth(2.8pt)); draw((-1.95,-1.27)--(0.64,2.24),ffttww+linewidth(2pt)); draw((0.64,2.24)--(1.67,-1.63),ffttww+linewidth(2pt)); draw((-1.95,-1.27)--(1.06,0.67),ffttww+linewidth(2pt)); draw((1.67,-1.63)--(-0.6,0.56),ffttww+linewidth(2pt)); draw((-0.6,0.56)--(1.06,0.67),ffttww+linewidth(2pt)); pair parametricplot0_cus(real t){ return (0.6*cos(t)+0.64,0.6*sin(t)+2.24); } draw(graph(parametricplot0_cus,-2.2073069497794027,-1.3111498158746024)--(0.64,2.24)--cycle,qqwuqq); pair parametricplot1_cus(real t){ return (0.6*cos(t)+-0.6,0.6*sin(t)+0.56); } draw(graph(parametricplot1_cus,0.06654165390165974,0.9342857038103908)--(-0.6,0.56)--cycle,qqwuqq); pair parametricplot2_cus(real t){ return (0.6*cos(t)+-0.6,0.6*sin(t)+0.56); } draw(graph(parametricplot2_cus,-0.766242589858673,0.06654165390165967)--(-0.6,0.56)--cycle,qqwuqq); dot((0,0),ds); label("$O$", (-0.2,-0.38), NE*lsf); dot((0.64,2.24),ds); label("$A$", (0.72,2.36), NE*lsf); dot((-1.95,-1.27),ds); label("$B$", (-2.2,-1.58), NE*lsf); dot((1.67,-1.63),ds); label("$C$", (1.78,-1.96), NE*lsf); dot((1.06,0.67),ds); label("$E$", (1.14,0.78), NE*lsf); dot((-0.6,0.56),ds); label("$D$", (-0.92,0.7), NE*lsf); label("$\alpha$", (0.48,1.38),NE*lsf); label("$\beta$", (-0.02,0.94),NE*lsf); label("$\gamma$", (0.04,0.22),NE*lsf); clip((-8.84,-9.24)--(-8.84,8)--(11.64,8)--(11.64,-9.24)--cycle); [/asy]
$a,b,c,x,y,z$ are positive real numbers and $bz+cy=a$, $az+cx=b$, $ay+bx=c$. Find the least value of following function $f(x,y,z)=\frac{x^2}{1+x}+\frac{y^2}{1+y}+\frac{z^2}{1+z}$
Let $\triangle ABC$ be a triangle with $AB=AC$. Let $D$ be a point on the segment $BC$ such that $BD= 48 \frac{1}{61}$ and $DC=61$. Let $E$ be a point on $AD$ such that $CE$ is perpendicular to $AD$ and $DE=11$. Find $AE$.
Let $E$ and $F$ be the midpoints of the lines $AB$ and $DA$ of a square $ABCD$, respectively and let $G$ be the intersection of $DE$ with $CF$. Find the aspect ratio of sidelengths of the triangle $EGC$, $| EG | : | GC | : | CE |$.
Let be $f: (0,+\infty)\rightarrow \mathbb{R}$ monoton-decreasing . If $f(2a^2+a+1)<f(3a^2-4a+1)$ find interval of $a$ .
Let $S$ be a set of $n$ points in the plane such that for any two points $(a, b), (c, d) \in S$, we have that $| a - c | \cdot | b - d | \ge 1$. Show that [list] [*] (a) If $S = \{ Q_1, Q_2, Q_3\}$ such that for any point $Q_i$ in $S$, this point doesn't lie in the axis-aligned rectangle with corners as the other two points, show that the area of $\triangle Q_1Q_2Q_3$ is at least $\frac{\sqrt{5}}{2}$. [*] (b) If all points in $S$ lie in an axis-aligned square with sidelength $a$, then $|S| \le \frac{a^2}{\sqrt{5}} + 2a + 1$. [/list]
[u]Round 1[/u] [b]p1.[/b] Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale. [b]p2.[/b] Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed $10$ of the rounds, each rat eating an equal portion. Some were satisfied, but $7$ greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry? [b]p3.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [b]p4.[/b] There are two lemonade stands along the $4$-mile-long circular road that surrounds Sour Lake. $100$ children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's [u]advantage [/u] is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)? [b]p5.[/b] Merlin uses several spells to move around his $64$-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room $A$ back to room $A$, then from any other room $B$ in the castle, that same sequence brings Merlin back to room $B$. Prove that there are two different rooms $X$ and $Y$ and a sequence of spells that both takes Merlin from $X$ to $Y$ and from $Y$ to $X$. [u]Round 2[/u] [b]p6.[/b] Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the $X$ in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? [img]https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png[/img] [b]p7.[/b] Homer went on a Donut Diet for the month of May ($31$ days). He ate at least one donut every day of the month. However, over any stretch of $7$ consecutive days, he did not eat more than $13$ donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly $30$ donuts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Evaluate $\displaystyle\lim_{x\to 1}x^{\dfrac{x}{\sin(1-x)}}$.
Prove that: the polynomial$$(x(x+1))^{2^{2023}}+1$$is irreducible in $\mathbb{Q}[x].$
There are $2024$ cities in a country, every two of which are bidirectionally connected by exactly one of three modes of transportation - rail, air, or road. A tourist has arrived in this country and has the entire transportation scheme. He chooses a travel ticket for one of the modes of transportation and the city from which he starts his trip. He wants to visit as many cities as possible, but using only the ticket for the specified type of transportation. What is the largest $k$ for which the tourist will always be able to visit at least $k$ cities? During the route, he can return to the cities he has already visited. [i]Proposed by Bogdan Rublov[/i]
* Prove that a number of the form $2^n$ for a positive integer $n$ may begin with any given combination of digits.
Let $A$ and $B$ be matrices of size $3\times 2$ and $2\times 3$ respectively. Suppose that $$AB =\begin{pmatrix} 8 & 2 & -2\\ 2 & 5 &4 \\ -2 &4 &5 \end{pmatrix}.$$ Show that the product $BA$ is equal to $\begin{pmatrix} 9 &0\\ 0 &9 \end{pmatrix}.$
Quadratic trinomials with positive leading coefficients are arranged in the squares of a $6 \times 6$ table. Their $108$ coefficients are all integers from $-60$ to $47$ (each number is used once). Prove that at least in one column the sum of all trinomials has a real root. [i]K. Kokhas & F. Petrov[/i]
Let $p$ be a prime such that $p\mid 2a^2-1$ for some integer $a$. Show that there exist integers $b,c$ such that $p=2b^2-c^2$.
Find all natural numbers $ n > 1$ such that $ n^{2}$ does $ \text{not}$ divide $ (n \minus{} 2)!$.