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

2025 CMIMC Algebra/NT, 10
Tags: algebra , number theory
Let $a_n$ be a recursively defined sequence with $a_0=2024$ and $a_{n+1}=a_n^3+5a_n^2+10a_n+6$ for $n\ge 0.$ Determine the value of $$\sum_{n=0}^{\infty} \frac{2^n(a_n+1)}{a_n^2+3a_n+4}.$$

2021 Science ON Seniors, 2
Tags: number theory , divisibility , order
Find all pairs $(p,q)$ of prime numbers such that $$p^q-4~|~q^p-1.$$ [i](Vlad Robu)[/i]

2023 Brazil National Olympiad, 4
Tags: number theory , diophantine equation , minimum value , algebra
Determine the smallest integer $k$ for which there are three distinct positive integers $a$, $b$ and $c$, such that $$a^2 =bc \text{ and } k = 2b+3c-a.$$

2014 Moldova Team Selection Test, 4
Tags: combinatorics
On a circle $n \geq 1$ real numbers are written, their sum is $n-1$. Prove that one can denote these numbers as $x_1, x_2, ..., x_n$ consecutively, starting from a number and moving clockwise, such that for any $k$ ($1\leq k \leq n$) $ x_1 + x_2+...+x_k \geq k-1$.

1952 Moscow Mathematical Olympiad, 213
Tags: geometric sequence , integer , sum , algebra
Given a geometric progression whose denominator $q$ is an integer not equal to $0$ or $-1$, prove that the sum of two or more terms in this progression cannot equal any other term in it.

2023 HMNT, 5
Tags: number theory
Compute the unique positive integer $n$ such that $\frac{n^3-1989}{n}$ is a perfect square.

2010 Contests, 2
Tags: number theory
Determine the number of positive integers $n$ for which $(n+15)(n+2010)$ is a perfect square.

2024 Australian Mathematical Olympiad, P2
Tags: geometry
Let $ABCD$ be a cyclic quadrilateral. Point $P$ is on line $CB$ such that $CP=CA$and $B$ lies between $C$ and $P$. Point $Q$ is on line $CD$ such that $CQ=CA$ and $D$ lies between $C$ and $Q$. Prove that the incentre of triangle $ABD$ lies on line $PQ.$

1968 Miklós Schweitzer, 11
Tags: probability , probability and stats
Let $ A_1,...,A_n$ be arbitrary events in a probability field. Denote by $ C_k$ the event that at least $ k$ of $ A_1,...,A_n$ occur. Prove that \[ \prod_{k=1}^n P(C_k) \leq \prod_{k=1}^n P(A_k).\] [i]A. Renyi[/i]

1996 USAMO, 4
Tags: induction , function , modular arithmetic , strong induction , combinatorics
An $n$-term sequence $(x_1, x_2, \ldots, x_n)$ in which each term is either 0 or 1 is called a [i]binary sequence of length [/i]$n$. Let $a_n$ be the number of binary sequences of length $n$ containing no three consecutive terms equal to 0, 1, 0 in that order. Let $b_n$ be the number of binary sequences of length $n$ that contain no four consecutive terms equal to 0, 0, 1, 1 or 1, 1, 0, 0 in that order. Prove that $b_{n+1} = 2a_n$ for all positive integers $n$.

2010 Contests, 4
Tags: inequalities
If $a,b,c\in (0,1)$ satisfy $a+b+c=2$ , prove that $\frac{abc}{(1-a)(1-b)(1-c)}\ge 8$

1987 IMO Longlists, 49
Tags: analytic geometry , ceiling function , combinatorics
In the coordinate system in the plane we consider a convex polygon $W$ and lines given by equations $x = k, y = m$, where $k$ and $m$ are integers. The lines determine a tiling of the plane with unit squares. We say that the boundary of $W$ intersects a square if the boundary contains an interior point of the square. Prove that the boundary of $W$ intersects at most $4 \lceil d \rceil $ unit squares, where $d$ is the maximal distance of points belonging to $W$ (i.e., the diameter of $W$) and $\lceil d \rceil$ is the least integer not less than $d.$

MathLinks Contest 1st, 1
Tags: number theory
Let $a, m$ be two positive integers, $a \ne 10^k$, for all non-negative integers $k$ and $d_1, d_2, ... , d_m$ random decimal$^1$ digits with $d_1 > 0$. Prove that there exists some positive integer $n$ for which the representation in the decimal base of the number $a^n$ begins with the digits $d_1, d_2, ... , d_m$ in this order. $^1$ lesser or equal with $9$

2005 Tournament of Towns, 5
Tags: geometry , 3d geometry , invariance
A cube lies on the plane. After being rolled a few times (over its edges), it is brought back to its initial location with the same face up. Could the top face have been rotated by 90 degrees? [i](5 points)[/i]

2008 Stars Of Mathematics, 2
Tags: combinatorics
The $ 2^N$ vertices of the $ N$-dimensional hypercube $ \{0,1\}^N$ are labelled with integers from $ 0$ to $ 2^N \minus{} 1$, by, for $ x \equal{} (x_1,x_2,\ldots ,x_N)\in \{0,1\}^N$, \[v(x) \equal{} \sum_{k \equal{} 1}^{N}x_k2^{k \minus{} 1}.\] For which values $ n$, $ 2\leq n \leq 2^n$ can the vertices with labels in the set $ \{v|0\leq v \leq n \minus{} 1\}$ be connected through a Hamiltonian circuit, using edges of the hypercube only? [i]E. Bazavan & C. Talau[/i]

2019 Spain Mathematical Olympiad, 5
Tags: minimum value , inequalities
We consider all pairs (x, y) of real numbers such that $0\leq x \leq y \leq 1$.Let $M (x,y)$ the maximum value of the set $$A=\{xy, 1-x-y+xy, x+y-2xy\}.$$ Find the minimum value that $M(x,y)$ can take for all these pairs $(x,y)$.

2003 Korea - Final Round, 1
Tags: inequalities , combinatorics
Some computers of a computer room have a following network. Each computers are connected by three cable to three computers. Two arbitrary computers can exchange data directly or indirectly (through other computers). Now let's remove $K$ computers so that there are two computers, which can not exchange data, or there is one computer left. Let $k$ be the minimum value of $K$. Let's remove $L$ cable from original network so that there are two computers, which can not exchange data. Let $l$ be the minimum value of $L$. Show that $k=l$.

2018 Philippine MO, 3
Tags: linear algebra , matrix , combinatorics
Let $n$ be a positive integer. An $n \times n$ matrix (a rectangular array of numbers with $n$ rows and $n$ columns) is said to be a platinum matrix if: [list=i] [*] the $n^2$ entries are integers from $1$ to $n$; [*] each row, each column, and the main diagonal (from the upper left corner to the lower right corner) contains each integer from $1$ to $n$ exactly once; and [*] there exists a collection of $n$ entries containing each of the numbers from $1$ to $n$, such that no two entries lie on the same row or column, and none of which lie on the main diagonal of the matrix. [/list] Determine all values of $n$ for which there exists an $n \times n$ platinum matrix.

2013 Romania Team Selection Test, 1
Tags: inequalities , algebra , polynomial , absolute value , triangle inequality , number theory
Let $a$ and $b$ be two square-free, distinct natural numbers. Show that there exist $c>0$ such that \[ \left | \{n\sqrt{a}\}-\{n\sqrt{b}\} \right |>\frac{c}{n^3}\] for every positive integer $n$.

2005 MOP Homework, 1
Tags: geometry , rectangle , pigeonhole principle , rotation , combinatorics
Two rooks on a chessboard are said to be attacking each other if they are placed in the same row or column of the board. (a) There are eight rooks on a chessboard, none of them attacks any other. Prove that there is an even number of rooks on black fields. (b) How many ways can eight mutually non-attacking rooks be placed on the 9 £ 9 chessboard so that all eight rooks are on squares of the same color.

1994 Portugal MO, 1
Tags: number theory
Determine the smallest natural number that has exactly $1994$ divisors.

2017 Junior Regional Olympiad - FBH, 2
Tags: milk , equation
In three cisterns of milk lies $780$ litres of milk. When we pour off from first cistern quarter of milk, from second cistern fifth of milk and from third cistern $\frac{3}{7}$ of milk, in all cisterns remain same amount of milk. How many milk is in cisterns?

2022 Moldova EGMO TST, 3
Tags: combinatorics
Find the smallest nonnegative integer $n$ such that in every set of $n$ numbers there are always two distinct numbers such that their sum or difference is divisible by $2022$.

2003 Greece National Olympiad, 2
Tags: algebra
Find all real solutions of the system \[\begin{cases}x^2 + y^2 - z(x + y) = 2, \\ y^2 + z^2 - x(y + z) = 4, \\ z^2 + x^2 - y(z + x) = 8.\end{cases}\]

2008 Junior Balkan Team Selection Tests - Romania, 1
Tags: induction , modular arithmetic , number theory , logarithm
Let $ p$ be a prime number, $ p\not \equal{} 3$, and integers $ a,b$ such that $p\mid a+b$ and $ p^2\mid a^3 \plus{} b^3$. Prove that $ p^2\mid a \plus{} b$ or $ p^3\mid a^3 \plus{} b^3$.