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: 252

Let $A$ denote the set of real numbers $x$ such that $0\le x<1$. A function $f:A\to \mathbb{R}$ has the properties: (i) $f(x)=2f(\frac{x}{2})$ for all $x\in A$; (ii) $f(x)=1-f(x-\frac{1}{2})$ if $\frac{1}{2}\le x<1$. Prove that (a) $f(x)+f(1-x)\ge \frac{2}{3}$ if $x$ is rational and $0<x<1$. (b) There are infinitely many odd positive integers $q$ such that equality holds in (a) when $x=\frac{1}{q}$.
Find all triples $(x, y, z)$ of real numbers that satisfy $x^2 + y^2 + z^2 + 1 = xy + yz + zx +|x - 2y + z|$.
There is a table with $n > 2$ cells in the first row, $n-1$ cells in the second row is a cell, $n-2$ in the third row, $\ldots$, $1$ cell in the $n$-th row. The cells are arranged as shown below. [img]https://i.ibb.co/0Z1CR0c/UMO24-8-2.png[/img] In each cell of the top row Petryk writes a number from $1$ to $n$, so that each number is written exactly once. For each other cell, if the cells directly above it contains numbers $a, b$, it contains number $|a-b|$. What is the largest number that can be written in a single cell of the bottom row? [i]Proposed by Bogdan Rublov[/i]
3. Let n be a positive integer. The numbers 1, 2, 3,....., 2n are randomly assigned to 2n distinct points on a circle. To each chord joining two of these points, a value is assigned equal to the absolute value of the difference between the assigned numbers at its endpoints. Show that one can choose n pairwise non-intersecting chords such that the sum of the values assigned to them is $n^2$ .
Consider the set of all triangles $ OPQ$ where $ O$ is the origin and $ P$ and $ Q$ are distinct points in the plane with nonnegative integer coordinates $ (x,y)$ such that $ 41x\plus{}y \equal{} 2009$. Find the number of such distinct triangles whose area is a positive integer.
Find the maximal possible finite number of roots of the equation $|x-a_1|+\dots+|x-a_{50}|=|x-b_1|+\dots+|x-b_{50}|$, where $a_1,\,a_2,\,\dots,a_{50},\,b_1,\dots,\,b_{50}$ are distinct reals.
Determine the sum of absolute values for the complex roots of $ 20 x^8 \plus{} 7i x^7 \minus{}7ix \plus{} 20.$
Determine all real numbers $ a$ such that the inequality $ |x^2 \plus{} 2ax \plus{} 3a|\le2$ has exactly one solution in $ x$.
Find the smallest and largest values of the expression $$\frac{ \left| ...\left| |x-1|-1\right| ... -1\right| +1}{\left| |x-2|-1 \right|+1}$$ (The number of units in the numerator of a fraction, including the last one, is eleven, of which ten are under the absolute value sign.)
A real number with absolute value less than $1$ is written in each cell of an $n\times n$ array, so that the sum of the numbers in each $2\times 2$ square is zero. Show that for odd $n$ the sum of all the numbers is less than $n$.
The set of all real solutions of the inequality \[ |x \minus{} 1| \plus{} |x \plus{} 2| < 3\] is $ \textbf{(A)}\ x \in ( \minus{} 3,2) \qquad \textbf{(B)}\ x \in ( \minus{} 1,2) \qquad \textbf{(C)}\ x \in ( \minus{} 2,1) \qquad$ $ \textbf{(D)}\ x \in \left( \minus{} \frac32,\frac72\right) \qquad \textbf{(E)}\ \O \text{ (empty})$ Note: I updated the notation on this problem.
Given three numbers $x, y, z$ denote the absolute values of the differences of each pair by $x_1,y_1, z_1$. From $x_1, y_1, z_1$ form in the same fashion the numbers $x_2, y_2, z_2$, etc. It is known that $x_n = x,y_n = y, z_n = z$ for some $n$. Find $y$ and $z$ if $x = 1$.
In a matrix $2n \times 2n$, $n \in N$, are $4n^2$ real numbers with a sum equal zero. The absolute value of each of these numbers is not greater than $1$. Prove that the absolute value of a sum of all the numbers from one column or a row doesn't exceed $n$.
If $a, b, c$ are non-zero reals, prove that $|\frac{b} {a}-\frac{b} {c}|+|\frac{c} {a}-\frac{c}{b}|+|bc+1|>1$.
Determine the minimal and maximal values the expression $\frac{|a+b|+|b+c|+|c+a|}{|a|+|b|+|c|}$ can take, where $a,b,c$ are real numbers.
Prove that for natural number $n$ it's possible to find complex numbers $\omega_1,\omega_2,\cdots,\omega_n$ on the unit circle that $$\left\lvert\sum_{j=1}^{n}\omega_j\right\rvert=\left\lvert\sum_{j=1}^{n}\omega_j^2\right\rvert=n-1$$ iff $n=2$ occurs.
Let $f(x) = |x - p| + |x - 15| + |x - p - 15|$, where $0 < p < 15$. Determine the minimum value taken by $f(x)$ for $x$ in the interval $p \le x \le 15$.
With $400$ members voting the House of Representatives defeated a bill. A re-vote, with the same members voting, resulted in passage of the bill by twice the margin$\dagger$ by which it was originally defeated. The number voting for the bill on the re-vote was $\frac{12}{11}$ of the number voting against it originally. How many more members voted for the bill the second time than voted for it the first time? $\textbf{(A)}\ 75 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 50 \qquad\textbf{(D)}\ 45 \qquad\textbf{(E)}\ 20$ $\dagger$ In this context, margin of defeat (passage) is defined as the number of nays minus the number of ayes (nays-ayes).
Circles $ C_1,C_2$ intersect at $ P$. A line $ \Delta$ is drawn arbitrarily from $ P$ and intersects with $ C_1,C_2$ at $ B,C$. What is locus of $ A$ such that the median of $ AM$ of triangle $ ABC$ has fixed length $ k$.
How many ordered pairs of real numbers $(x,y)$ satisfy the following system of equations? \begin{align*}x+3y&=3\\ \big||x|-|y|\big|&=1\end{align*} $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 8 $
For each positive integer $n$, find the largest real number $C_n$ with the following property. Given any $n$ real-valued functions $f_1(x), f_2(x), \cdots, f_n(x)$ defined on the closed interval $0 \le x \le 1$, one can find numbers $x_1, x_2, \cdots x_n$, such that $0 \le x_i \le 1$ satisfying \[|f_1(x_1)+f_2(x_2)+\cdots f_n(x_n)-x_1x_2\cdots x_n| \ge C_n\] [i]Marko Radovanović, Serbia[/i]
Find all triplets $ (a,b,c) $ of nonzero complex numbers having the same absolute value and which verify the equality: $$ \frac{a}{b} +\frac{b}{c}+\frac{c}{a} =-1 $$
Let $f\in\mathbb{Z}[X]$ be an irreducible polynomial over the ring of integer polynomials, such that $|f(0)|$ is not a perfect square. Prove that if the leading coefficient of $f$ is 1 (the coefficient of the term having the highest degree in $f$) then $f(X^2)$ is also irreducible in the ring of integer polynomials. [i]Mihai Piticari[/i]
The absolute value of the difference of the solutions of the equation $x^2 + px + q = 0$, with $p, q \in R$, is equal to $4$. Find the solutions of the equation if it is known that $(q + 1) p^2 + q^2$ takes the minimum value.
Let be $a$ be positive real number. Prove that there are no real numbers $b$ and $c$, with $b < c$, so that for any distinct numbers $x, y \in (b, c)$ we have $|\frac{x+y} {x-y}| \leq a$.