Found problems: 85335
2014 Harvard-MIT Mathematics Tournament, 9
Compute the side length of the largest cube contained in the region
\[ \{(x, y, z) : x^2+y^2+z^2 \le 25 \text{ and } x, y \ge 0 \} \]
of three-dimensional space.
DMM Individual Rounds, 2011 Tie
[b]p1.[/b] $2011$ distinct points are arranged along the perimeter of a circle. We choose without replacement four points $P$, $Q$, $R$, $S$. What is the probability that no two of the segments $P Q$, $QR$, $RS$, $SP$ intersect (disregarding the endpoints)?
[b]p2.[/b] In Soviet Russia, all phone numbers are between three and six digits and contain only the digits $1$, $2$, and $3$. No phone number may be the prefix of another phone number, so, for example, we cannot have the phone numbers $123$ and $12332$. If the Soviet bureaucracy has preassigned $10$ phone numbers of length $3$, $20$ numbers of length $4$, and $77$ phone numbers of length $6$, what is the maximum number of phone numbers of length $5$ that the authorities can allocate?
[b]p3.[/b] The sequence $\{a_n\}_{n\ge 1}$ is defined as follows: we have $a_1 = 1$, $a_2 = 0$, and for $n \ge 3$ we have $$a_n = \frac12 \sum\limits_{\substack{1\le i,j\\ i+j+k=n}} a_ia_ja_k.$$
Find $$\sum^{\infty}_{n=1} \frac{a_n}{2^n}$$
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2018 AMC 12/AHSME, 19
Mary chose an even $4$-digit number $n$. She wrote down all the divisors of $n$ in increasing order from left to right: $1,2,...,\tfrac{n}{2},n$. At some moment Mary wrote $323$ as a divisor of $n$. What is the smallest possible value of the next divisor written to the right of $323$?
$\textbf{(A) } 324 \qquad \textbf{(B) } 330 \qquad \textbf{(C) } 340 \qquad \textbf{(D) } 361 \qquad \textbf{(E) } 646$
2012 India Regional Mathematical Olympiad, 2
Let $a,b,c$ be positive integers such that $a|b^5, b|c^5$ and $c|a^5$. Prove that $abc|(a+b+c)^{31}$.
1975 Dutch Mathematical Olympiad, 2
Let $T = \{n \in N|$n consists of $2$ digits $\}$ and $$P = \{x|x = n(n + 1)... (n + 7); n,n + 1,..., n + 7 \in T\}.$$
Determine the gcd of the elements of $P$.
2014 NIMO Problems, 3
The numbers $1,2,\dots,10$ are written on a board. Every minute, one can select three numbers $a$, $b$, $c$ on the board, erase them, and write $\sqrt{a^2+b^2+c^2}$ in their place. This process continues until no more numbers can be erased. What is the largest possible number that can remain on the board at this point?
[i]Proposed by Evan Chen[/i]
2003 Vietnam Team Selection Test, 2
Given a triangle $ABC$. Let $O$ be the circumcenter of this triangle $ABC$. Let $H$, $K$, $L$ be the feet of the altitudes of triangle $ABC$ from the vertices $A$, $B$, $C$, respectively. Denote by $A_{0}$, $B_{0}$, $C_{0}$ the midpoints of these altitudes $AH$, $BK$, $CL$, respectively. The incircle of triangle $ABC$ has center $I$ and touches the sides $BC$, $CA$, $AB$ at the points $D$, $E$, $F$, respectively. Prove that the four lines $A_{0}D$, $B_{0}E$, $C_{0}F$ and $OI$ are concurrent. (When the point $O$ concides with $I$, we consider the line $OI$ as an arbitrary line passing through $O$.)
2022 Putnam, A6
Let $n$ be a positive integer. Determine, in terms of $n,$ the largest integer $m$ with the following property: There exist real numbers $x_1,\ldots, x_{2n}$ with $-1<x_1<x_2<\ldots<x_{2n}<1$ such that the sum of the lengths of the $n$ intervals $$[x_1^{2k-1},x_2^{2k-1}], [x_3^{2k-1},x_4^{2k-1}], \ldots, [x_{2n-1}^{2k-1},x_{2n}^{2k-1}]$$ is equal to 1 for all integers $k$ with $1\leq k \leq m.$
2003 AIME Problems, 15
In $\triangle ABC$, $AB = 360$, $BC = 507$, and $CA = 780$. Let $M$ be the midpoint of $\overline{CA}$, and let $D$ be the point on $\overline{CA}$ such that $\overline{BD}$ bisects angle $ABC$. Let $F$ be the point on $\overline{BC}$ such that $\overline{DF} \perp \overline{BD}$. Suppose that $\overline{DF}$ meets $\overline{BM}$ at $E$. The ratio $DE: EF$ can be written in the form $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
2014 Purple Comet Problems, 19
Let $n$ be a positive integer such that $\lfloor\sqrt n\rfloor-2$ divides $n-4$ and $\lfloor\sqrt n\rfloor+2$ divides $n+4$. Find the greatest such $n$ less than $1000$. (Note: $\lfloor x\rfloor$ refers to the greatest integer less than or equal to $x$.)
2016 BMT Spring, 10
An $m \times n$ rectangle is tiled with $\frac{mn}{2}$ $1 \times 2$ dominoes. The tiling is such that whenever the rectangle is partitioned into two smaller rectangles, there exists a domino that is part of the interior of both rectangles. Given $mn > 2$, what is the minimum possible value of $mn$?
For instance, the following tiling of a $4 \times 3$ rectangle doesn’t work because we can partition along the line shown, but that doesn’t necessarily mean other $4 \times 3$ tilings don’t work.
[img]https://cdn.artofproblemsolving.com/attachments/d/3/cb1fed407e45463950542b3cc64185892afdc5.png[/img]
2006 AMC 12/AHSME, 12
The parabola $ y \equal{} ax^2 \plus{} bx \plus{} c$ has vertex $ (p,p)$ and $ y$-intercept $ (0, \minus{} p)$, where $ p\neq 0$. What is $ b$?
$ \textbf{(A) } \minus{} p \qquad \textbf{(B) } 0 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } p$
the 3rd XMO, 2
$ABCD$ is inscribed in unit circle $\Gamma$. Let $\Omega_1$, $\Omega_2$ be the circumcircles of $\vartriangle ABD$, $\vartriangle CBD$ respectively. Circles $\Omega_1$, $\Omega_2$ are tangent to segment $BD$ at $M$,$N$ respectively. Line A$M$ intersects $\Gamma$, $\Omega_1$ again at points $X_1$,$X_2$ respectively (different from $A$, $M$). Let $\omega_1$ be the circle passing through $X_1$, $X_2$ and tangent to $\Omega_1$. Line $CN$ intersects $\Gamma$, $\Omega_2$ again at points $Y_1$, $Y_2$ respectively (different from $C$, $N$). Let $\omega_2$ be the circle passing through $Y_1$, $Y_2$ and tangent to $\Omega_2$. Circles $\Omega_1$,$\Omega_2$, $\omega_1$, $\omega_2$ have radii $R_1$, $R_2$, $r_1$, $r_2$ respectively. Prove that $$r_1+r_2-R_1-R_2=1.$$
[img]https://cdn.artofproblemsolving.com/attachments/1/5/70471f2419fadc4b2183f5fe74f0c7a2e69ed4.png[/img]
[url=https://www.geogebra.org/m/vxx8ghww]geogebra file[/url]
2012 India Regional Mathematical Olympiad, 6
Let $S$ be the set $\{1, 2, ..., 10\}$. Let $A$ be a subset of $S$.
We arrange the elements of $A$ in increasing order, that is, $A = \{a_1, a_2, ...., a_k\}$ with $a_1 < a_2 < ... < a_k$.
Define [i]WSUM [/i] for this subset as $3(a_1 + a_3 +..) + 2(a_2 + a_4 +...)$ where the first term contains the odd numbered terms and the second the even numbered terms.
(For example, if $A = \{2, 5, 7, 8\}$, [i]WSUM [/i] is $3(2 + 7) + 2(5 + 8)$.)
Find the sum of [i]WSUMs[/i] over all the subsets of S.
(Assume that WSUM for the null set is $0$.)
2014 Tournament of Towns., 5
Ali Baba and the $40$ thieves want to cross Bosporus strait. They made a line so that any two people standing next to each other are friends. Ali Baba is the first, he is also a friend with the thief next to his neighbour. There is a single
boat that can carry $2$ or $3$ people and these people must be friends. Can Ali Baba and the $40$ thieves always cross the strait if a single person cannot sail?
2021 XVII International Zhautykov Olympiad, #5
On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.
1997 Taiwan National Olympiad, 3
Let $n>2$ be an integer. Suppose that $a_{1},a_{2},...,a_{n}$ are real numbers such that $k_{i}=\frac{a_{i-1}+a_{i+1}}{a_{i}}$ is a positive integer for all $i$(Here $a_{0}=a_{n},a_{n+1}=a_{1}$). Prove that $2n\leq a_{1}+a_{2}+...+a_{n}\leq 3n$.
2008 Singapore MO Open, 4
let $0<a,b<\pi/2$. Show that
$\frac{5}{cos^2(a)}+\frac{5}{sin^2(a)sin^2(b)cos^2(b)} \geq 27cos(a)+36sin(a) $
2019 Regional Olympiad of Mexico Center Zone, 1
Let $a$, $b$, and $c $ be integers greater than zero. Show that the numbers $$2a ^ 2 + b ^ 2 + 3 \,\,, 2b ^ 2 + c ^ 2 + 3\,\,, 2c ^ 2 + a ^ 2 + 3 $$ cannot be all perfect squares.
2008 ITest, 22
Tony plays a game in which he takes $40$ nickels out of a roll and tosses them one at a time toward his desk where his change jar sits. He awards himself $5$ points for each nickel that lands in the jar, and takes away $2$ points from his score for each nickel that hits the ground. After Tony is done tossing all $40$ nickels, he computes $88$ as his score. Find the greatest number of nickels he could have successfully tossed into the jar.
2019 Harvard-MIT Mathematics Tournament, 9
How many ways can you fill a $3 \times 3$ square grid with nonnegative integers such that no [i]nonzero[/i] integer appears more than once in the same row or column and the sum of the numbers in every row and column equals 7?
1977 Yugoslav Team Selection Test, Problem 3
Assume that the equality $2BC=AB+AC$ holds in $\triangle ABC$. Prove that:
(a) The vertex $A$, the midpoints $M$ and $N$ of $AB$ and $AC$ respectively, the incenter $I$, and the circumcenter $O$ belong to a circle $k$.
(b) The line $GI$, where $G$ is the centroid of $\triangle ABC$ is a tangent to $k$.
2012 Harvard-MIT Mathematics Tournament, 5
A mouse lives in a circular cage with completely reflective walls. At the edge of this cage, a small flashlight with vertex on the circle whose beam forms an angle of $15^o$ is centered at an angle of $37.5^o$ away from the center. The mouse will die in the dark. What fraction of the total area of the cage can keep the mouse alive?
[img]https://cdn.artofproblemsolving.com/attachments/1/c/283276058b7b2c85a95976743c5188ee8ee008.png[/img]
2016 NZMOC Camp Selection Problems, 5
Find all polynomials $P(x)$ with real coefficients such that the polynomial $$Q(x) = (x + 1)P(x-1) -(x-1)P(x)$$ is constant.
2008 Purple Comet Problems, 1
What is the least positive integer with the property that the product of its digits is $9! ?$