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

1990 National High School Mathematics League, 10

Define $f(n):$ the number of integral points of line segment $OA_n$ ($O$ and $A_n$ not included), where $A_n(n,n+3)$. Then, $f(1)+f(2)+\cdots+f(1990)=$________.

2024/2025 TOURNAMENT OF TOWNS, P1

Peter writes a positive integer on the whiteboard. Each minute Basil multiplies the last written number by 2 or by 3 and writes the product on the whiteboard too. Can Peter choose the starting integer such that, irrespective of Basil's strategy, at any given moment the number of integers on the whiteboard starting with 1 or 2 would exceed the number of the ones starting with 7, 8 or 9 ? Maxim Didin

2007 iTest Tournament of Champions, 5

Tags:
Convex quadrilateral $ABCD$ has the property that the circles with diameters $AB$ and $CD$ are tangent at point $X$ inside the quadrilateral, and likewise, the circles with diameters $BC$ and $DA$ are tangent at a point $Y$ inside the quadrilateral. Given that the perimeter of $ABCD$ is $96$, and the maximum possible length of $XY$ is $m$, find $\lfloor 2007m\rfloor$.

2011 SEEMOUS, Problem 1

Let $f:[0,1]\rightarrow R$ be a continuous function and n be an integer number,n>0.Prove that $\int_0^1f(x)dx \le (n+1)*\int_0^1 x^n*f(x)dx $

2019 Thailand TSTST, 3

Let $n\geq 2$ be an integer. Determine the number of terms in the polynomial $$\prod_{1\leq i< j\leq n}(x_i+x_j)$$ whose coefficients are odd integers.

1985 IMO Shortlist, 15

Let $K$ and $K'$ be two squares in the same plane, their sides of equal length. Is it possible to decompose $K$ into a finite number of triangles $T_1, T_2, \ldots, T_p$ with mutually disjoint interiors and find translations $t_1, t_2, \ldots, t_p$ such that \[K'=\bigcup_{i=1}^{p} t_i(T_i) \ ? \]

2021 Canada National Olympiad, 3

At a dinner party there are $N$ hosts and $N$ guests, seated around a circular table, where $N\geq 4$. A pair of two guests will chat with one another if either there is at most one person seated between them or if there are exactly two people between them, at least one of whom is a host. Prove that no matter how the $2N$ people are seated at the dinner party, at least $N$ pairs of guests will chat with one another.

2017 AIME Problems, 14

Tags:
Let $a > 1$ and $x > 1$ satisfy $\log_a(\log_a(\log_a 2) + \log_a 24 - 128) = 128$ and $\log_a(\log_a x) = 256$. Find the remainder when $x$ is divided by $1000$.

2024 Serbia Team Selection Test, 1

Three coins are placed at the origin of a Cartesian coordinate system. On one move one removes a coin placed at some position $(x, y)$ and places three new coins at $(x+1, y)$, $(x, y+1)$ and $(x+1, y+1)$. Prove that after finitely many moves, there will exist two coins placed at the same point.

2011 Chile National Olympiad, 3

Consider the following figure formed by $10$ nodes and $15$ edges: [asy] unitsize(1.5 cm); pair A, B, C, D, E, F, G, H, I, J; A = dir(90); B = dir(90 + 360/5); C = dir(90 + 2*360/5); D = dir(90 + 3*360/5); E = dir(90 + 4*360/5); F = 0.6*A; G = 0.6*B; H = 0.6*C; I = 0.6*D; J = 0.6*E; draw(A--B--C--D--E--cycle); draw(F--H--J--G--I--cycle); draw(A--F); draw(B--G); draw(C--H); draw(D--I); draw(E--J); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); dot(I); dot(J); [/asy] Prove that the edges of the figure cannot be colored by using $3$ different colors so that the edges that reach each node have different colors from each other.

2013 Bangladesh Mathematical Olympiad, 1

Tags: geometry
Higher Secondary P1 A polygon is called degenerate if one of its vertices falls on a line that joins its neighboring two vertices. In a pentagon $ABCDE$, $AB=AE$, $BC=DE$, $P$ and $Q$ are midpoints of $AE$ and $AB$ respectively. $PQ||CD$, $BD$ is perpendicular to both $AB$ and $DE$. Prove that $ABCDE$ is a degenerate pentagon.

2011 Canadian Open Math Challenge, 2

Tags:
Carmen selects four different numbers from the set $\{1, 2, 3, 4, 5, 6, 7\}$ whose sum is 11. If $l$ is the largest of these four numbers, what is the value of $l$?

2024 CMIMC Team, 4

Tags: team
Eric and Christina are playing a game with $n$ stones. They alternate taking some number of stones from the pile, with Eric going first. The number of stones Eric takes from the pile must be a power of $3$ (e.g. 1, 3, 9, 27, ...), while the number of stones Christina takes must be a power of $2$ (e.g. 1, 2, 4, 8, ...). Whoever takes the last stone wins. Find the sum of all $1\leq n \leq 100$ for which Eric has a winning strategy. [i]Proposed by Connor Gordon[/i]

2021 Thailand TST, 2

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

2019 China Team Selection Test, 3

Does there exist a bijection $f:\mathbb{N}^{+} \rightarrow \mathbb{N}^{+}$, such that there exist a positive integer $k$, and it's possible to have each positive integer colored by one of $k$ chosen colors, such that for any $x \neq y$ , $f(x)+y$ and $f(y)+x$ are not the same color?

2024 Saint Petersburg Mathematical Olympiad, 4

Given a $101$-digit number $a$ and an arbitrary positive integer $b$. Prove that there is at most a $102$-digit positive integer $c$ such that any number of the form $\overline{caaa \dots ab}$ is composite.

2006 Federal Math Competition of S&M, Problem 1

Suppose $a,b,c,A,B,C$ are real numbers with $a\ne0$ and $A\ne0$ such that for all $x$, $$\left|ax^2+bx+c\right|\le\left|Ax^2+Bx+C\right|.$$Prove that $$\left|b^2-4ac\right|\le\left|B^2-4AC\right|.$$

MathLinks Contest 7th, 1.1

Given is an acute triangle $ ABC$ and the points $ A_1,B_1,C_1$, that are the feet of its altitudes from $ A,B,C$ respectively. A circle passes through $ A_1$ and $ B_1$ and touches the smaller arc $ AB$ of the circumcircle of $ ABC$ in point $ C_2$. Points $ A_2$ and $ B_2$ are defined analogously. Prove that the lines $ A_1A_2$, $ B_1B_2$, $ C_1C_2$ have a common point, which lies on the Euler line of $ ABC$.

2005 China Team Selection Test, 2

Given prime number $p$. $a_1,a_2 \cdots a_k$ ($k \geq 3$) are integers not divible by $p$ and have different residuals when divided by $p$. Let \[ S_n= \{ n \mid 1 \leq n \leq p-1, (na_1)_p < \cdots < (na_k)_p \} \] Here $(b)_p$ denotes the residual when integer $b$ is divided by $p$. Prove that $|S|< \frac{2p}{k+1}$.

2008 AIME Problems, 10

The diagram below shows a $ 4\times4$ rectangular array of points, each of which is $ 1$ unit away from its nearest neighbors. [asy]unitsize(0.25inch); defaultpen(linewidth(0.7)); int i, j; for(i = 0; i < 4; ++i) for(j = 0; j < 4; ++j) dot(((real)i, (real)j));[/asy]Define a [i]growing path[/i] to be a sequence of distinct points of the array with the property that the distance between consecutive points of the sequence is strictly increasing. Let $ m$ be the maximum possible number of points in a growing path, and let $ r$ be the number of growing paths consisting of exactly $ m$ points. Find $ mr$.

2012 Purple Comet Problems, 5

Tags:
Meredith drives 5 miles to the northeast, then 15 miles to the southeast, then 25 miles to the southwest, then 35 miles to the northwest, and finally 20 miles to the northeast. How many miles is Meredith from where she started?

2009 Hanoi Open Mathematics Competitions, 7

Tags: inequalities
Let $a,b,c,d$ be positive integers such that $a+b+c+d=99$. Find the maximum and minimum of product $abcd$

1998 Singapore Team Selection Test, 2

Let $n \ge 2$ be an integer. Let $S$ be a set of $n$ elements and let $A_i, 1 \le i \le m$, be distinct subsets of $S$ of size at least $2$ such that $A_i \cap A_j \ne \emptyset$, $A_i \cap A_k \ne \emptyset$, $A_j \cap A_k \ne \emptyset$ imply $A_i \cap A_j \cap A_k \ne \emptyset$. Show that $m \le 2^{n-1}$ -

1980 IMO Shortlist, 13

Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.

2020 Princeton University Math Competition, A2/B3

Cary has six distinct coins in a jar. Occasionally, he takes out three of the coins and adds a dot to each of them. Determine the number of orders in which Cary can choose the coins so that, eventually, for each number $i \in \{0, 1, . . . , 5\}$, some coin has exactly $i$ dots on it.