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

Consider the rectangle in the coordinate plane with corners $(0, 0)$, $(16, 0)$, $(16, 4)$, and $(0, 4)$. For a constant $x_0 \in [0, 16]$, the curves \[ \{(x, y) : y = \sqrt{x} \,\text{ and }\, 0 \leq x \leq 16\} \quad \text{and} \quad \{(x_0, y) : 0 \leq y \leq 4\} \] partition this rectangle into four 2D regions. Over all choices of $x_0$, determine the smallest possible sum of the areas of the bottom-left and top-right 2D regions in this partition. (The bottom-left region is $\{(x, y) : 0 \leq x < x_0 \,\text{ and }\, 0 \leq y < \sqrt{x}\}$, and the top-right region is $\{(x, y) : x_0 < x \leq 16 \,\text{ and }\, \sqrt{x} < y \leq 4\}$.)
Find the sum of all the prime numbers less than $100$ which are one more than a multiple of six.
Find the determinant of this matrix: $\begin{bmatrix} 2 & 2 & 2 & 2 & 2 & 2 \\ 4 & 2 & 2 & 2 & 2 & 2 \\ 4 & 4 & 2 & 2 & 2 & 2 \\ 4 & 4 & 4 & 2 & 2 & 2 \\ 4 & 4 & 4 & 4 & 2 & 2 \\ 4 & 4 & 4& 4 & 4 & 2 \end{bmatrix} $
$m,n$ are positive intergers and $x,y,z$ positive real numbers such that $0 \leq x,y,z \leq 1$. Let $m+n=p$. Prove that: $0 \leq x^p+y^p+z^p-x^m*y^n-y^m*z^n-z^m*x^n \leq 1$
The graph of $r=2+\cos2\theta$ and its reflection over the line $y=x$ bound five regions in the plane. Find the area of the region containing the origin.
Consider the pentagon below. Find its area. [img]https://cdn.artofproblemsolving.com/attachments/7/b/02ad3852b72682513cf62a170ed4aa45c23785.png[/img]
i) Simplify $\left(a-\frac{4ab}{a+b}+b\right): \left(\frac{a}{a+b}-\frac{b}{b-a}-\frac{2ab}{a^2-b^2}\right)$ ii) Simplify $\frac{2x^2-(3a+b)x+a^2+ab}{2x^2-(a+3b)x+ab+b^2}$
Let $ABCD$ be a quadrilateral in which every angle is smaller than $180^o$. If the bisectors of angles $\angle DAB$ and $\angle DCB$ are parallel, prove that $\angle ADC = \angle ABC$
Find all polynomials $f(x)$ such that $f(2x) = f'(x) f''(x)$.
For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.
Let $a, b, c$ be nonzero integers, with $1$ as their only positive common divisor, such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 0$. Find the number of such triples $(a, b, c)$ with $50 \ge |a| \ge |b| \ge |c| 1$.
Paul and Sara are playing a game with integers on a whiteboard, with Paul going first. When it is Paul’s turn, he can pick any two integers on the board and replace them with their product; when it is Sara’s turn, she can pick any two integers on the board and replace them with their sum. Play continues until exactly one integer remains on the board. Paul wins if that integer is odd, and Sara wins if it is even. Initially, there are $2021$ integers on the board, each one sampled uniformly at random from the set $\{0, 1, 2, 3, . . . , 2021\}$. Assuming both players play optimally, the probability that Paul wins is $m/n$ , where $m, n$ are positive integers and $gcd(m, n) = 1$. Find the remainder when $m + n$ is divided by $1000$.
Let $A_{1}, ..., A_{n}$ be different subsets of an $n$-element set $X$. Show that there exists $x\in X$ such that the sets $A_{1}-\{x\}, A_{2}-\{x\}, ..., A_{n}-\{x\}$ are all different.
Let a triangle $ABC$ be given. Consider the circle touching its circumcircle at $A$ and touching externally its incircle at some point $A_1$. Points $B_1$ and $C_1$ are defined similarly. a) Prove that lines $AA_1, BB_1$ and $CC1$ concur. b) Let $A_2$ be the touching point of the incircle with $BC$. Prove that lines $AA_1$ and $AA_2$ are symmetric about the bisector of angle $\angle A$.
For positive numbers $ a_1,a_2,\dots,a_n$, we define \[ A\equal{}\frac{a_1\plus{}a_2\plus{}\cdots\plus{}a_n}{n}, \quad G\equal{}\sqrt[n]{a_1\cdots a_n}, \quad H\equal{}\frac{n}{a_1^{\minus{}1}\plus{}\cdots\plus{}a_n^{\minus{}1}}\] Prove that (i) $ \frac{A}{H}\leq \minus{}1\plus{}2\left(\frac{A}{G}\right)^n$, for n even (ii) $ \frac{A}{H}\leq \minus{}\frac{n\minus{}2}{n}\plus{}\frac{2(n\minus{}1)}{n}\left(\frac{A}{G}\right)^n$, for $ n$ odd
Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that \[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]
let $x,y$ be non-zero reals such that : $x^3+y^3+3x^2y^2=x^3y^3$ find all values of $\frac{1}{x}+\frac{1}{y}$
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$. [i]Proposed by Holden Mui[/i]
Let $PA, PB$ be tangents to a circle centered at $O$, and $C$ a point on the minor arc $AB$. The perpendicular from $C$ to $PC$ intersects internal angle bisectors of $AOC,BOC$ at $D,E$. Show that $CD=CE$
Each point of a circle is colored either red or blue. [b](a)[/b] Prove that there always exists an isosceles triangle inscribed in this circle such that all its vertices are colored the same. [b](b)[/b] Does there always exist an equilateral triangle inscribed in this circle such that all its vertices are colored the same?
Let $ABCD$ be a cyclic quadrilateral inscribed in a circle $\Gamma.$ Let $E,F,G,H$ be the midpoints of arcs $AB,BC,CD,AD$ of $\Gamma,$ respectively. Suppose that $AC\cdot BD=EG\cdot FH.$ Show that $AC,BD,EG,FH$ are all concurrent.
Given five real numbers $u_0, u_1, u_2, u_3, u_4$, prove that it is always possible to find five real numbers $v0, v_1, v_2, v_3, v_4$ that satisfy the following conditions: $(i)$ $u_i-v_i \in \mathbb N, \quad 0 \leq i \leq 4$ $(ii)$ $\sum_{0 \leq i<j \leq 4} (v_i - v_j)^2 < 4.$ [i]Proposed by Netherlands.[/i]
Is it possible to write a natural number in every cell of an infinite chessboard in such a manner that for all integers $m, n > 100$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n \ ?$
Let $AA_1, BB_1$ and $CC_1$ be the altitudes of an acute-angled triangle $ABC.$ $AA_1$ meets $B_1C_1$ in a point $K.$ The circumcircles of triangles $A_1KC_1$ and $A_1KB_1$ intersect the lines $AB$ and $AC$ for the second time at points $N$ and $L$ respectively. Prove that [b]a)[/b] The sum of diameters of these two circles is equal to $BC,$ [b] b)[/b] $\frac{A_1N}{BB_1} + \frac{A_1L}{CC_1}=1.$
Given that $\log_{10}(4) = 0.6021$ to the nearest ten-thousandth, find $\log_{10}(5)$ to the nearest thousandth. [i]Lightning 3.3[/i]