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

2010 India National Olympiad, 3

Find all non-zero real numbers $ x, y, z$ which satisfy the system of equations: \[ (x^2 \plus{} xy \plus{} y^2)(y^2 \plus{} yz \plus{} z^2)(z^2 \plus{} zx \plus{} x^2) \equal{} xyz\] \[ (x^4 \plus{} x^2y^2 \plus{} y^4)(y^4 \plus{} y^2z^2 \plus{} z^4)(z^4 \plus{} z^2x^2 \plus{} x^4) \equal{} x^3y^3z^3\]

2005 IMAR Test, 3

A flea moves in the positive direction on the real Ox axis, starting from the origin. He can only jump over distances equal with $\sqrt 2$ or $\sqrt{2005}$. Prove that there exists $n_0$ such that the flea can reach any interval $[n,n+1]$ with $n\geq n_0$.

1991 Arnold's Trivium, 65

Find the mean value of the function $\ln r$ on the circle $(x - a)^2 + (y-b)^2 = R^2$ (of the function $1/r$ on the sphere).

IV Soros Olympiad 1997 - 98 (Russia), 9.7

For any two points $A (x_1 , y_1)$ and $B (x_2, y_2)$, the distance $r (A, B)$ between them is determined by the equality $r(A, B) = | x_1- x_2 | + | y_1 - y_2 |$. Prove that the triangle inequality $r(A, C) + r(C, B) \ge r(A, B)$. holds for the distance introduced in this way . Let $A$ and $B$ be two points of the plane (you can take $A(1, 3)$, $B(3, 7)$). Find the locus of points $C$ for which a) $r(A, C) + r(C, B) = r(A, B)$ b) $r(A, C) = r(C, B).$

2003 Austria Beginners' Competition, 1

For the real numbers $x$ and $y$, $[\sqrt{x}] = 10$ and $[\sqrt{y}] =14$. How large is $\left[\sqrt{[ \sqrt{x+y} ]}\right]$ ? (Note: the square roots are the positive values ​​and $[x]$ is the largest integer less than or equal to x.)

2010 Junior Balkan Team Selection Tests - Romania, 3

Let $a, b, c$ be real numbers with the property as $ab + bc + ca = 1$. Show that: $$\frac {(a + b) ^ 2 + 1} {c ^ 2 + 2} + \frac {(b + c) ^ 2 + 1} {a ^ 2 + 2} + \frac {(c + a) ^ 2 + 1} {b ^ 2 + 2} \ge 3 $$.

1981 Austrian-Polish Competition, 9

For a function $f : [0,1] \to [0,1] $ we define $f^1 = f $ and $f^{n+1} (x) = f (f^n(x))$ for $0 \le x \le 1$ and $n \in N$. Given that there is a $n$ such that $|f^n(x) - f^n(y)| < |x - y| $ for all distinct $x, y \in [0,1]$, prove that there is a unique $x_0 \in [0,1]$ such that $f (x_0) = x_0$.

MMPC Part II 1958 - 95, 1995

[b]p1.[/b] (a) Brian has a big job to do that will take him two hours to complete. He has six friends who can help him. They all work at the same rate, somewhat slower than Brian. All seven working together can finish the job in $45$ minutes. How long will it take to do the job if Brian worked with only three of his friends? (b) Brian could do his next job in $N$ hours, working alone. This time he has an unlimited list of friends who can help him, but as he moves down the list, each friend works more slowly than those above on the list. The first friend would take $kN$ ($k > 1$) hours to do the job alone, the second friend would take $k^2N$ hours alone, the third friend would take $k^3N$ hours alone, etc. Theoretically, if Brian could get all his infinite number of friends to help him, how long would it take to complete the job? [b]p2.[/b] (a) The centers of two circles of radius $1$ are two opposite vertices of a square of side $1$. Find the area of the intersection of the two circles. (b) The centers of two circles of radius $1$ are two consecutive vertices of a square of side $1$. Find the area of the intersection of the two circles and the square. (c) The centers of four circles of radius $1$ are the vertices of a square of side $1$. Find the area of the intersection of the four circles. [b]p3.[/b] For any real number$ x$, $[x]$ denotes the greatest integer that does not exceed $x$. For example, $[7.3] = 7$, $[10/3] = 3$, $[5] = 5$. Given natural number $N$, denote as $f(N)$ the following sum of $N$ integers: $$f(N) = [N/1] + [N/2] + [N/3] + ... + [N/n].$$ (a) Evaluate $f(7) - f(6)$. (b) Evaluate $f(35) - f(34)$. (c) Evaluate (with explanation) $f(1996) - f(1995)$. [b]p4.[/b] We will say that triangle $ABC$ is good if it satisfies the following conditions: $AB = 7$, the other two sides are integers, and $\cos A =\frac27$. (a) Find the sides of a good isosceles triangle. (b) Find the sides of a good scalene (i.e. non-isosceles) triangle. (c) Find the sides of a good scalene triangle other than the one you found in (b) and prove that any good triangle is congruent to one of the three triangles you have found. [b]p5.[/b] (a) A bag contains nine balls, some of which are white, the others are black. Two balls are drawn at random from the bag, without replacement. It is found that the probability that the two balls are of the same color is the same as the probability that they are of different colors. How many of the nine balls were of one color and how many of the other color? (b) A bag contains $N$ balls, some of which are white, the others are black. Two balls are drawn at random from the bag, without replacement. It is found that the probability that the two balls are of the same color is the same as the probability that they are of different colors. It is also found that $180 < N < 220$. Find the exact value of $N$ and determine how many of the $N$ balls were of one color and how many of the other color. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2011 China Team Selection Test, 2

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

2010 AMC 12/AHSME, 24

The set of real numbers $ x$ for which \[ \frac{1}{x\minus{}2009}\plus{}\frac{1}{x\minus{}2010}\plus{}\frac{1}{x\minus{}2011}\ge 1\] is the union of intervals of the form $ a<x\le b$. What is the sum of the lengths of these intervals? $ \textbf{(A)}\ \frac{1003}{335} \qquad \textbf{(B)}\ \frac{1004}{335} \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ \frac{403}{134} \qquad \textbf{(E)}\ \frac{202}{67}$

2022 All-Russian Olympiad, 4

There are $18$ children in the class. Parents decided to give children from this class a cake. To do this, they first learned from each child the area of ​​the piece he wants to get. After that, they showed a square-shaped cake, the area of ​​which is exactly equal to the sum of $18$ named numbers. However, when they saw the cake, the children wanted their pieces to be squares too. The parents cut the cake with lines parallel to the sides of the cake (cuts do not have to start or end on the side of the cake). For what maximum k the parents are guaranteed to cut out $k$ square pieces from the cake, which you can give to $k$ children so that each of them gets what they want?

2024/2025 TOURNAMENT OF TOWNS, P2

Two polynomials with real coefficients have the leading coefficients equal to 1 . Each polynomial has an odd degree that is equal to the number of its distinct real roots. The product of the values of the first polynomial at the roots of the second polynomial is equal to 2024. Find the product of the values of the second polynomial at the roots of the first one. Sergey Yanzhinov

2006 Petru Moroșan-Trident, 1

Let be a natural number $ n\ge 3. $ Solve the equation $ \lfloor x/n \rfloor =\lfloor x-n \rfloor $ in $ \mathbb{R} . $ [i]Constantin Nicolau[/i]

PEN K Problems, 11

Find all functions $f: \mathbb{N}_{0}\to \mathbb{N}_{0}$ such that for all $m,n\in \mathbb{N}_{0}$: \[mf(n)+nf(m)=(m+n)f(m^{2}+n^{2}).\]

2013 China Northern MO, 2

If $a_1,a_2,\cdots,a_{2013}\in[-2,2]$ and $a_1+a_2+\cdots+a_{2013}=0$ , find the maximum of $a^3_1+a^3_2+\cdots+a^3_{2013}$.

2021 IMO Shortlist, N8

Find all positive integers $n$ for which there exists a polynomial $P(x) \in \mathbb{Z}[x]$ such that for every positive integer $m\geq 1$, the numbers $P^m(1), \ldots, P^m(n)$ leave exactly $\lceil n/2^m\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.) [i]Proposed by Carl Schildkraut, USA[/i]

2011 District Olympiad, 2

Tags: counting , algebra
Let $ n $ be a natural number. How many numbers of the form $ \pm 1\pm 2\pm 3\pm\cdots\pm n $ are there?

2010 Contests, 3

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

2024 UMD Math Competition Part II, #4

Tags: calculus , algebra
Prove for every positive integer $n{:}$ \[ \frac {1 \cdot 3 \cdots (2n - 1)}{2 \cdot 4 \cdots (2n)} < \frac 1{\sqrt{3n}}\]

2012 IMO Shortlist, A7

We say that a function $f:\mathbb{R}^k \rightarrow \mathbb{R}$ is a metapolynomial if, for some positive integers $m$ and $n$, it can be represented in the form \[f(x_1,\cdots , x_k )=\max_{i=1,\cdots , m} \min_{j=1,\cdots , n}P_{i,j}(x_1,\cdots , x_k),\] where $P_{i,j}$ are multivariate polynomials. Prove that the product of two metapolynomials is also a metapolynomial.

2010 Stanford Mathematics Tournament, 1

Compute \[\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\cdots}}}}}}\]

2003 Austrian-Polish Competition, 1

Find all real polynomials $p(x) $ such that $p(x-1)p(x+1)= p(x^2-1)$.

2022 VTRMC, 1

Tags: algebra
Give all possible representations of $2022$ as a sum of at least two consecutive positive integers and prove that these are the only representations.

2019 District Olympiad, 3

Let $(a_n)_{n \in \mathbb{N}}$ be a sequence of real numbers such that $$2(a_1+a_2+…+a_n)=na_{n+1}~\forall~n \ge 1.$$ $\textbf{a)}$ Prove that the given sequence is an arithmetic progression. $\textbf{b)}$ If $\lfloor a_1 \rfloor + \lfloor a_2 \rfloor +…+ \lfloor a_n \rfloor = \lfloor a_1+a_2+…+a_n \rfloor~\forall~ n \in \mathbb{N},$ prove that every term of the sequence is an integer.

2005 Romania Team Selection Test, 3

A sequence of real numbers $\{a_n\}_n$ is called a [i]bs[/i] sequence if $a_n = |a_{n+1} - a_{n+2}|$, for all $n\geq 0$. Prove that a bs sequence is bounded if and only if the function $f$ given by $f(n,k)=a_na_k(a_n-a_k)$, for all $n,k\geq 0$ is the null function. [i]Mihai Baluna - ISL 2004[/i]