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$, and $p$, where $p$ is a prime number, such that $73p^2 + 6 = 9a^2 + 17b^2 + 17c^2$.
Given a prime $p$, find $\gcd(\binom{2^pp}{1},\binom{2^pp}{3},\ldots, \binom{2^pp}{2^pp-1}) $.
Find $$\sum_{a=1}^{9} \sum_{b=1}^{9} \sum_{c=1}^{9} \sum_{d=1}^{9} \min(2a + 0b + 2c + 4d, 4a + 1b + 4c + 3d) + \max(10, a + b + 2c + 2d).$$ [i]Team #10[/i]
An arbitrary triangle $ABC$ is given and a point $P$ lies on the side $AB$. It is requested to draw through $P$ a line that divides the triangle into two figures of the same area.
Find all natural $a,b$ such that $\left. {a(a + b) + 1} \right|(a + b)(b + 1) - 1$.
Let sequence $\{a_1,a_2,\dots \}$ with integer terms satisfy the following conditions: 1) $a_{n+1}=3a_n-3a_{n-1}+a_{n-2}, n=2,3,\dots$ ; 2) $2a_1=a_0+a_2-2$ ; 3) for arbitrary natural number $m$, there exist $m$ consecutive terms $a_k, a_{k-1}, \dots ,a_{k+m-1}$ among the sequence such that all such $m$ terms are perfect squares. Prove that all terms of the sequence $\{a_1,a_2,\dots \}$ are perfect squares.
(a) Show that, for each positive integer $n$, the number of monic polynomials of degree $n$ with integer coefficients having all its roots on the unit circle is finite. (b) Let $P(x)$ be a monic polynomial with integer coefficients having all its roots on the unit circle. Show that there exists a positive integer $m$ such that $y^m=1$ for each root $y$ of $P(x)$.
Let $n$ and $k$ be positive integers with $n\geq k\geq 2$. For $i=1,\dots,n$, let $S_i$ be a nonempty set of consecutive integers such that among any $k$ of them, there are two with nonempty intersection. Prove that there is a set $X$ of $k-1$ integers such that each $S_i$, $i=1,\dots,n$ contains at least one integer in $X$.
Points $A$, $B$, and $C$ lie on a semicircle with diameter $\overline{PQ}$ such that $AB = 3$, $AC = 4$, $BC = 5$, and $A$ is on $\overline{PQ}$. Given $\angle PAB = \angle QAC$, compute the area of the semicircle.
Among all orthogonal projections of a regular tetrahedron to all possible planes, find the projection of the greatest area.
For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$ into product of positive integers greater than $1$ (The order of factors are not countered, for example $f(12)=4$, as $12$ can be factored in these $4$ ways: $12,2\cdot 6,3\cdot 4, 2\cdot 2\cdot 3$. Prove: If $n$ is a positive integer greater than $1$, $p$ is a prime factor of $n$, then $f(n)\leq \frac{n}{p}$
Find all triples $(a, b, c)$ of integers that satisfy the equations $ a + b = c$ and $a^2 + b^3 = c^2$
[b]8.1 [/b] Construct a quadrilateral using side lengths and distances between the midpoints of the diagonals. [b]8.2[/b] It is known that $a,b$ and $\sqrt{a}+\sqrt{b} $ are rational numbers. Prove that then $\sqrt{a}$, $\sqrt{b} $ are rational. [b]8.3 / 9.2[/b] Solve equation $x^3 - [x]=3$ [b]8.4[/b] Prove that if in a triangle the angle bisector of the vertex, bisects the angle between the median and the altitude, then the triangle either isosceles or right. . [b]8.5[/b] Given $n$ numbers $x_1, x_2, . . . , x_n$, each of which is equal to $+1$ or $-1$. At the same time $$x_1x_2 + x_2x_3 + . . . + x_{n-1}x_n + x_nx_1 = 0 .$$ Prove that $n$ is divisible by $4$. [b]8.6[/b] There are $n$ points marked on the circle, and it is known that for of any two, one of the arcs connecting them has a measure less than $120^0$.Prove that all points lie on an arc of size $120^0$. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983442_1961_leningrad_math_olympiad]here[/url].
Let $ABC$ be a triangle. A point $D$ lies on line $BC$ and points $E,F$ are taken on $AC,AB$ such that $DE \parallel AB$ and $DF\parallel AC$. Let $G = (AEF) \cap (ABC) \neq A$ and $I = (DEF) \cap BC\neq D$. Let $H$ and $O$ denote the orthocenter and the circumcenter of triangle $DEF$. Prove that $A,O,I$ are collinear if and only if $G,H,I$ are collinear. [i]Proposed by Kaan Bilge[/i]
Given $k\ge 2$, for which polynomials $P\in \mathbb{Z}[X]$ does there exist a function $h:\mathbb{N}\rightarrow\mathbb{N}$ with $h^{(k)}(n)=P(n)$?
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ for which these two conditions hold simultaneously (i) For all $m,n \in \mathbb{N}$ we have: $$ \frac{f(mn)}{\gcd(m,n)} = \frac{f(m)f(n)}{f(\gcd(m,n))};$$ (ii) For all prime numbers $p$, there exists a prime number $q$ such that $f(p^{2025})=q^{2025}$.
In triangle $ABC$ we have $\angle ACB = 90^o$. The point $M$ is the midpoint of $AB$. The line through $M$ parallel to $BC$ intersects $AC$ in $D$. The midpoint of line segment $CD$ is $E$. The lines $BD$ and $CM$ are perpendicular. (a) Prove that triangles $CME$ and $ABD$ are similar. (b) Prove that $EM$ and $AB$ are perpendicular. [asy] unitsize(1 cm); pair A, B, C, D, E, M; A = (0,0); B = (4,0); C = (2.6,2); M = (A + B)/2; D = (A + C)/2; E = (C + D)/2; draw(A--B--C--cycle); draw(C--M--D--B); dot("$A$", A, SW); dot("$B$", B, SE); dot("$C$", C, N); dot("$D$", D, NW); dot("$E$", E, NW); dot("$M$", M, S); [/asy] [i]Be aware: the figure is not drawn to scale.[/i]
Let $N,K,L$ be points on $AB,BC,CA$ such that $CN$ bisector of angle $\angle ACB$ and $AL=BK$.Let $BL\cap AK=P$.If $I,J$ be incenters of triangles $\triangle BPK$ and $\triangle ALP$ and $IJ\cap CN=Q$ prove that $IQ=JP$
Prove that for any positive $ x_1,x_2,\ldots,x_n,y_1,y_2,\ldots,y_n$ the inequality \[ \sum_{i\equal{}1}^n\frac1{x_iy_i}\ge\frac{4n^2}{\sum_{i\equal{}1}^n(x_i\plus{}y_i)^2} \] holds.
Something related to this [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=845756#845756]problem[/url]: Prove that for a set $ S\subset\mathbb N$, there exists a sequence $ \{a_{i}\}_{i \equal{} 0}^{\infty}$ in $ S$ such that for each $ n$, $ \sum_{i \equal{} 0}^{n}a_{i}x^{i}$ is irreducible in $ \mathbb Z[x]$ if and only if $ |S|\geq2$. [i]By Omid Hatami[/i]
Consider all $100$-digit numbers divisible by $19$. Prove that the number of such numbers not containing the digits $4, 5$, and $6$ is the number of such numbers that do not contain the digits $1, 4$ and $7$.
Each positive integer should be colored red or green in such a way that the following two conditions are met: - Let $n$ be any red number. The sum of any $n$ (not necessarily different) red numbers is red. - Let $m$ be any green number. The sum of any $m$ (not necessarily different) green numbers is green. Determine all such colorings.
Let $ABC$ be an acute triangle such that $AB < AC$. Let $\omega$ be the circumcircle of $ABC$ and assume that the tangent to $\omega$ at $A$ intersects the line $BC$ at $D$. Let $\Omega$ be the circle with center $D$ and radius $AD$. Denote by $E$ the second intersection point of $\omega$ and $\Omega$. Let $M$ be the midpoint of $BC$. If the line $BE$ meets $\Omega$ again at $X$, and the line $CX$ meets $\Omega$ for the second time at $Y$, show that $A, Y$, and $M$ are collinear. [i]Proposed by Nikola Velov, North Macedonia[/i]
[b]p1.[/b] The sequence $\{x_n\}$ is defined by $$x_{n+1} = \begin{cases} 2x_n - 1, \,\, if \,\, \frac12 \le x_n < 1 \\ 2x_n, \,\, if \,\, 0 \le x_n < \frac12 \end{cases}$$ where $0 \le x_0 < 1$ and $x_7 = x_0$. Find the number of sequences satisfying these conditions. [b]p2.[/b] Let $M = \{1, . . . , 2022\}$. For any nonempty set $X \subseteq M$, let $a_X$ be the sum of the maximum and the minimum number of $X$. Find the average value of $a_X$ across all nonempty subsets $X$ of $M$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
The following four statements, and only these are found on a card: [asy] pair A,B,C,D,E,F,G; A=(0,1); B=(0,5); C=(11,5); D=(11,1); E=(0,4); F=(0,3); G=(0,2); draw(A--B--C--D--cycle); label("On this card exactly one statement is false.", B, SE); label("On this card exactly two statements are false.", E, SE); label("On this card exactly three statements are false.", F, SE); label("On this card exactly four statements are false.", G, SE); [/asy] (Assume each statement is either true or false.) Among them the number of false statements is exactly $\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$