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

Some regular polygons are inscribed in a circle. Fedir turned some of them, so all polygons have a common vertice. Prove that the number of vertices did not increase.
We call the sequence $d_1,....,d_n$ of natural numbers, not necessarily distinct, [b]covering[/b] if there exists arithmetic progressions like $c_1+kd_1$,....,$c_n+kd_n$ such that every natural number has come in at least one of them. We call this sequence [b]short[/b] if we can not delete any of the $d_1,....,d_n$ such that the resulting sequence be still covering. [b]a)[/b] Suppose that $d_1,....,d_n$ is a short covering sequence and suppose that we've covered all the natural numbers with arithmetic progressions $a_1+kd_1,.....,a_n+kd_n$, and suppose that $p$ is a prime number that $p$ divides $d_1,....,d_k$ but it does not divide $d_{k+1},....,d_n$. Prove that the remainders of $a_1,....,a_k$ modulo $p$ contains all the numbers $0,1,.....,p-1$. [b]b)[/b] Write anything you can about covering sequences and short covering sequences in the case that each of $d_1,....,d_n$ has only one prime divisor. [i]proposed by Ali Khezeli[/i]
Find all monic polynomials $P(x)=x^{2023}+a_{2022}x^{2022}+\ldots+a_1x+a_0$ with real coefficients such that $a_{2022}=0$, $P(1)=1$ and all roots of $P$ are real and less than $1$.
Prove that the equation $3y^2 = x^4 + x$ has no positive integer solutions.
Let $ A $ be a finite set of points in space having the property that for any of its points $ P, Q $ there is an isometry of space that transforms the set $ A $ into the set $ A $ and the point $ P $ into the point $ Q $. Prove that there is a sphere passing through all points of the set $ A $.
An arbitrary prime $ p$ is given. If an integer sequence $ (n_1 , n_2 , \cdots , n_k )$ satisfying the conditions - For all $ i\equal{} 1, 2, \cdots , k$, $ n_i \geq \frac{p\plus{}1}{2}$ - For all $ i\equal{} 1, 2, \cdots , k$, $ p^{n_i} \minus{} 1$ is divisible by $ n_{i\plus{}1}$, and $ \frac{p^{n_i} \minus{} 1}{n_{i\plus{}1}}$ is coprime to $ n_{i\plus{}1}$. Let $ n_{k\plus{}1} \equal{} n_1$. exists not for $ k\equal{}1$, but exists for some $ k \geq 2$, then call the prime a good prime. Prove that a prime is good iff it is not $ 2$.
$x_1,x_2$ are two real roots of the equation $x^2-(k-2)x+(k^2+3k+5)=0$.What's the maximum value of $x_1^2+x_2^2$? $\text{(A)}19\qquad\text{(B)}18\qquad\text{(C)}5\frac{5}{9}\qquad\text{(D)}$Not exist
Triangle $ABC$ has $AB = 8, AC = 12, BC = 10$. Let $D$ be the intersection of the angle bisector of angle $A$ with $BC$. Let $M$ be the midpoint of $BC$. The line parallel to $AC$ passing through $M$ intersects $AB$ at $N$. The line parallel to $AB$ passing through $D$ intersects $AC$ at $P$. $MN$ and $DP$ intersect at $E$. Find the area of $ANEP$.
Faces of a convex polyhedron are six squares and 8 equilateral triangles and each edge is a common side for one triangle and one square. All dihedral angles obtained from the triangle and square with a common edge, are equal. Prove that it is possible to circumscribe a sphere around the polyhedron, and compute the ratio of the squares of volumes of that polyhedron and of the ball whose boundary is the circumscribed sphere.
Let $P$ and $Q$ be on segment $BC$ of an acute triangle $ABC$ such that $\angle PAB=\angle BCA$ and $\angle CAQ=\angle ABC$. Let $M$ and $N$ be the points on $AP$ and $AQ$, respectively, such that $P$ is the midpoint of $AM$ and $Q$ is the midpoint of $AN$. Prove that the intersection of $BM$ and $CN$ is on the circumference of triangle $ABC$. [i]Proposed by Giorgi Arabidze, Georgia.[/i]
Let points $M$ and $N$ lie on sides $AB$ and $BC$ of triangle $ABC$ in such a way that $MN||AC$. Points $M'$ and $N'$ are the reflections of $M$ and $N$ about $BC$ and $AB$ respectively. Let $M'A$ meet $BC$ at $X$, and let $N'C$ meet $AB$ at $Y$. Prove that $A,C,X,Y$ are concyclic.
The positive sequence $\{a_n\}$ satisfies:$a_1=1+\sqrt 2$ and $(a_n-a_{n-1})(a_n+a_{n-1}-2\sqrt n)=2(n\geq 2).$ (1)Find the general formula of $\{a_n\}$; (2)Find the set of all the positive integers $n$ so that $\lfloor a_n\rfloor=2022$.
To every natural number $k, k \geq 2$, there corresponds a sequence $a_n(k)$ according to the following rule: \[a_0 = k, \qquad a_n = \tau(a_{n-1}) \quad \forall n \geq 1,\] in which $\tau(a)$ is the number of different divisors of $a$. Find all $k$ for which the sequence $a_n(k)$ does not contain the square of an integer.
Given is a positive integer $k$. There are $n$ points chosen on a line, such the distance between any two adjacent points is the same. The points are colored in $k$ colors. For each pair of monochromatic points such that there are no points of the same color between them, we record the distance between these two points. If all distances are distinct, find the largest possible $n$.
Convex quadrilateral $ABCD$ has $AB=20$, $BC=CD=26$, and $\angle{ABC}=90^\circ$. Point $P$ is on $DA$ such that $\angle{PBA}=\angle{ADB}$. If $PB=20$, compute the area of $ABCD$. [i]2019 CCA Math Bonanza Individual Round #13[/i]
Each square on a $ n \times n$ board, with $n \ge 3$, is colored with one of $ 8$ colors. For what values of $n$ it can be said that some of these figures included in the board, does it contain two squares of the same color. [img]https://cdn.artofproblemsolving.com/attachments/3/9/6af58460585772f39dd9e8ef1a2d9f37521317.png[/img]
Let $ABCD$ be a tetrahedron having each sum of opposite sides equal to $1$. Prove that \[r_A + r_B + r_C + r_D \leq \frac{\sqrt 3}{3}\] where $r_A, r_B, r_C, r_D$ are the inradii of the faces, equality holding only if $ABCD$ is regular.
A variable tetrahedron $ABCD$ has the following properties: Its edge lengths can change as well as its vertices, but the opposite edges remain equal $(BC = DA, CA = DB, AB = DC)$; and the vertices $A,B,C$ lie respectively on three fixed spheres with the same center $P$ and radii $3, 4, 12$. What is the maximal length of $PD$?
Let $a, b, c$ be positive reals with $a^{2014}+b^{2014}+c^{2014}+abc=4$. Prove that \[ \frac{a^{2013}+b^{2013}-c}{c^{2013}} + \frac{b^{2013}+c^{2013}-a}{a^{2013}} + \frac{c^{2013}+a^{2013}-b}{b^{2013}} \ge a^{2012}+b^{2012}+c^{2012}. \][i]Proposed by David Stoner[/i]
Find the integer numbers $a, b, c$ such that the function $f: R \to R$, $f(x) = ax^2 +bx + c$ satisfies the equalities : $$f(f(1) ))= f (f(2 ) )= f(f (3 ))$$
Determine the largest constant $K\geq 0$ such that $$\frac{a^a(b^2+c^2)}{(a^a-1)^2}+\frac{b^b(c^2+a^2)}{(b^b-1)^2}+\frac{c^c(a^2+b^2)}{(c^c-1)^2}\geq K\left (\frac{a+b+c}{abc-1}\right)^2$$ holds for all positive real numbers $a,b,c$ such that $ab+bc+ca=abc$. [i]Proposed by Orif Ibrogimov (Czech Technical University of Prague).[/i]
Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero. Can Amy prevent Bob’s win? [i]Maxim Didin, Russia[/i]
Let $ABC$ be a triangle with $\angle A = 90^o$, $AB = 1$, and $AC = 2$. Let $\ell$ be a line through $A$ perpendicular to $BC$, and let the perpendicular bisectors of $AB$ and $AC$ meet $\ell$ at $E$ and $F$, respectively. Find the length of segment $EF$.
$\textbf{(Maximal Determinant)}$ In a $17 \times 17$ matrix $M$, all entries are $\pm 1$. The maximum possible value of $\left| \det M \right|$ is $N$. Estimate $N$. An estimate of $E > 0$ earns $\left\lfloor 20\min(N/E, E/N)^2 \right\rfloor$ points.