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 $P$ be a point in the plane of $\triangle ABC$, and $\gamma$ a line passing through $P$. Let $A', B', C'$ be the points where the reflections of lines $PA, PB, PC$ with respect to $\gamma$ intersect lines $BC, AC, AB$ respectively. Prove that $A', B', C'$ are collinear.
Given $\triangle ABC$ with $\angle A = 15^{\circ}$, let $M$ be midpoint of $BC$ and let $E$ and $F$ be points on ray $BA$ and $CA$ respectively such that $BE = BM = CF$. Let $R_1$ be the radius of $(MEF)$ and $R_{2}$ be radius of $(AEF)$. If $\frac{R_1^2}{R_2^2}=a-\sqrt{b+\sqrt{c}}$ where $a,b,c$ are integers. Find $a^{b^{c}}$
In an acute-angled triangle $ABC$, the point $H{}$ is the orthocenter, $M{}$ is the midpoint of the side $BC$ and $\omega$ is the circumcircle. The lines $AH, BH$ and $CH{}$ intersect $\omega$ a second time at points $D, E$ and $F{}$ respectively. The ray $MH$ intersects $\omega$ at point $J{}$. The points $K{}$ and $L{}$ are the centers of the inscribed circles of the triangles $DEJ$ and $DFJ$ respectively. Prove that $KL\parallel BC$.
Find all functions $f$ from the real numbers to the real numbers such that $f(xy) \le \frac12 \left(f(x) + f(y) \right)$ for all real numbers $x$ and $y$.
Five runners, $P$, $Q$, $R$, $S$, $T$, have a race, and $P$ beats $Q$, $P$ beats $R$, $Q$ beats $S$, and $T$ finishes after $P$ and before $Q$. Who could NOT have finished third in the race? $\text{(A)}\ P\text{ and }Q \qquad \text{(B)}\ P\text{ and }R \qquad \text{(C)}\ P\text{ and }S \qquad \text{(D)}\ P\text{ and }T \qquad \text{(E)}\ P,S\text{ and }T$
Urn A contains 4 white balls and 2 red balls. Urn B contains 3 red balls and 3 black balls. An urn is randomly selected, and then a ball inside of that urn is removed. We then repeat the process of selecting an urn and drawing out a ball, without returning the first ball. What is the probability that the first ball drawn was red, given that the second ball drawn was black?
Let $S=\{1,2,3,\ldots,2012\}.$ We want to partition $S$ into two disjoint sets such that both sets do not contain two different numbers whose sum is a power of $2.$ Find the number of such partitions.
Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7$. Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice? $\textbf{(A) } \frac{7}{36} \qquad\textbf{(B) } \frac{5}{24} \qquad\textbf{(C) } \frac{2}{9} \qquad\textbf{(D) } \frac{17}{72} \qquad\textbf{(E) } \frac{1}{4}$
Ashwin the frog is traveling on the $xy$-plane in a series of $2^{2017} -1$ steps, starting at the origin. At the $n^{th}$ step, if $n$ is odd, then Ashwin jumps one unit to the right. If $n$ is even, then Ashwin jumps $m$ units up, where $m$ is the greatest integer such that $2^m$ divides $n$. If Ashwin begins at the origin, what is the area of the polygon bounded by Ashwin’s path, the line $x = 2^{2016}$, and the $x$-axis?
Let $R$ ba a finite ring with the following property: for any $a,b\in R$ there exists an element $c\in R$ (depending on $a$ and $b$) such that $a^2+b^2=c^2$. Prove that for any $a,b,c\in R$ there exists $d\in R$ such that $2abc=d^2$. (Here $2abc$ denotes $abc+abc$. The ring $R$ is assumed to be associative, but not necessarily commutative and not necessarily containing a unit.
Find the sum of all positive integers $n$ such that $n+2$ divides the product $3(n+3)(n^2+9)$.
What is the smallest positive integer $n$ such that there exists a choice of signs for which \[1^2\pm2^2\pm3^2\ldots\pm n^2=0\] is true? [i]2019 CCA Math Bonanza Team Round #5[/i]
Let $a, b, c, d$ be positive real numbers. It is given that at least one of the following two conditions holds: $$ab >\min(\frac{c}{d}, \frac{d}{c}), cd >\min(\frac{a}{b}, \frac{b}{a}).$$ Show that at least one of the following two conditions holds: $$bd>\min(\frac{c}{a}, \frac{a}{c}), ca >\min(\frac{d}{b}, \frac{b}{d}).$$
A set of $n$ dominoes, each colored with one white square and one black square, is used to cover a $2 \times n$ board of squares. For $n = 6$, how many different patterns of colors can the board have? (For $n = 2$, this number is $6$.)
It is known about two triangles that for each of them the sum of the lengths of any two of its sides is equal to the sum of the lengths of any two sides of the other triangle. Are triangles necessarily congruent?
Let $n\ge 3$ be an integer. Let $s(n)$ be the number of (ordered) pairs $(a;b)$ consisting of positive integers $a,b$ from the set $\{1,2,\dots ,n\}$ which satisfy $\gcd (a,b,n)=1$. Prove that $s(n)$ is divisible by $4$ for all $n\ge 3$. [i] (Vlad Robu) [/i]
Show that the equation $x^2-7y^2 = 1$ has infinitely many solutions in natural numbers.
$110$ teams participate in a volleyball tournament. Every team has played every other team exactly once (there are no ties in volleyball). Turns out that in any set of $55$ teams, there is one which has lost to no more than $4$ of the remaining $54$ teams. Prove that in the entire tournament, there is a team that has lost to no more than $4$ of the remaining $109$ teams.
Let $\omega$ be the circumcircle of $\Delta ABC$, where $|AB|=|AC|$. Let $D$ be any point on the minor arc $AC$. Let $E$ be the reflection of point $B$ in line $AD$. Let $F$ be the intersection of $\omega$ and line $BE$ and Let $K$ be the intersection of line $AC$ and the tangent at $F$. If line $AB$ intersects line $FD$ at $L$, Show that $K,L,E$ are collinear points
Does there exist $2017$ consecutive positive integers, none of which could be written as $a^2 + b^2$ for some integers $a, b$? Justify your answer.
For some complex number $\omega$ with $|\omega| = 2016$, there is some real $\lambda>1$ such that $\omega, \omega^{2},$ and $\lambda \omega$ form an equilateral triangle in the complex plane. Then, $\lambda$ can be written in the form $\tfrac{a + \sqrt{b}}{c}$, where $a,b,$ and $c$ are positive integers and $b$ is squarefree. Compute $\sqrt{a+b+c}$.
Define $f(n)$ to be the sum of positive integers $k$ less than or equal to $n$ such that $\gcd(n, k)$ is prime. Find $f(2024)$.
Let $n$ be an integer and $n \geq 2$, $x_1, x_2, \cdots , x_n$ are arbitrary real number, find the maximum value of $$2\sum_{1\leq i<j \leq n}\left \lfloor x_ix_j \right \rfloor-\left ( n-1 \right )\sum_{i=1}^{n}\left \lfloor x_i^2 \right \rfloor $$
Let AD be the altitude of a triangle ABC and E , F be the incenters of the triangle ABD and ACD , respectively. line EF meets AB and AC at K and L. prove tht AK=AL if and only if AB=AC or A=90
Let [n] be the set {1, 2,. . . , n}. For any $a, b \in N$, denote $G (a, b)$ by a graph (not directed) defined by the following rule: the vertices have the form (i, f), where $i \in [a]$, and $f: [a] \to [b]$. A vertex (i, f) and a vertex (j, g) are connected if $i \neq j$, and $f (k) \neq g (k)$ holds exactly for k strictly between i and j. Prove that for any $c \in N$ there is $a, b \in N$ such that the vertices of G (a, b) cannot be well-colored with $c$ colors.