Found problems: 1111
1996 Bosnia and Herzegovina Team Selection Test, 6
Let $a$ and $b$ be two integers which are coprime and let $n$ be one variable integer. Determine probability that number of solutions $(x,y)$, where $x$ and $y$ are nonnegative integers, of equation $ax+by=n$ is $\left\lfloor \frac{n}{ab} \right\rfloor + 1$
2013 AIME Problems, 6
Melinda has three empty boxes and $12$ textbooks, three of which are mathematics textbooks. One box will hold any three of her textbooks, one will hold any four of her textbooks, and one will hold any five of her textbooks. If Melinda packs her textbooks into these boxes in random order, the probability that all three mathematics textbooks end up in the same box can be written as $\frac{m}{n}$, where $m$ and $n$ Are relatively prime positive integers. Find $m+n$.
2004 Putnam, B2
Let $m$ and $n$ be positive integers. Show that
$\frac{(m+n)!}{(m+n)^{m+n}} < \frac{m!}{m^m}\cdot\frac{n!}{n^n}$
2001 AIME Problems, 6
A fair die is rolled four times. The probability that each of the final three rolls is at least as large as the roll preceding it may be expressed in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
1989 ITAMO, 5
A fair coin is repeatedly tossed. We receive one marker for every ”head” and two markers for every ”tail”. We win the game if, at some moment, we possess exactly $100$ markers. Is the probability of winning the game greater than, equal to, or less than $2/3$?
2014 BMT Spring, 5
Alice, Bob, and Chris each roll $4$ dice. Each only knows the result of their own roll. Alice claims that there are at least $5$ multiples of $3$ among the dice rolled. Bob has $1$ six and no threes, and knows that Alice wouldn’t claim such a thing unless he had at least $2$ multiples of $3$. Bob can call Alice a liar, or claim that there are at least $6$ multiples of $3$, but Chris says that he will immediately call Bob a liar if he makes this claim. Bob wins if he calls Alice a liar and there aren't at least $5$ multiples of $3$, or if he claims there are at least $6$ multiples of $3$, and there are. What is the probability that Bob loses no matter what he does?
2016 AMC 12/AHSME, 13
Let $N$ be a positive multiple of $5$. One red ball and $N$ green balls are arranged in a line in random order. Let $P(N)$ be the probability that at least $\tfrac{3}{5}$ of the green balls are on the same side of the red ball. Observe that $P(5)=1$ and that $P(N)$ approaches $\tfrac{4}{5}$ as $N$ grows large. What is the sum of the digits of the least value of $N$ such that $P(N) < \tfrac{321}{400}$?
$\textbf{(A) } 12 \qquad \textbf{(B) } 14 \qquad \textbf{(C) }16 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 20$
2010 Contests, 2
Jane has two bags $X$ and $Y$. Bag $X$ contains 4 red marbles and 5 blue marbles (and nothing else). Bag $Y$ contains 7 red marbles and 6 blue marbles (and nothing else). Jane will choose one of her bags at random (each bag being equally likely). From her chosen bag, she will then select one of the marbles at random (each marble in that bag being equally likely). What is the probability that she will select a red marble?
2004 AIME Problems, 10
A circle of radius 1 is randomly placed in a 15-by-36 rectangle $ABCD$ so that the circle lies completely within the rectangle. Given that the probability that the circle will not touch diagonal $AC$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
2011 AIME Problems, 12
Nine delegates, three each from three different countries, randomly select chairs at a round table that seats nine people. Let the probability that each delegate sits next to at least one delegate from another country be $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
2005 Vietnam Team Selection Test, 2
Given $n$ chairs around a circle which are marked with numbers from 1 to $n$ .There are $k$, $k \leq 4 \cdot n$ students sitting on those chairs .Two students are called neighbours if there is no student sitting between them. Between two neighbours students ,there are at less 3 chairs. Find the number of choices of $k$ chairs so that $k$ students can sit on those and the condition is satisfied.
2007 District Olympiad, 2
Let $f : \left[ 0, 1 \right] \to \mathbb R$ be a continuous function and $g : \left[ 0, 1 \right] \to \left( 0, \infty \right)$.
Prove that if $f$ is increasing, then
\[\int_{0}^{t}f(x) g(x) \, dx \cdot \int_{0}^{1}g(x) \, dx \leq \int_{0}^{t}g(x) \, dx \cdot \int_{0}^{1}f(x) g(x) \, dx .\]
2024 Bulgarian Autumn Math Competition, 12.4
Let $L$ be a figure made of $3$ squares, a right isosceles triangle and a quarter circle (all unit sized) as shown below: [img]https://wiki-images.artofproblemsolving.com//f/f9/Weirwiueripo.png[/img]
Prove that any $18$ points in the plane can be covered with copies of $L$, which don't overlap (copies of $L$ may be rotated or flipped)
2010 USAMO, 6
A blackboard contains 68 pairs of nonzero integers. Suppose that for each positive integer $k$ at most one of the pairs $(k, k)$ and $(-k, -k)$ is written on the blackboard. A student erases some of the 136 integers, subject to the condition that no two erased integers may add to 0. The student then scores one point for each of the 68 pairs in which at least one integer is erased. Determine, with proof, the largest number $N$ of points that the student can guarantee to score regardless of which 68 pairs have been written on the board.
2008 AMC 10, 20
The faces of a cubical die are marked with the numbers $ 1$, $ 2$, $ 2$, $ 3$, $ 3$, and $ 4$. The faces of a second cubical die are marked with the numbers $ 1$, $ 3$, $ 4$, $ 5$, $ 6$, and $ 8$. Both dice are thrown. What is the probability that the sum of the two top numbers will be $ 5$, $ 7$, or $ 9$ ?
$ \textbf{(A)}\ \frac {5}{18} \qquad \textbf{(B)}\ \frac {7}{18} \qquad \textbf{(C)}\ \frac {11}{18} \qquad \textbf{(D)}\ \frac {3}{4} \qquad \textbf{(E)}\ \frac {8}{9}$
2006 Putnam, A4
Let $S=\{1,2\dots,n\}$ for some integer $n>1.$ Say a permutation $\pi$ of $S$ has a local maximum at $k\in S$ if
\[\begin{array}{ccc}\text{(i)}&\pi(k)>\pi(k+1)&\text{for }k=1\\ \text{(ii)}&\pi(k-1)<\pi(k)\text{ and }\pi(k)>\pi(k+1)&\text{for }1<k<n\\ \text{(iii)}&\pi(k-1)M\pi(k)&\text{for }k=n\end{array}\]
(For example, if $n=5$ and $\pi$ takes values at $1,2,3,4,5$ of $2,1,4,5,3,$ then $\pi$ has a local maximum of $2$ as $k=1,$ and a local maximum at $k-4.$)
What is the average number of local maxima of a permutation of $S,$ averaging over all permuatations of $S?$
2020 Putnam, B3
Let $x_0=1$, and let $\delta$ be some constant satisfying $0<\delta<1$. Iteratively, for $n=0,1,2,\dots$, a point $x_{n+1}$ is chosen uniformly form the interval $[0,x_n]$. Let $Z$ be the smallest value of $n$ for which $x_n<\delta$. Find the expected value of $Z$, as a function of $\delta$.
2018 Costa Rica - Final Round, LRP5
The Matini company released a special album with the flags of the $ 12$ countries that compete in the CONCACAM Mathematics Cup. Each postcard envelope has two flags chosen randomly. Determine the minimum number of envelopes that need to be opened to that the probability of having a repeated flag is $50\%$.
1992 ITAMO, 4
A jury of $9$ persons should decide whether a verdict is guilty or not. Each juror votes independently with the probability $1/2$ for each of the two possibilities, and noone is allowed to be abstinent. Find the probability that a fixed juror will be a part of the majority. In the case of a jury of $n$ persons, find the values of n for which the probability of being a part of the majority is greater than, equal to, and smaller than $1/2$, respectively. (For $n = 2k$, $k +1$ votes are needed for a majority.)
1999 Federal Competition For Advanced Students, Part 2, 3
Find all pairs $(x, y)$ of real numbers such that
\[y^2 - [x]^2 = 19.99 \text{ and } x^2 + [y]^2 = 1999\]
where $f(x)=[x]$ is the floor function.
2006 AMC 12/AHSME, 24
Let $ S$ be the set of all points $ (x,y)$ in the coordinate plane such that $ 0\le x\le \frac \pi2$ and $ 0\le y\le \frac \pi2$. What is the area of the subset of $ S$ for which
\[ \sin^2 x \minus{} \sin x\sin y \plus{} \sin^2 y\le \frac 34?
\]$ \textbf{(A) } \frac {\pi^2}9 \qquad \textbf{(B) } \frac {\pi^2}8 \qquad \textbf{(C) } \frac {\pi^2}6\qquad \textbf{(D) } \frac {3\pi^2}{16} \qquad \textbf{(E) } \frac {2\pi^2}9$
2010 AMC 10, 18
Bernardo randomly picks $ 3$ distinct numbers from the set $ \{1,2,3,4,5,6,7,8,9\}$ and arranges them in descending order to form a $ 3$-digit number. Silvia randomly picks $ 3$ distinct numbers from the set $ \{1,2,3,4,5,6,7,8\}$ and also arranges them in descending order to form a $ 3$-digit number. What is the probability that Bernardo's number is larger than Silvia's number?
$ \textbf{(A)}\ \frac {47}{72}\qquad
\textbf{(B)}\ \frac {37}{56}\qquad
\textbf{(C)}\ \frac {2}{3}\qquad
\textbf{(D)}\ \frac {49}{72}\qquad
\textbf{(E)}\ \frac {39}{56}$
1988 IMO Longlists, 81
There are $ n \geq 3$ job openings at a factory, ranked $1$ to $ n$ in order of increasing pay. There are $ n$ job applicants, ranked from $1$ to $ n$ in order of increasing ability. Applicant $ i$ is qualified for job $ j$ if and only if $ i \geq j.$ The applicants arrive one at a time in random order. Each in turn is hired to the highest-ranking job for which he or she is qualified AND which is lower in rank than any job already filled. (Under these rules, job $1$ is always filled, and hiring terminates thereafter.) Show that applicants $ n$ and $ n \minus{} 1$ have the same probability of being hired.
2014 NIMO Problems, 6
Bob is making partitions of $10$, but he hates even numbers, so he splits $10$ up in a special way. He starts with $10$, and at each step he takes every even number in the partition and replaces it with a random pair of two smaller positive integers that sum to that even integer. For example, $6$ could be replaced with $1+5$, $2+4$, or $3+3$ all with equal probability. He terminates this process when all the numbers in his list are odd. The expected number of integers in his list at the end can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$.
[i]Proposed by Michael Ren[/i]
2015 AMC 10, 18
Johann has $64$ fair coins. He flips all the coins. Any coin that lands on tails is tossed again. Coins that land on tails on the second toss are tossed a third time. What is the expected number of coins that are now heads?
$\textbf{(A) } 32
\qquad\textbf{(B) } 40
\qquad\textbf{(C) } 48
\qquad\textbf{(D) } 56
\qquad\textbf{(E) } 64
$