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

Real numbers $a,b,c,d$ such that $|a|>1$ , $|b|>1$ , $|c|>1$ , $|d|>1$ and $ab(c+d)+dc(a+b)+a+b+c+d=0$ then prove that $\frac{1}{a-1}+\frac{1}{b-1}+\frac{1}{c-1}+\frac{1}{d-1} >0$
Let $N$ be the number of ordered triples of 3 positive integers $(a,b,c)$ such that $6a$, $10b$, and $15c$ are all perfect squares and $abc = 210^{210}$. Find the number of divisors of $N$. [i]Proposed by Andy Xu[/i]
Seven distinct points are marked on a circle of circumference $c$. Three of the points form an equilateral triangle and the other four form a square. Prove that at least one of the seven arcs into which the seven points divide the circle has length less than or equal $\frac{c}{24}$.
Prove that there exist infinitely many pairs $\left(x;\;y\right)$ of different positive rational numbers, such that the numbers $\sqrt{x^2+y^3}$ and $\sqrt{x^3+y^2}$ are both rational.
Jane and Jena sit at non-adjacent chairs of a four-chair circular table. In a turn, one person can move to an adjacent chair without a person. Jane moves in the first turn, and alternates with Jena afterwards. In how many ways can Jena be adjacent to Jane after nine moves? $\textbf{(A) }16\qquad\textbf{(B) }18\qquad\textbf{(C) }32\qquad\textbf{(D) }162\qquad\textbf{(E) }512$
The point $M$ is the middle of the side $BC$ of the acute-angled triangle $ABC$ and the points $E$ and $F$ are respectively perpendicular foot of $M$ to the sides $AC$ and $AB$. The points $X$ and $Y$ lie on the plane such that $\triangle XEC\sim\triangle CEY$ and $\triangle BYF\sim\triangle XBF$(The vertices of triangles with this order are corresponded in the similarities) and the points $E$ and $F$ [u]don't[/u][neither] lie on the line $XY$. Prove that $XY\perp AM$.
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
Let $ABCD$ be an isosceles trapezoid, with a large base $CD$ and a small base $AB$. Let $M$ be any point on side $AB$ and $(d)$ be the line through $M$ and perpendicular to $AB$. Two rays $Mx$ and $My$ are said to satisfy the condition $(T)$ if they are symmetric about each other through $(d)$ and intersect the two rays $AD$ and $BC$ at $E$ and $F$ respectively. Find the locus of the midpoint of the segment $EF$ when the two rays $Mx$ and $My$ change and satisfy condition $(T)$.
Find all pairs $(p, q)$ of prime numbers such that $$p(p^2 -p - 1) = q(2q + 3).$$
Let be a natural number $ n, $ a nonzero number $ \alpha, \quad n $ numbers $ a_1,a_2,\ldots ,a_n $ and $ n+1 $ functions $ f_0,f_1,f_2,\ldots ,f_n $ such that $ f_0=\alpha $ and the rest are defined recursively as $$ f_k (x)=a_k+\int_0^x f_{k-1} (x)dx . $$ Prove that if all these functions are everywhere nonnegative, then the sum of all these functions is everywhere nonnegative.
100 people from 50 countries, two from each countries, stay on a circle. Prove that one may partition them onto 2 groups in such way that neither no two countrymen, nor three consecutive people on a circle, are in the same group.
How many perfect squares are greater than $0$ but less than or equal to $100$? $\textbf{(A) }6\qquad\textbf{(B) }7\qquad\textbf{(C) }8\qquad\textbf{(D) }9\qquad\textbf{(E) }10$
Find all non-zero real numbers $ x, y, z$ which satisfy the system of equations: \[ (x^2 \plus{} xy \plus{} y^2)(y^2 \plus{} yz \plus{} z^2)(z^2 \plus{} zx \plus{} x^2) \equal{} xyz\] \[ (x^4 \plus{} x^2y^2 \plus{} y^4)(y^4 \plus{} y^2z^2 \plus{} z^4)(z^4 \plus{} z^2x^2 \plus{} x^4) \equal{} x^3y^3z^3\]
Determine for which values of $n$ it is possible to tile a square of side $n$ with figures of the type shown in the picture [asy] unitsize(0.4 cm); draw((0,0)--(5,0)); draw((0,1)--(5,1)); draw((1,2)--(4,2)); draw((2,3)--(3,3)); draw((0,0)--(0,1)); draw((1,0)--(1,2)); draw((2,0)--(2,3)); draw((3,0)--(3,3)); draw((4,0)--(4,2)); draw((5,0)--(5,1)); [/asy]
Let $ABC$ be a non-isosceles,aqute triangle with $AB<AC$ inscribed in circle $c(O,R)$.The circle $c_{1}(B,AB)$ crosses $AC$ at $K$ and $c$ at $E$. $KE$ crosses $c$ at $F$ and $BO$ crosses $KE$ at $L$ and $AC$ at $M$ while $AE$ crosses $BF$ at $D$.Prove that: i)$D,L,M,F$ are concyclic. ii)$B,D,K,M,E$ are concyclic.
Some of the towns in a country are connected with bidirectional paths, where each town can be reached by any other by going through these paths. From each town there are at least $n \geq 3$ paths. In the country there is no such route that includes all towns exactly once. Find the least possible number of towns in this country (Answer depends from $n$).
Given a fixed acute angle $\theta$ and a pair of internally tangent circles, let the line $l$ which passes through the point of tangency, $A$, cut the larger circle again at $B$ ($l$ does not pass through the centers of the circles). Let $M$ be a point on the major arc $AB$ of the larger circle, $N$ the point where $AM$ intersects the smaller circle, and $P$ the point on ray $MB$ such that $\angle MPN = \theta$. Find the locus of $P$ as $M$ moves on major arc $AB$ of the larger circle.
We call a triangle consisting of three vertices of a pentagon [i]big[/i] if it's area is larger than half of the pentagon's area. Find the maximum number of [i]big[/i] triangles that can be in a convex pentagon. [i]Proposed by Gonchigdorj Sandag[/i]
If $ a,b,c $ represent the lengths of the sides of a triangle, prove the inequality: $$ 3\le\sum_{\text{cyc}}\sqrt{\frac{a}{-a+b+c}} . $$
Let $n_1, n_2$ be positive integers. Consider in a plane $E$ two disjoint sets of points $M_1$ and $M_2$ consisting of $2n_1$ and $2n_2$ points, respectively, and such that no three points of the union $M_1 \cup M_2$ are collinear. Prove that there exists a straightline $g$ with the following property: Each of the two half-planes determined by $g$ on $E$ ($g$ not being included in either) contains exactly half of the points of $M_1$ and exactly half of the points of $M_2.$
A dissection of a convex polygon into finitely many triangles by segments is called a [i]trilateration[/i] if no three vertices of the created triangles lie on a single line (vertices of some triangles might lie inside the polygon). We say that a trilateration is [i]good[/i] if its segments can be replaced with one-way arrows in such a way that the arrows along every triangle of the trilateration form a cycle and the arrows along the whole convex polygon also form a cycle. Find all $n\ge 3$ such that the regular $n$-gon has a good trilateration.
Let $ABC$ be a triangle with circumcentre $O$ and centroid $G$. Let $M$ be the midpoint of $BC$ and $N$ the reflection of $M$ across $O$. Prove that $NO = NA$ if and only if $\angle AOG = 90^{\circ}$. [i]Proposed by Pranjal Srivastava[/i]
Cat and Claire are having a conversation about Cat’s favorite number. Cat says, “My favorite number is a two-digit multiple of $7$.” Claire asks, “If you just told me the tens digit of the number, would I know your number?” Cat says, “No. However, without knowing that, if I told you the tens digit of $100$ minus my number, you could determine my favorite number.” Claire says, “Now I know your favorite number!" What is Cat’s favorite number?
Initially given $31$ tuplets $$(1,0,0,\dots,0),(0,1,0,\dots,0),\dots, (0,0,0,\dots,1)$$ were written on the blackboard. At every move we choose two written $31$ tuplets as $(a_1,a_2,a_3,\dots, a_{31})$ and $(b_1,b_2,b_3,\dots,b_{31})$, then write the $31$ tuplet $(a_1+b_1,a_2+b_2,a_3+b_3,\dots, a_{31}+b_{31})$ to the blackboard too. Find the least possible value of the moves such that one can write the $31$ tuplets $$(0,1,1,\dots,1),(1,0,1,\dots,1),\dots, (1,1,1,\dots,0)$$ to the blackboard by using those moves.
At a gathering of $30$ people, there are $20$ people who all know each other and $10$ people who know no one. People who know each other hug, and people who do not know each other shake hands. How many handshakes occur? $\textbf{(A)}\ 240\qquad\textbf{(B)}\ 245\qquad\textbf{(C)}\ 290\qquad\textbf{(D)}\ 480\qquad\textbf{(E)}\ 490$