Found problems: 85335
2011 Germany Team Selection Test, 2
Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$
2025 Harvard-MIT Mathematics Tournament, 4
Let $\triangle{ABC}$ be an equilateral triangle with side length $4.$ Across all points $P$ inside triangle $\triangle{ABC}$ satisfying $[PAB]+[PAC]=[PBC],$ compute the minimal possible length of $PA.$
(Here, $[XYZ]$ denotes the area of triangle $\triangle{XYZ}.$)
2021 Argentina National Olympiad, 4
The sum of several positive integers, not necessarily different, all of them less than or equal to $10$, is equal to $S$. We want to distribute all these numbers into two groups such that the sum of the numbers in each group is less than or equal to $80.$ Determine all values ​​of $S$ for which this is possible.
2005 ISI B.Math Entrance Exam, 7
Let $M$ be a point in the triangle $ABC$ such that
\[\text{area}(ABM)=2 \cdot \text{area}(ACM)\]
Show that the locus of all such points is a straight line.
1994 Hong Kong TST, 2
Given that, a function $f(n)$, defined on the natural numbers, satisfies the following conditions: (i)$f(n)=n-12$ if $n>2000$; (ii)$f(n)=f(f(n+16))$ if $n \leq 2000$.
(a) Find $f(n)$.
(b) Find all solutions to $f(n)=n$.
2023 JBMO Shortlist, N1
Find all pairs $(a,b)$ of positive integers such that $a!+b$ and $b!+a$ are both powers of $5$.
[i]Nikola Velov, North Macedonia[/i]
1999 Harvard-MIT Mathematics Tournament, 1
Start with an angle of $60^\circ$ and bisect it, then bisect the lower $30^\circ$ angle, then the upper $15^\circ$ angle, and so on, always alternating between the upper and lower of the previous two angles constructed. This process approaches a limiting line that divides the original $60^\circ$ angle into two angles. Find the measure (degrees) of the smaller angle.
2002 China Team Selection Test, 3
$ n$ sets $ S_1$, $ S_2$ $ \cdots$, $ S_n$ consists of non-negative numbers. $ x_i$ is the sum of all elements of $ S_i$, prove that there is a natural number $ k$, $ 1<k<n$, and:
\[ \sum_{i\equal{}1}^n x_i < \frac{1}{k\plus{}1} \left[ k \cdot \frac{n(n\plus{}1)(2n\plus{}1)}{6} \minus{} (k\plus{}1)^2 \cdot \frac{n(n\plus{}1)}{2} \right]\]
and there exists subscripts $ i$, $ j$, $ t$, and $ l$ (at least $ 3$ of them are distinct) such that $ x_i \plus{} x_j \equal{} x_t \plus{} x_l$.
2023 MOAA, 10
Let $S$ be a set of integers such that if $a$ and $b$ are in $S$ then $3a-2b$ is also in $S$. How many ways are there to construct $S$ such that $S$ contains exactly $4$ elements in the interval $[0,40]$?
[i]Proposed by Harry Kim[/i]
IV Soros Olympiad 1997 - 98 (Russia), 9.7
There are three solutions with different percentages of alcohol. If you mix them in a ratio of $1:2:3$, you get a $20\%$ solution. If you mix them in a ratio of $5: 4: 3,$ you will get a solution with $50\%$ alcohol content. What percentage of alcohol will the solution contain if equal amounts of the original solutions are mixed?
2006 Bulgaria Team Selection Test, 2
a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$.
b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$.
[i]Nikolai Nikolov, Emil Kolev[/i]
2014 Bulgaria National Olympiad, 2
Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board.
[i]Proposed by N. Beluhov[/i]
1998 Putnam, 1
A right circular cone has base of radius 1 and height 3. A cube is inscribed in the cone so that one face of the cube is contained in the base of the cone. What is the side-length of the cube?
1983 IMO Longlists, 18
Let $b \geq 2$ be a positive integer.
(a) Show that for an integer $N$, written in base $b$, to be equal to the sum of the squares of its digits, it is necessary either that $N = 1$ or that $N$ have only two digits.
(b) Give a complete list of all integers not exceeding $50$ that, relative to some base $b$, are equal to the sum of the squares of their digits.
(c) Show that for any base b the number of two-digit integers that are equal to the sum of the squares of their digits is even.
(d) Show that for any odd base $b$ there is an integer other than $1$ that is equal to the sum of the squares of its digits.
2006 AIME Problems, 10
Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumilated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B$. The probability that team $A$ finishes with more points than team $B$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
2023 VIASM Summer Challenge, Problem 2
Given a $20 \times 101$ square table with $20$ rows and $101$ columns. One wants to fill numbers $0$ and $1$ in the unit squares of the table satisfying the following conditions:
$[\text{i}]$ Each square has exactly one number to be filled in.
$[\text{ii}]$ Each column is filled with exactly two $1'$s.
$[\text{iii}]$ Any two rows with no more than one column are filled with two $1'$s.
$a.$ How many ways to fill the numbers satisfying the given conditions?
$b.$ With a satisfied numbering way, we number the rows in order from top to bottom. A triple of row (distinct, unordered) $\{a; b; c\}$ is said to be [i]united[/i] if the sets of numbers in the three rows are $(a_1, a_2, . . . , a_{101}), (b_1, b_2, . . . . , b_{101}),$ and $(c_1, c_2, . . . . , c_{101})$ satisfied$$\sum\limits_{i = 1}^{101} {({a_i}{b_i} + {b_i}{c_i} + {c_i}{a_i})} = 3.$$
Prove that: there are at least $10$ [i]united[/i] sets.
1998 Putnam, 2
Let $s$ be any arc of the unit circle lying entirely in the first quadrant. Let $A$ be the area of the region lying below $s$ and above the $x$-axis and let $B$ be the area of the region lying to the right of the $y$-axis and to the left of $s$. Prove that $A+B$ depends only on the arc length, and not on the position, of $s$.
2016 Iran Team Selection Test, 2
Let $a,b,c,d$ be positive real numbers such that $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}+\frac{1}{d+1}=2$. Prove that $$\sum_{cyc} \sqrt{\frac{a^2+1}{2}} \geq (3.\sum_{cyc} \sqrt{a}) -8$$
2023 Ecuador NMO (OMEC), 4
A number is [i]additive[/i] if it has three digits, all of them are different and the sum of two of the digits is equal to the remaining one. (For example, $123 (1+2=3), 945 (4+5=9)$). Find the sum of all additive numbers.
2024 EGMO, 1
Two different integers $u$ and $v$ are written on a board. We perform a sequence of steps. At each step we do one of the following two operations:
(i) If $a$ and $b$ are different integers on the board, then we can write $a + b$ on the board, if it is not
already there.
(ii) If $a$, $b$ and $c$ are three different integers on the board, and if an integer $x$ satisfies $ax^2 +bx+c = 0$,
then we can write $x$ on the board, if it is not already there.
Determine all pairs of starting numbers $(u, v)$ from which any integer can eventually be written on the board after a finite sequence of steps.
2016 AMC 8, 17
An ATM password at Fred's Bank is composed of four digits from $0$ to $9$, with repeated digits allowable. If no password may begin with the sequence $9,1,1,$ then how many passwords are possible?
$\textbf{(A)}\mbox{ }30\qquad\textbf{(B)}\mbox{ }7290\qquad\textbf{(C)}\mbox{ }9000\qquad\textbf{(D)}\mbox{ }9990\qquad\textbf{(E)}\mbox{ }9999$
2018 HMNT, 7
Ben "One Hunna Dolla" Franklin is flying a kite $KITE$ such that $IE$ is the perpendicular bisector of $KT$. Let $IE$ meet $KT$ at $R$. The midpoints of $KI,IT,TE,EK$ are $A,N,M,D,$ respectively. Given that $[MAKE]=18,IT=10,[RAIN]=4,$ find $[DIME]$.
Note: $[X]$ denotes the area of the figure $X$.
2022 Assara - South Russian Girl's MO, 7
Find out which of the two numbers is greater:
$$\dfrac{2}{2 +\dfrac{2}{2 +\dfrac{2}{... +\dfrac{2}{2+\frac22}}}}
\,\,\, \text{or} \,\,\, \dfrac{3}{3 +\dfrac{3}{3 +\dfrac{3}{... +\dfrac{3}{3+\frac33}}}}$$
(Each expression has $2022$ fraction signs.)
EMCC Speed Rounds, 2011
[i]20 problems for 20 minutes.[/i]
[b]p1.[/b] Euclid eats $\frac17$ of a pie in $7$ seconds. Euler eats $\frac15$ of an identical pie in $10$ seconds. Who eats faster?
[b]p2.[/b] Given that $\pi = 3.1415926...$ , compute the circumference of a circle of radius 1. Express your answer as a decimal rounded to the nearest hundred thousandth (i.e. $1.234562$ and $1.234567$ would be rounded to $1.23456$ and $1.23457$, respectively).
[b]p3.[/b] Alice bikes to Wonderland, which is $6$ miles from her house. Her bicycle has two wheels, and she also keeps a spare tire with her. If each of the three tires must be used for the same number of miles, for how many miles will each tire be used?
[b]p4.[/b] Simplify $\frac{2010 \cdot 2010}{2011}$ to a mixed number. (For example, $2\frac12$ is a mixed number while $\frac52$ and $2.5$ are not.)
[b]p5.[/b] There are currently $175$ problems submitted for $EMC^2$. Chris has submitted $51$ of them. If nobody else submits any more problems, how many more problems must Chris submit so that he has submitted $\frac13$ of the problems?
[b]p6.[/b] As shown in the diagram below, points $D$ and $L$ are located on segment $AK$, with $D$ between $A$ and $L$, such that $\frac{AD}{DK}=\frac{1}{3}$ and $\frac{DL}{LK}=\frac{5}{9}$. What is $\frac{DL}{AK}$?
[img]https://cdn.artofproblemsolving.com/attachments/9/a/3f92bd33ffbe52a735158f7ebca79c4c360d30.png[/img]
[b]p7.[/b] Find the number of possible ways to order the letters $G, G, e, e, e$ such that two neighboring letters are never $G$ and $e$ in that order.
[b]p8.[/b] Find the number of odd composite integers between $0$ and $50$.
[b]p9.[/b] Bob tries to remember his $2$-digit extension number. He knows that the number is divisible by $5$ and that the first digit is odd. How many possibilities are there for this number?
[b]p10.[/b] Al walks $1$ mile due north, then $2$ miles due east, then $3$ miles due south, and then $4$ miles due west. How far, in miles, is he from his starting position? (Assume that the Earth is flat.)
[b]p11.[/b] When n is a positive integer, $n!$ denotes the product of the first $n$ positive integers; that is, $n! = 1 \cdot 2 \cdot 3 \cdot ... \cdot n$. Given that $7! = 5040$, compute $8! + 9! + 10!$.
[b]p12.[/b] Sam's phone company charges him a per-minute charge as well as a connection fee (which is the same for every call) every time he makes a phone call. If Sam was charged $\$4.88$ for an $11$-minute call and $\$6.00$ for a $19$-minute call, how much would he be charged for a $15$-minute call?
[b]p13.[/b] For a positive integer $n$, let $s_n$ be the sum of the n smallest primes. Find the least $n$ such that $s_n$ is a perfect square (the square of an integer).
[b]p14.[/b] Find the remainder when $2011^{2011}$ is divided by $7$.
[b]p15.[/b] Let $a, b, c$, and $d$ be $4$ positive integers, each of which is less than $10$, and let $e$ be their least common multiple. Find the maximum possible value of $e$.
[b]p16.[/b] Evaluate $100 - 1 + 99 - 2 + 98 - 3 + ... + 52 - 49 + 51 - 50$.
[b]p17.[/b] There are $30$ basketball teams in the Phillips Exeter Dorm Basketball League. In how ways can $4$ teams be chosen for a tournament if the two teams Soule Internationals and Abbot United cannot be chosen at the same time?
[b]p18.[/b] The numbers $1, 2, 3, 4, 5, 6$ are randomly written around a circle. What is the probability that there are four neighboring numbers such that the sum of the middle two numbers is less than the sum of the other two?
[b]p19.[/b] What is the largest positive $2$-digit factor of $3^{2^{2011}} - 2^{2^{2011}}$?
[b]p20.[/b] Rhombus $ABCD$ has vertices $A = (-12,-4)$, $B = (6, b)$, $C = (c,-4)$ and $D = (d,-28)$, where $b$, $c$, and $d$ are integers. Find a constant $m$ such that the line y = $mx$ divides the rhombus into two regions of equal area.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2016 Iran MO (3rd Round), 1
Let $p,q$ be prime numbers ($q$ is odd). Prove that there exists an integer $x$ such that:
$$q |(x+1)^p-x^p$$
If and only if $$q \equiv 1 \pmod p$$