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

Find all functions $ f : \mathbb{R} \rightarrow \mathbb{R} $ such that \[ f( xf(x) + 2y) = f(x^2)+f(y)+x+y-1 \] holds for all $ x, y \in \mathbb{R}$.
Find the area of the $MNRK$ trapezoid with the lateral side $RK = 3$ if the distances from the vertices $M$ and $N$ to the line $RK$ are $5$ and $7$, respectively.
$100$ points are given in space such that no four of them lie in the same plane. Consider those convex polyhedra with five vertices that have all vertices from the given set. Prove that the number of such polyhedra is even.
Given $n$ points in a circle, Arnaldo write 0 or 1 in all the points. Bernado can do a operation, he can chosse some point and change its number and the numbers of the points on the right and left side of it. Arnaldo wins if Bernado can´t change all the numbers in the circle to 0, and Bernado wins if he can a) Show that Bernado can win if $n=101$ b) Show that Arnaldo wins if $n=102$
A circle $\omega$ with radius $1$ is given. A collection $T$ of triangles is called [i]good[/i], if the following conditions hold: [list=1] [*] each triangle from $T$ is inscribed in $\omega$; [*] no two triangles from $T$ have a common interior point. [/list] Determine all positive real numbers $t$ such that, for each positive integer $n$, there exists a good collection of $n$ triangles, each of perimeter greater than $t$.
At a party, a group of $20$ people needs to be seated at $4$ tables. The seating arrangement is called [i]successful [/i] if any two people at the same table are friends. It turned out that successful seating arrangements exist. In a successful seating arrangement, exactly $5$ people sit at each table. What is the greatest possible number of pairs of friends in this companies?
Let $n$ be a positive integer. Find the number of polynomials $P(x)$ with coefficients in $\{0, 1, 2, 3\}$ for which $P(2) = n$.
Determine all pairs of real numbers $a$ and $x$ that satisfy the simultaneous equations $$5x^3 + ax^2 + 8 = 0$$ and $$5x^3 + 8x^2 + a = 0.$$
Find all natural numbers $ n$ for which every natural number whose decimal representation has $ n \minus{} 1$ digits $ 1$ and one digit $ 7$ is prime.
On a circle with diameter $AB$, lie points $C$ and $D$. $XY$ is the diameter passing through the midpoint $K$ of the chord $CD$. Point $M$ is the projection of point $X$ onto line $AC$, and point $N$ is the projection of point $Y$ on line $BD$. Prove that points $M, N$ and $K$ are collinear. (A. Zaslavsky)
One plant is now $44$ centimeters tall and will grow at a rate of $3$ centimeters every $2$ years. A second plant is now $80$ centimeters tall and will grow at a rate of $5$ centimeters every $6$ years. In how many years will the plants be the same height?
a) One has a set of stones with weights $1, 2, \ldots, 20$ grams. Find all $k$ for which it is possible to place $k$ and the rest $20-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. b) One has a set of stones with weights $1, 2, \ldots, 51$ grams. Find all $k$ for which it is possible to place $k$ and the rest $51-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. c) One has a set of stones with weights $1, 2, \ldots, n$ grams ($n\in\mathbb{N}$). Find all $n$ and $k$ for which it is possible to place $k$ and the rest $n-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. [size=75] a) and b) were proposed at the festival, c) is a generalization[/size]
The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. [asy] defaultpen(linewidth(0.7)); draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); draw((34,36)--(34,45)--(25,45)); draw((36,36)--(36,38)--(34,38)); draw((36,38)--(41,38)); draw((34,45)--(41,45));[/asy]
$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.
Let $ABCD$ be a cyclic quadrilateral with circumcircle $\omega$. Let $I, J$ and $K$ be the incentres of the triangles $ABC, ACD$ and $ABD$ respectively. Let $E$ be the midpoint of the arc $DB$ of circle $\omega$ containing the point $A$. The line $EK$ intersects again the circle $\omega$ at point $F$ $(F \neq E)$. Prove that the points $C, F, I, J$ lie on a circle.
A unit square is removed from the corner of an $n \times n$ grid, where $n \geq 2$. Prove that the remainder can be covered by copies of the figures of $3$ or $5$ unit squares depicted in the drawing below. [asy] import geometry; draw((-1.5,0)--(-3.5,0)--(-3.5,2)--(-2.5,2)--(-2.5,1)--(-1.5,1)--cycle); draw((-3.5,1)--(-2.5,1)--(-2.5,0)); draw((0.5,0)--(0.5,3)--(1.5,3)--(1.5,1)--(3.5,1)--(3.5,0)--cycle); draw((1.5,0)--(1.5,1)); draw((2.5,0)--(2.5,1)); draw((0.5,1)--(1.5,1)); draw((0.5,2)--(1.5,2)); [/asy] [b]Note:[/b] Every square must be covered once and figures must not go over the bounds of the grid.
Do there exist $100$ straight lines on a plane such that they intersect each other in exactly $1999$ points?
Find all $4$ consecutive even numbers, such that the sum of their squares divides the square of their product.
Let $n\ge2$ be a positive integer. The numbers $1,2,..., n^2$ are consecutively placed into squares of an $n\times n$, so the first row contains $1,2,...,n$ from left to right, the second row contains $n+1,n+2,...,2n$ from left to right, and so on. The [i]magic square value[/i] of a grid is defined to be the number of rows, columns, and main diagonals whose elements have an average value of $\frac{n^2 + 1}{2}$. Show that the magic-square value of the grid stays constant under the following two operations: (1) a permutation of the rows; and (2) a permutation of the columns. (The operations can be used multiple times, and in any order.) [i]Proposed by Ray Li[/i]
The number $2019$ is written on a blackboard. Every minute, if the number $a$ is written on the board, Evan erases it and replaces it with a number chosen from the set $$ \left\{ 0, 1, 2, \ldots, \left\lceil 2.01 a \right\rceil \right\} $$ uniformly at random. Is there an integer $N$ such that the board reads $0$ after $N$ steps with at least $99\%$ probability?
Calculate the following indefinite integrals. [1] $\int \sin x\sin 2x dx$ [2] $\int \frac{e^{2x}}{e^x-1}dx$ [3] $\int \frac{\tan ^2 x}{\cos ^2 x}dx$ [4] $\int \frac{e^x+e^{-x}}{e^x-e^{-x}}dx$ [5] $\int \frac{e^x}{e^x+1}dx$
Solve the system of equations $$ \left\{\begin{array}{l} x \log x+y \log y+z \log x=0\\ \\ \dfrac{\log x}{x}+\dfrac{\log y}{y}+\dfrac{\log z}{z}=0 \end{array} \right. $$
Found the smaller multiple of $2019$ of the form $abcabc\dots abc$, where $a,b$ and $c$ are digits.
Let $p_n$ denote the $n^{\text{th}}$ prime number and define $a_n=\lfloor p_n\nu\rfloor$ for all positive integers $n$ where $\nu$ is a positive irrational number. Is it possible that there exist only finitely many $k$ such that $\binom{2a_k}{a_k}$ is divisible by $p_i^{10}$ for all $i=1,2,\ldots,2020?$ [i]Proposed by Superguy and ayan.nmath[/i]
All members of geometrical progression $(b_n)_{n\geq1}$ are members of some arithmetical progression. It is known that $b_1$ is an integer. Prove that all members of this geometrical progression are integers. (progression is infinite)