Found problems: 85335
2012 AMC 10, 14
Two equilateral triangles are contained in a square whose side length is $2\sqrt3$. The bases of these triangles are the opposite sides of the square, and their intersection is a rhombus. What is the area of the rhombus?
$ \textbf{(A)}\ \frac{3}{2}\qquad\textbf{(B)}\ \sqrt3\qquad\textbf{(C)}\ 2\sqrt2-1\qquad\textbf{(D)}\ 8\sqrt3-12\qquad\textbf{(E)}\ \frac{4\sqrt3}{3}$
2011 USAMTS Problems, 5
Let $k>2$ be a positive integer. Elise and Xavier play a game that has four steps, in this order.
[list=1]
[*]Elise picks $2$ nonzero digits $(1-9)$, called $e$ and $f$.
[*]Xavier then picks $k$ nonzero digits $(1-9)$, called $x_1,\cdots,x_k$.
[*]Elise picks any positive integer $d$.
[*]Xaiver picks an integer $b>10$.[/list]
Each player's choices are known to the other player when the choices are made.
The winner is determined as follows. Elise writes down the two-digit base $b$ number $ef_b$. Next, Xavier writes the $k$-digit base $b$ number that is constructed by concatenating his digits,
\[(x_1\cdots x_k)_b.\]
They then compute the greatest common divisor (gcd) of these two numbers. If this gcd is greater than or equal to the integer $d$ then Xavier wins. Otherwise Elise wins.
(As an example game for $k=3$, Elise chooses the digits $(e, f) = (2, 4)$, Xavier chooses $(4, 4, 8)$, and then Elise picks $d = 100$. Xavier picks base $b = 25$. The base-25 numbers $2425$ and $44825$ are, respectively, equal to $54$ and $2608$. The greatest common divisor of these two is $2$, which is much less than $100$, so Elise wins handily.)
Find all $k$ for which Xavier can force a win, no matter how Elise plays.
2022 Saudi Arabia BMO + EGMO TST, p1
By $rad(x)$ we denote the product of all distinct prime factors of a positive integer $n$. Given $a \in N$, a sequence $(a_n)$ is defined by $a_0 = a$ and $a_{n+1} = a_n+rad(a_n)$ for all $n \ge 0$. Prove that there exists an index $n$ for which $\frac{a_n}{rad(a_n)} = 2022$
1978 Austrian-Polish Competition, 7
Let $M$ be the set of all lattice points in the plane (i.e. points with integer coordinates, in a fixed Cartesian coordinate system). For any point $P=(x,y)\in M$ we call the points $(x-1,y)$, $(x+1,y)$, $(x,y-1)$, $(x,y+1)$ neighbors of $P$. Let $S$ be a finite subset of $M$. A one-to-one mapping $f$ of $S$ onto $S$ is called perfect if $f(P)$ is a neighbor of $P$, for any $P\in S$. Prove that if such a mapping exists, then there exists also a perfect mapping $g:S\to S$ with the additional property $g(g(P))=P$ for $P\in S$.
2003 AIME Problems, 10
Triangle $ABC$ is isosceles with $AC = BC$ and $\angle ACB = 106^\circ$. Point $M$ is in the interior of the triangle so that $\angle MAC = 7^\circ$ and $\angle MCA = 23^\circ$. Find the number of degrees in $\angle CMB$.
2012 China Team Selection Test, 1
In an acute-angled $ABC$, $\angle A>60^{\circ}$, $H$ is its orthocenter. $M,N$ are two points on $AB,AC$ respectively, such that $\angle HMB=\angle HNC=60^{\circ}$. Let $O$ be the circumcenter of triangle $HMN$. $D$ is a point on the same side with $A$ of $BC$ such that $\triangle DBC$ is an equilateral triangle. Prove that $H,O,D$ are collinear.
2021 MOAA, 5
Joshua rolls two dice and records the product of the numbers face up. The probability that this product is composite can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$.
[i]Proposed by Nathan Xiong[/i]
2001 China Team Selection Test, 2.1
Let the vertex set \( V \) of a graph be partitioned into \( h \) parts \( (V = V_1 \cup V_2 \cup \cdots \cup V_h) \), with \(|V_1| = n_1, |V_2| = n_2, \ldots, |V_h| = n_h \). If there is an edge between any two vertices only when they belong to different parts, the graph is called a complete \( h \)-partite graph, denoted as \( k(n_1, n_2, \ldots, n_h) \). Let \( n \) and \( r \) be positive integers, \( n \geq 6 \), \( r \leq \frac{2}{3}n \). Consider the complete \( r + 1 \)-partite graph \( k\left(\underbrace{1, 1, \ldots, 1}_{r}, n - r\right) \).
Answer the following questions:
1. Find the maximum number of disjoint circles (i.e., circles with no common vertices) in this complete \( r + 1 \)-partite graph.
2. Given \( n \), for all \( r \leq \frac{2}{3}n \), find the maximum number of edges in a complete \( r + 1 \)-partite graph \( k(1, 1, \ldots, 1, n - r) \) where no more than one circle is disjoint.
1966 AMC 12/AHSME, 16
If $\frac{4^x}{2^{x+y}}=8$ and $\frac{9^{x+y}}{3^{5y}}=243$, $x$ and $y$ are real numbers, then $xy$ equals:
$\text{(A)} \ \frac{12}{5} \qquad \text{(B)} \ 4 \qquad \text{(C)} \ 6 \qquad \text{(D)} \ 12 \qquad \text{(E)} \ -4$
2023 Dutch BxMO TST, 3
We play a game of musical chairs with $n$ chairs numbered $1$ to $n$. You attach $n$ leaves, numbered $1$ to $n$, to the chairs in such a way that the number on a leaf does not match the number on the chair it is attached to. One player sits on each chair. Every time you clap, each player looks at the number on the leaf attached to his current seat and moves to sit on the seat with that number. Prove that, for any $m$ that is not a prime power with$ 1 < m \leq n$, it is possible to attach the leaves to the seats in such a way that after $m$ claps everyone has returned to the chair they started on for the first time.
2020 Balkan MO, 3
Let $k$ be a positive integer. Determine the least positive integer $n$, with $n\geq k+1$, for which the game below can be played indefinitely:
Consider $n$ boxes, labelled $b_1,b_2,...,b_n$. For each index $i$, box $b_i$ contains exactly $i$ coins. At each step, the following three substeps are performed in order:
[b](1)[/b] Choose $k+1$ boxes;
[b](2)[/b] Of these $k+1$ boxes, choose $k$ and remove at least half of the coins from each, and add to the remaining box, if labelled $b_i$, a number of $i$ coins.
[b](3)[/b] If one of the boxes is left empty, the game ends; otherwise, go to the next step.
[i]Proposed by Demetres Christofides, Cyprus[/i]
IV Soros Olympiad 1997 - 98 (Russia), 10.3
Three different digits were used to create three different three-digit numbers forming an arithmetic progression. (In each number, all the digits are different.) What is the largest difference in this progression?
2020-2021 OMMC, 5
Two points $A, B$ are randomly chosen on a circle with radius $100.$ For a positive integer $x$, denote $P(x)$ as the probability that the length of $AB$ is less than $x$. Find the minimum possible integer value of $x$ such that $\text{P}(x) > \frac{2}{3}$.
2023 Yasinsky Geometry Olympiad, 1
In triangle $ABC$, let points $M$ and $N$ be the midpoints of sides $AB$ and $BC$ respectively. It is known that the perimeter of the triangle $MBN$ is $12$ cm, and the perimeter of the quadrilateral $AMNC$ is $20$ cm. Find the length of the segment $MN$.
2008 Stars Of Mathematics, 1
Let $ P(x) \in \mathbb{Z}[x]$ be a polynomial of degree $ \text{deg} P \equal{} n > 1$. Determine the largest number of consecutive integers to be found in $ P(\mathbb{Z})$.
[i]B. Berceanu[/i]
2019 CMIMC, 8
Consider the following three lines in the Cartesian plane: $$\begin{cases}
\ell_1: & 2x - y = 7\\
\ell_2: & 5x + y = 42\\
\ell_3: & x + y = 14
\end{cases}$$
and let $f_i(P)$ correspond to the reflection of the point $P$ across $\ell_i$. Suppose $X$ and $Y$ are points on the $x$ and $y$ axes, respectively, such that $f_1(f_2(f_3(X)))= Y$. Let $t$ be the length of segment $XY$; what is the sum of all possible values of $t^2$?
1979 Kurschak Competition, 1
The base of a convex pyramid has an odd number of edges. The lateral edges of the pyramid are all equal, and the angles between neighbouring faces are all equal. Show that the base must be a regular polygon.
2020 Princeton University Math Competition, A8
What is the smallest integer $a_0$ such that, for every positive integer $n$, there exists a sequence of positive integers $a_0, a_1, ..., a_{n-1}, a_n$ such that the first $n-1$ are all distinct, $a_0 = a_n$, and for $0 \le i \le n -1$, $a_i^{a_{i+1}}$ ends in the digits $\overline{0a_i}$ when expressed without leading zeros in base $10$.
1999 Romania National Olympiad, 3
Let $ABCDA'B'C'D'$ be a right parallelepiped, $E$ and $F$ the projections of $A$ on the lines $A'D$, $A'C$, respectively, and $P, Q$ the projections of $B'$ on the lines $A'C'$ and $A'C$ Prove that
a) the planes $(AEF)$ and $(B'PQ)$ are parallel
b) the triangles $AEF$ and $B'PQ$ are similar.
MOAA Team Rounds, TO1
The number $2020$ has three different prime factors. What is their sum?
2021 BMT, 3
How many distinct sums can be made from adding together exactly 8 numbers that are chosen from the set $\{ 1,4,7,10 \}$, where each number in the set is chosen at least once? (For example, one possible sum is $1+1+1+4+7+7+10+10=41$.)
2017 APMO, 3
Let $A(n)$ denote the number of sequences $a_1\ge a_2\ge\cdots{}\ge a_k$ of positive integers for which $a_1+\cdots{}+a_k = n$ and each $a_i +1$ is a power of two $(i = 1,2,\cdots{},k)$. Let $B(n)$ denote the number of sequences $b_1\ge b_2\ge \cdots{}\ge b_m$ of positive integers for which $b_1+\cdots{}+b_m =n$ and each inequality $b_j\ge 2b_{j+1}$ holds $(j=1,2,\cdots{}, m-1)$. Prove that $A(n) = B(n)$ for every positive integer $n$.
[i]Senior Problems Committee of the Australian Mathematical Olympiad Committee[/i]
2024 AMC 10, 3
What is the sum of the digits of the smallest prime that can be written as a sum of $5$ distinct primes?
$\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$
2025 Kosovo National Mathematical Olympiad`, P4
Let $ABC$ be a given triangle. Let $A_1$ and $A_2$ be points on the side $BC$. Let $B_1$ and $B_2$ be points on the side $CA$. Let $C_1$ and $C_2$ be points on the side $AB$. Suppose that the points $A_1,A_2,B_1,B_2,C_1$ and $C_2$ lie on a circle. Prove that the lines $AA_1, BB_1$ and $CC_1$ are concurrent if and only if $AA_2, BB_2$ and $CC_2$ are concurrent.
2018 Iran Team Selection Test, 6
A simple graph is called "divisibility", if it's possible to put distinct numbers on its vertices such that there is an edge between two vertices if and only if number of one of its vertices is divisible by another one.
A simple graph is called "permutationary", if it's possible to put numbers $1,2,...,n$ on its vertices and there is a permutation $ \pi $ such that there is an edge between vertices $i,j$ if and only if $i>j$ and $\pi(i)< \pi(j)$ (it's not directed!)
Prove that a simple graph is permutationary if and only if its complement and itself are divisibility.
[i]Proposed by Morteza Saghafian[/i]
.