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

1994 All-Russian Olympiad, 4

Real numbers are written on the squares of an infinite grid. Two figures consisting of finitely many squares are given. They may be translated anywhere on the grid as long as their squares coincide with those of the grid. It is known that wherever the first figure is translated, the sum of numbers it covers is positive. Prove that the second figure can be translated so that the sum of the numbers it covers is also positive.

IV Soros Olympiad 1997 - 98 (Russia), 10.1

On the coordinate plane, draw a set of points whose coordinates $(x, y)$ satisfy the equation $y=x+|y-3x-2x^2|$.

2006 Romania National Olympiad, 4

Let $\displaystyle n \in \mathbb N$, $\displaystyle n \geq 2$. Determine $\displaystyle n$ sets $\displaystyle A_i$, $\displaystyle 1 \leq i \leq n$, from the plane, pairwise disjoint, such that: (a) for every circle $\displaystyle \mathcal C$ from the plane and for every $\displaystyle i \in \left\{ 1,2,\ldots,n \right\}$ we have $\displaystyle A_i \cap \textrm{Int} \left( \mathcal C \right) \neq \phi$; (b) for all lines $\displaystyle d$ from the plane and every $\displaystyle i \in \left\{ 1,2,\ldots,n \right\}$, the projection of $\displaystyle A_i$ on $\displaystyle d$ is not $\displaystyle d$.

2006 Princeton University Math Competition, 9

Consider all line segments of length $4$ with one end-point on the line $y = x$ and the other end-point on the line $y = 2x$. Find the equation of the locus of the midpoints of these line segments.

2009 Today's Calculation Of Integral, 423

Let $ f(x)\equal{}x^2\plus{}3$ and $ y\equal{}g(x)$ be the equation of the line with the slope $ a$, which pass through the point $ (0,\ f(0))$ . Find the maximum and minimum values of $ I(a)\equal{}3\int_{\minus{}1}^1 |f(x)\minus{}g(x)|\ dx$.

2001 AMC 8, 11

Points $A, B, C$ and $D$ have these coordinates: $A(3,2), B(3,-2), C(-3,-2)$ and $D(-3, 0)$. The area of quadrilateral $ABCD$ is [asy] for (int i = -4; i <= 4; ++i) { for (int j = -4; j <= 4; ++j) { dot((i,j)); } } draw((0,-4)--(0,4),linewidth(1)); draw((-4,0)--(4,0),linewidth(1)); for (int i = -4; i <= 4; ++i) { draw((i,-1/3)--(i,1/3),linewidth(0.5)); draw((-1/3,i)--(1/3,i),linewidth(0.5)); }[/asy] $ \text{(A)}\ 12\qquad\text{(B)}\ 15\qquad\text{(C)}\ 18\qquad\text{(D)}\ 21\qquad\text{(E)}\ 24 $

2011 AIME Problems, 13

A cube with side length 10 is suspended above a plane. The vertex closest to the plane is labelled $A$. The three vertices adjacent to vertex $A$ are at heights 10, 11, and 12 above the plane. The distance from vertex $A$ to the plane can be expressed as $\tfrac{r-\sqrt{s}}{t}$, where $r$, $s$, and $t$ are positive integers, and $r+s+t<1000$. Find $r+s+t$.

2004 USA Team Selection Test, 5

Let $A = (0, 0, 0)$ in 3D space. Define the [i]weight[/i] of a point as the sum of the absolute values of the coordinates. Call a point a [i]primitive lattice point[/i] if all of its coordinates are integers whose gcd is 1. Let square $ABCD$ be an [i]unbalanced primitive integer square[/i] if it has integer side length and also, $B$ and $D$ are primitive lattice points with different weights. Prove that there are infinitely many unbalanced primitive integer squares such that the planes containing the squares are not parallel to each other.

1973 AMC 12/AHSME, 11

A circle with a circumscribed and an inscribed square centered at the origin $ O$ of a rectangular coordinate system with positive $ x$ and $ y$ axes $ OX$ and $ OY$ is shown in each figure $ I$ to $ IV$ below. [asy] size((400)); draw((0,0)--(22,0), EndArrow); draw((10,-10)--(10,12), EndArrow); draw((25,0)--(47,0), EndArrow); draw((35,-10)--(35,12), EndArrow); draw((-25,0)--(-3,0), EndArrow); draw((-15,-10)--(-15,12), EndArrow); draw((-50,0)--(-28,0), EndArrow); draw((-40,-10)--(-40,12), EndArrow); draw(Circle((-40,0),6)); draw(Circle((-15,0),6)); draw(Circle((10,0),6)); draw(Circle((35,0),6)); draw((-34,0)--(-40,6)--(-46,0)--(-40,-6)--(-34,0)--(-34,6)--(-46,6)--(-46,-6)--(-34,-6)--cycle); draw((-6.5,0)--(-15,8.5)--(-23.5,0)--(-15,-8.5)--cycle); draw((-10.8,4.2)--(-19.2,4.2)--(-19.2,-4.2)--(-10.8,-4.2)--cycle); draw((14.2,4.2)--(5.8,4.2)--(5.8,-4.2)--(14.2,-4.2)--cycle); draw((16,6)--(4,6)--(4,-6)--(16,-6)--cycle); draw((41,0)--(35,6)--(29,0)--(35,-6)--cycle); draw((43.5,0)--(35,8.5)--(26.5,0)--(35,-8.5)--cycle); label("I", (-49,9)); label("II", (-24,9)); label("III", (1,9)); label("IV", (26,9)); label("X", (-28,0), S); label("X", (-3,0), S); label("X", (22,0), S); label("X", (47,0), S); label("Y", (-40,12), E); label("Y", (-15,12), E); label("Y", (10,12), E); label("Y", (35,12), E);[/asy] The inequalities \[ |x| \plus{} |y| \leq \sqrt {2(x^2 \plus{} y^2)} \leq 2\mbox{Max}(|x|, |y|)\] are represented geometrically* by the figure numbered $ \textbf{(A)}\ I \qquad \textbf{(B)}\ II \qquad \textbf{(C)}\ III \qquad \textbf{(D)}\ IV \qquad \textbf{(E)}\ \mbox{none of these}$ *An inequality of the form $ f(x, y) \leq g(x, y)$, for all $ x$ and $ y$ is represented geometrically by a figure showing the containment \[ \{\mbox{The set of points }(x, y)\mbox{ such that }g(x, y) \leq a\} \subset\\ \{\mbox{The set of points }(x, y)\mbox{ such that }f(x, y) \leq a\}\] for a typical real number $ a$.

2006 Putnam, B4

Let $Z$ denote the set of points in $\mathbb{R}^{n}$ whose coordinates are $0$ or $1.$ (Thus $Z$ has $2^{n}$ elements, which are the vertices of a unit hypercube in $\mathbb{R}^{n}$.) Given a vector subspace $V$ of $\mathbb{R}^{n},$ let $Z(V)$ denote the number of members of $Z$ that lie in $V.$ Let $k$ be given, $0\le k\le n.$ Find the maximum, over all vector subspaces $V\subseteq\mathbb{R}^{n}$ of dimension $k,$ of the number of points in $V\cap Z.$

2011 Olympic Revenge, 3

Let $E$ to be an infinite set of congruent ellipses in the plane, and $r$ a fixed line. It is known that each line parallel to $r$ intersects at least one ellipse belonging to $E$. Prove that there exist infinitely many triples of ellipses belonging to $E$, such that there exists a line that intersect the triple of ellipses.

2012 NIMO Summer Contest, 14

A set of lattice points is called [i]good[/i] if it does not contain two points that form a line with slope $-1$ or slope $1$. Let $S = \{(x, y)\ |\ x, y \in \mathbb{Z}, 1 \le x, y \le 4\}$. Compute the number of non-empty good subsets of $S$. [i]Proposed by Lewis Chen[/i]

1960 AMC 12/AHSME, 30

Given the line $3x+5y=15$ and a point on this line equidistant from the coordinate axes. Such a point exists in: $ \textbf{(A)}\ \text{none of the quadrants} \qquad\textbf{(B)}\ \text{quadrant I only} \qquad\textbf{(C)}\ \text{quadrants I, II only} \qquad$ $\textbf{(D)}\ \text{quadrants I, II, III only} \qquad\textbf{(E)}\ \text{each of the quadrants} $

2003 District Olympiad, 1

In the interior of a cube we consider $\displaystyle 2003$ points. Prove that one can divide the cube in more than $\displaystyle 2003^3$ cubes such that any point lies in the interior of one of the small cubes and not on the faces.

2012 Today's Calculation Of Integral, 788

For a function $f(x)=\ln (1+\sqrt{1-x^2})-\sqrt{1-x^2}-\ln x\ (0<x<1)$, answer the following questions: (1) Find $f'(x)$. (2) Sketch the graph of $y=f(x)$. (3) Let $P$ be a mobile point on the curve $y=f(x)$ and $Q$ be a point which is on the tangent at $P$ on the curve $y=f(x)$ and such that $PQ=1$. Note that the $x$-coordinate of $Q$ is les than that of $P$. Find the locus of $Q$.

2004 National High School Mathematics League, 14

Three points $A\left(0,\frac{4}{3}\right),B(-1,0),C(1,0)$ are given. The distance from $P$ to line $BC$ is the geometric mean of that from $P$ to lines $AB$ and $AC$. [b](a)[/b] Find the path equation of point $P$. [b](b)[/b] If line $L$ passes $D$ ($D$ is the incenter of $\triangle ABC$ ), and it has three common points with the path of $P$, find the range value of slope $k$ of line $L$.

2010 Math Prize For Girls Problems, 10

The triangle $ABC$ lies on the coordinate plane. The midpoint of $\overline{AB}$ has coordinates $(-16, -63)$, the midpoint of $\overline{AC}$ has coordinates $(13, 50)$, and the midpoint of $\overline{BC}$ has coordinates $(6, -85)$. What are the coordinates of point $A$?

2008 All-Russian Olympiad, 3

A circle $ \omega$ with center $ O$ is tangent to the rays of an angle $ BAC$ at $ B$ and $ C$. Point $ Q$ is taken inside the angle $ BAC$. Assume that point $ P$ on the segment $ AQ$ is such that $ AQ\perp OP$. The line $ OP$ intersects the circumcircles $ \omega_{1}$ and $ \omega_{2}$ of triangles $ BPQ$ and $ CPQ$ again at points $ M$ and $ N$. Prove that $ OM \equal{} ON$.

2011 Tokio University Entry Examination, 6

(1) Let $x>0,\ y$ be real numbers. For variable $t$, find the difference of Maximum and minimum value of the quadratic function $f(t)=xt^2+yt$ in $0\leq t\leq 1$. (2) Let $S$ be the domain of the points $(x,\ y)$ in the coordinate plane forming the following condition: For $x>0$ and all real numbers $t$ with $0\leq t\leq 1$ , there exists real number $z$ for which $0\leq xt^2+yt+z\leq 1$ . Sketch the outline of $S$. (3) Let $V$ be the domain of the points $(x,\ y,\ z) $ in the coordinate space forming the following condition: For $0\leq x\leq 1$ and for all real numbers $t$ with $0\leq t\leq 1$, $0\leq xt^2+yt+z\leq 1$ holds. Find the volume of $V$. [i]2011 Tokyo University entrance exam/Science, Problem 6[/i]

2001 All-Russian Olympiad, 4

Participants to an olympiad worked on $n$ problems. Each problem was worth a [color=#FF0000]positive [/color]integer number of points, determined by the jury. A contestant gets $0$ points for a wrong answer, and all points for a correct answer to a problem. It turned out after the olympiad that the jury could impose worths of the problems, so as to obtain any (strict) final ranking of the contestants. Find the greatest possible number of contestants.

2016 Bosnia And Herzegovina - Regional Olympiad, 4

It is given circle with center in center of coordinate center with radius of $2016$. On circle and inside it are $540$ points with integer coordinates such that no three of them are collinear. Prove that there exist two triangles with vertices in given points such that they have same area

1985 Swedish Mathematical Competition, 5

In a rectangular coordinate system, $O$ is the origin and $A(a,0)$, $B(0,b)$ and $C(c,d)$ the vertices of a triangle. Prove that $AB+BC+CA \ge 2CO$.

1971 IMO Longlists, 25

Let $ABC,AA_1A_2,BB_1B_2, CC_1C_2$ be four equilateral triangles in the plane satisfying only that they are all positively oriented (i.e., in the counterclockwise direction). Denote the midpoints of the segments $A_2B_1,B_2C_1, C_2A_1$ by $P,Q,R$ in this order. Prove that the triangle $PQR$ is equilateral.

2024 Brazil Undergrad MO, 4

We say that a function \( f: \mathbb{R} \to \mathbb{R} \) is morally odd if its graph is symmetric with respect to a point, that is, there exists \((x_0, y_0) \in \mathbb{R}^2\) such that if \((u, v) \in \{(x, f(x)) : x \in \mathbb{R}\}\), then \((2x_0 - u, 2y_0 - v) \in \{(x, f(x)) : x \in \mathbb{R}\}\). On the other hand, \( f \) is said to be morally even if its graph \(\{(x, f(x)) : x \in \mathbb{R}\}\) is symmetric with respect to some line (not necessarily vertical or horizontal). If \( f \) is morally even and morally odd, we say that \( f \) is parimpar. (a) Let \( S \subset \mathbb{R} \) be a bounded set and \( f: S \to \mathbb{R} \) be an arbitrary function. Prove that there exists \( g: \mathbb{R} \to \mathbb{R} \) that is parimpar such that \( g(x) = f(x) \) for all \( x \in S \). (b) Find all polynomials \( P \) with real coefficients such that the corresponding polynomial function \( P: \mathbb{R} \to \mathbb{R} \) is parimpar.

2010 Mexico National Olympiad, 2

In each cell of an $n\times n$ board is a lightbulb. Initially, all of the lights are off. Each move consists of changing the state of all of the lights in a row or of all of the lights in a column (off lights are turned on and on lights are turned off). Show that if after a certain number of moves, at least one light is on, then at this moment at least $n$ lights are on.