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

2012 India Regional Mathematical Olympiad, 2

Let $a,b,c$ be positive integers such that $a|b^3, b|c^3$ and $c|a^3$. Prove that $abc|(a+b+c)^{13}$

2024 China National Olympiad, 1

Find the smallest $\lambda \in \mathbb{R}$ such that for all $n \in \mathbb{N}_+$, there exists $x_1, x_2, \ldots, x_n$ satisfying $n = x_1 x_2 \ldots x_{2023}$, where $x_i$ is either a prime or a positive integer not exceeding $n^\lambda$ for all $i \in \left\{ 1,2, \ldots, 2023 \right\}$. [i]Proposed by Yinghua Ai[/i]

2002 Federal Math Competition of S&M, Problem 4

Is it possible to cut a rectangle $2001\times2003$ into pieces of the form [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNS82L2RjZTZjNzc0M2YxMzM1ZDIzZTY2Zjc2NGJlMWJlMWUwMmU2ZWRlLnBuZw==&rn=U2NyZWVuIFNob3QgMjAyMS0wNS0xMyBhdCAzLjQ2LjQ2IFBNLnBuZw==[/img] each consisting of three unit squares?

2014 India IMO Training Camp, 3

For integers $a,b$ we define $f((a,b))=(2a,b-a)$ if $a<b$ and $f((a,b))=(a-b,2b)$ if $a\geq b$. Given a natural number $n>1$ show that there exist natural numbers $m,k$ with $m<n$ such that $f^{k}((n,m))=(m,n)$,where $f^{k}(x)=f(f(f(...f(x))))$,$f$ being composed with itself $k$ times.

2024 AIME, 14

Tags: aime 1 , 3b1b , puzzle
Let $ABCD$ be a tetrahedron such that $AB = CD = \sqrt{41}$, $AC = BD = \sqrt{80}$, and $BC = AD = \sqrt{89}$. There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt{n}}{p}$, when $m$, $n$, and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$.

2011 Northern Summer Camp Of Mathematics, 5

Tags: induction
In a meeting, there are $2011$ scientists attending. We know that, every scientist know at least $1509$ other ones. Prove that a group of five scientists can be formed so that each one in this group knows $4$ people in his group.

2002 Estonia National Olympiad, 5

Juku built a robot that moves along the border of a regular octagon, passing each side in exactly $1$ minute. The robot starts in some vertex $A$ and upon reaching each vertex can either continue in the same direction, or turn around and continue in the opposite direction. In how many different ways can the robot move so that after $n$ minutes it will be in the vertex $B$ opposite to $A$?

2010 IFYM, Sozopol, 1

Determine the number of 2010 letter words, formed by the letters $a$, $b$, and $c$, such that at least one of the three letters is odd number of times in the word.

1973 IMO, 1

Prove that the sum of an odd number of vectors of length 1, of common origin $O$ and all situated in the same semi-plane determined by a straight line which goes through $O,$ is at least 1.

2017-2018 SDML (Middle School), 15

Tags:
For all positive integers $n$ the function $f$ satisfies $f(1) = 1, f(2n + 1) = 2f(n),$ and $f(2n) = 3f(n) + 2$. For how many positive integers $x \leq 100$ is the value of $f(x)$ odd? $\mathrm{(A) \ } 4 \qquad \mathrm{(B) \ } 5 \qquad \mathrm {(C) \ } 6 \qquad \mathrm{(D) \ } 7 \qquad \mathrm{(E) \ } 10$