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

For how many nonempty subsets $S \subseteq \{1, 2, \ldots , 10\}$ is the sum of all elements in $S$ even? [i]Proposed by Andrew Wen[/i]
Given a rectangle, circumscribe a rectangle of maximum area.
Find the largest positive integer $n$ such that the number $(2n)!$ ends with $10$ more zeroes than the number $n!$. [i]Proposed by Andy Xu[/i]
Find all pairs of nonnegative integers $ (x, y)$ satisfying $ (14y)^x \plus{} y^{x\plus{}y} \equal{} 2007$.
Let $\omega_1$ and $\omega_2$ be two circles that intersect at points $A$ and $B$. Let line $l$ be tangent to $\omega_1$ at $P$ and to $\omega_2$ at $Q$ such that $A$ is closer to $PQ$ than $B$. Let points $R$ and $S$ lie along rays $PA$ and $QA$, respectively, so that $PQ = AR = AS$ and $R$ and $S$ are on opposite sides of $A$ as $P$ and $Q$. Let $O$ be the circumcenter of triangle $ASR$, and $C$ and $D$ be the midpoints of major arcs $AP$ and $AQ$, respectively. If $\angle APQ$ is $45$ degrees and $\angle AQP$ is $30$ degrees, determine $\angle COD$ in degrees.
We call a coloring $f$ of the elements in the set $M = \{(x, y) | x = 0, 1, \dots , kn - 1; y = 0, 1, \dots , ln - 1\}$ with $n$ colors allowable if every color appears exactly $k$ and $ l$ times in each row and column and there are no rectangles with sides parallel to the coordinate axes such that all the vertices in $M$ have the same color. Prove that every allowable coloring $f$ satisfies $kl \leq n(n + 1).$
The altitudes $BB_1$ and $CC_1$ of an acute triangle $ABC$ intersect in point $H$. Let $B_2$ and $C_2$ be points on the segments $BH$ and $CH$, respectively, such that $BB_2=B_1H$ and $CC_2=C_1H$. The circumcircle of the triangle $B_2HC_2$ intersects the circumcircle of the triangle $ABC$ in points $D$ and $E$. Prove that the triangle $DEH$ is right-angled.
For a positive integer $n$, numbers $2n+1$ and $3n+1$ are both perfect squares. Is it possible for $5n+3$ to be prime?
Let $f: \mathbb R \to \mathbb R$ and $g: \mathbb R \to \mathbb R$ be two functions satisfying \[\forall x,y \in \mathbb R: \begin{cases} f(x+y)=f(x)f(y),\\ f(x)= x g(x)+1\end{cases} \quad \text{and} \quad \lim_{x \to 0} g(x)=1.\] Find the derivative of $f$ in an arbitrary point $x.$
Nico picks $13$ pairwise distinct $3-$digit positive integers. Ian then selects several of these 13 numbers, the ones he wants, and using only once each selected number and some of the operations addition, subtraction, multiplication and division ($+,-,\times ,:$) must get an expression whose value is greater than $3$ and less than $4$. If he succeeds, Ian wins; otherwise, Nico wins. Which of the two has a winning strategy?
A circle with radius $r$ touches the sides $AB,BC,CD,DA$ of a convex quadrilateral $ABCD$ at $E,F,G,H$, respectively. The inradii of the triangles $EBF,FCG,GDH,HAE$ are equal to $r_1,r_2,r_3,r_4$. Prove that $$r_1+r_2+r_3+r_4\ge2\left(2-\sqrt2\right)r.$$
Find all positive integers $k$ such that $k^k +1$ is divisible by $30$. Justify your answer.
Let $a_1,a_2,\cdots,a_n>0$ $(n\geq 2)$. Prove that$$\sum_{i=1}^n max\{a_1,a_2,\cdots,a_i \} \cdot min \{a_i,a_{i+1},\cdots,a_n\}\leq \frac{n}{2\sqrt{n-1}}\sum_{i=1}^n a^2_i$$
Let $p$ be a prime number. At a school of $p^{2020}$ students it is required that each club consist of exactly $p$ students. Is it possible for each pair of students to have exactly one club in common?
Two grade seven students were allowed to enter a chess tournament otherwise composed of grade eight students. Each contestant played once with each other contestant and received one point for a win, one half point for a tie and zero for a loss. The two grade seven students together gained a total of eight points and each grade eight student scored the same number of points as his classmates. How many students for grade eight participated in the chess tournament? Is the solution unique?
Suppose $\frac{1}{2} < s < 1$ . An insect flying on $[0,1]$ . If it is on point $a$ , it jump into point $ a\times s$ or $(a-1) \times s +1$ . For every real number $0 \le c \le 1$, Prove that insect can jump that after some jumps , it has a distance less than $\frac {1}{1402}$ from point $c$. [i]Proposed by Navid Safaei [/i]
Let $n\ge 2$ be a positive integer. Let $x_1, x_2, \dots, x_n$ be non-zero real numbers satisfying the equation \[\left(x_1+\frac{1}{x_2}\right)\left(x_2+\frac{1}{x_3}\right)\dots\left(x_n+\frac{1}{x_1}\right)=\left(x_1^2+\frac{1}{x_2^2}\right)\left(x_2^2+\frac{1}{x_3^2}\right)\dots\left(x_n^2+\frac{1}{x_1^2}\right).\] Find all possible values of $x_1, x_2, \dots, x_n$. [i]Proposed by Victor Domínguez[/i]
Given a real number $x$, define the series \[ S(x) = \sum_{n=1}^{\infty} \{n! \cdot x\}, \] where $\{s\} = s - \lfloor s \rfloor$ is the fractional part of the number $s$. Determine if there exists an irrational number $x$ for which the series $S(x)$ converges.
Prove that among any $2n+1$ irrational numbers there are $n+1$ numbers such that the sum of any $k$ of them is irrational, for all $k \in \{1,2,3,\ldots, n+1 \}$.
A biased coin has a $ \dfrac{6 + 2\sqrt{3}}{12} $ chance of landing heads, and a $ \dfrac{6 - 2\sqrt{3}}{12} $ chance of landing tails. What is the probability that the number of times the coin lands heads after being flipped 100 times is a multiple of 4? The answer can be expressed as $ \dfrac{1}{4} + \dfrac{1 + a^b}{c \cdot d^e} $ where $ a, b, c, d, e $ are positive integers. Find the minimal possible value of $ a + b + c + d + e $.
Determine all integer solutions to the system of equations: \begin{align*} xy + yz + zx &= -4 \\ x^2 + y^2 + z^2 &= 24 \\ x^{3} + y^3 + z^3 + 3xyz &= 16 \end{align*}
Let $n \geq 3$ be an integer. Let $f$ be a function from the set of all integers to itself with the following property: If the integers $a_1,a_2,\ldots,a_n$ form an arithmetic progression, then the numbers $$f(a_1),f(a_2),\ldots,f(a_n)$$ form an arithmetic progression (possibly constant) in some order. Find all values for $n$ such that the only functions $f$ with this property are the functions of the form $f(x)=cx+d$, where $c$ and $d$ are integers.
Circle $C_1$ has its center $O$ lying on circle $C_2$. The two circles meet at $X$ and $Y$. Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$, $OZ=11$, and $YZ=7$. What is the radius of circle $C_1$? $ \textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30} $
Determine (with proof) whether there is a subset $X$ of the integers with the following property: for any integer $n$ there is exactly one solution of $a + 2b = n$ with $a,b \in X$.
Find all possible triples $(a, b, c)$ of positive integers with the following properties: • $gcd(a, b) = gcd(a, c) = gcd(b, c) = 1$, • $a$ is a divisor of $a + b + c$, • $b$ is a divisor of $a + b + c$, • $c$ is a divisor of $a + b + c$. (Here $gcd(x,y)$ is the greatest common divisor of $x$ and $y$.)