Found problems: 1111
1993 Greece National Olympiad, 11
Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n$, where $m$ and $n$ are relatively prime positive integers. What are the last three digits of $m + n$?
1993 Spain Mathematical Olympiad, 6
A game in a casino uses the diagram shown. At the start a ball appears at $S$. Each time the player presses a button, the ball moves to one of the adjacent letters with equal probability. The game ends when one of the following two things happens:
(i) The ball returns to $S$, the player loses.
(ii) The ball reaches $G$, the player wins.
Find the probability that the player wins and the expected duration of a game.
2017 AMC 10, 15
Chloé chooses a real number uniformly at random from the interval $[0, 2017]$. Independently, Laurent chooses a real number uniformly at random from the interval $[0,4034]$. What is the probability that Laurent's number is greater than Chloé's number?
$\textbf{(A)}~\frac12 \qquad
\textbf{(B)}~\frac23 \qquad
\textbf{(C)}~\frac34 \qquad
\textbf{(D)}~\frac56\qquad
\textbf{(E)}~\frac78$
2007 AMC 10, 19
The wheel shown is spun twice, and the randomly determined numbers opposite the pointer are recorded. The first number is divided by $ 4$, and the second number is divided by $ 5$. The first remainder designates a column, and the second remainder designates a row on the checkerboard shown. What is the probability that the pair of numbers designates a shaded square?
[asy]unitsize(1.5cm);
defaultpen(linewidth(.8pt)+fontsize(15pt));
draw(Circle(origin,1));
for(int i = 0;i < 6; ++i)
{
draw(origin--dir(60i+30));
}
label("$7$",midpoint(origin--(dir(0))),E);
label("$1$",midpoint(origin--(dir(60))),NE);
label("$6$",midpoint(origin--(dir(120))),NW);
label("$3$",midpoint(origin--(dir(180))),W);
label("$9$",midpoint(origin--(dir(240))),SW);
label("$2$",midpoint(origin--(dir(300))),SE);
draw((2,0)--(3.5,0)--(3.5,1)--(2,1)--cycle);
draw((2,0)--(3.5,0)--(3.5,-1)--(2,-1)--cycle);
pair[] V = {(2.5,0.5),(2,0),(3,0),(2.5,-0.5),(2,-1),(3,-1)};
for(int i = 0; i <= 5; ++i)
{
pair A = V[i];
path p = A--(A.x,A.y + 0.5)--(A.x + 0.5,A.y + 0.5)--(A.x + 0.5, A.y)--cycle;
fill(p,mediumgray);
draw(p);
}
path pointer = (-2.5,-0.125)--(-2.5,0.125)--(-1.2,0.125)--(-1.05,0)--(-1.2,-0.125)--cycle;
fill(pointer,mediumgray);
draw(pointer);
label("Pointer",(-1.85,0),fontsize(10pt));
label("$4$",(2,0.5),2N + 2W);
label("$3$",(2,0),2N + 2W);
label("$2$",(2,-0.5),2N + 2W);
label("$1$",(2,-1),2N + 2W);
label("$1$",(2,-1),2S + 2E);
label("$2$",(2.5,-1),2S + 2E);
label("$3$",(3,-1),2S + 2E);[/asy]$ \textbf{(A)}\ \frac {1}{3}\qquad \textbf{(B)}\ \frac {4}{9}\qquad \textbf{(C)}\ \frac {1}{2}\qquad \textbf{(D)}\ \frac {5}{9}\qquad \textbf{(E)}\ \frac {2}{3}$
2014 Harvard-MIT Mathematics Tournament, 2
[4] Let $x_1,x_2,\ldots,x_{100}$ be defined so that for each $i$, $x_i$ is a (uniformly) random integer between $1$ and $6$ inclusive. Find the expected number of integers in the set $\{x_1,x_1+x_2,\ldots,x_1+x_2+\cdots+x_{100}\}$ that are multiples of $6$.
2020 AMC 10, 18
An urn contains one red ball and one blue ball. A box of extra red and blue balls lie nearby. George performs the following operation four times: he draws a ball from the urn at random and then takes a ball of the same color from the box and returns those two matching balls to the urn. After the four iterations the urn contains six balls. What is the probability that the urn contains three balls of each color?
$\textbf{(A) } \frac16 \qquad \textbf{(B) }\frac15 \qquad \textbf{(C) } \frac14 \qquad \textbf{(D) } \frac13 \qquad \textbf{(E) } \frac12$
2002 Finnish National High School Mathematics Competition, 3
$n$ pairs are formed from $n$ girls and $n$ boys at random.
What is the probability of having at least one pair of girls? For which $n$ the probability is over $0,9?$
2011 USAMTS Problems, 2
Four siblings are sitting down to eat some mashed potatoes for lunch: Ethan has 1 ounce of mashed potatoes, Macey has 2 ounces, Liana has 4 ounces, and Samuel has 8 ounces. This is not fair. A blend consists of choosing any two children at random, combining their plates of mashed potatoes, and then giving each of those two children half of the combination. After the children's father performs four blends consecutively, what is the probability that the four children will all have the same amount of mashed potatoes?
1999 Romania Team Selection Test, 16
Let $X$ be a set with $n$ elements, and let $A_{1}$, $A_{2}$, ..., $A_{m}$ be subsets of $X$ such that:
1) $|A_{i}|=3$ for every $i\in\left\{1,2,...,m\right\}$;
2) $|A_{i}\cap A_{j}|\leq 1$ for all $i,j\in\left\{1,2,...,m\right\}$ such that $i \neq j$.
Prove that there exists a subset $A$ of $X$ such that $A$ has at least $\left[\sqrt{2n}\right]$ elements, and for every $i\in\left\{1,2,...,m\right\}$, the set $A$ does not contain $A_{i}$.
[i]Alternative formulation.[/i] Let $X$ be a finite set with $n$ elements and $A_{1},A_{2},\ldots, A_{m}$ be three-elements subsets of $X$, such that $|A_{i}\cap A_{j}|\leq 1$, for every $i\neq j$. Prove that there exists $A\subseteq X$ with $|A|\geq \lfloor \sqrt{2n}\rfloor$, such that none of $A_{i}$'s is a subset of $A$.
2015 AMC 10, 11
Among the positive integers less than $100$, each of whose digits is a prime number, one is selected at random. What is the probablility that the selected number is prime?
$\textbf{(A) } \dfrac{8}{99}
\qquad\textbf{(B) } \dfrac{2}{5}
\qquad\textbf{(C) } \dfrac{9}{20}
\qquad\textbf{(D) } \dfrac{1}{2}
\qquad\textbf{(E) } \dfrac{9}{16}
$
2010 Contests, 1
Maya lists all the positive divisors of $ 2010^2$. She then randomly selects two distinct divisors from this list. Let $ p$ be the probability that exactly one of the selected divisors is a perfect square. The probability $ p$ can be expressed in the form $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.
2019 LIMIT Category C, Problem 5
Suppose that $X\sim\operatorname{Uniform}(0,1)$ and $Y\sim\operatorname{Bernoulli}\left(\frac14\right)$, independently of each other. Let $Z=X+Y$. Then which of the following is true?
$\textbf{(A)}~\text{The distribution of }Z\text{ is symmetric about }1$
$\textbf{(B)}~Z\text{ has a probability density function}$
$\textbf{(C)}~E(Z)=\frac54$
$\textbf{(D)}~P(Z\le1)=\frac14$
1984 Miklós Schweitzer, 9
[b]9.[/b] Let $X_0, X_1, \dots $ be independent, indentically distributed, nondegenerate random variables, and let $0<\alpha <1$ be a real number. Assume that the series
$\sum_{k=1}^{\infty} \alpha^{k} X_k$
is convergent with probability one. Prove that the distribution function of the sum is continuous. ([b]P. 23[/b])
[T. F. Móri]
2004 AIME Problems, 10
Let $S$ be the set of integers between $1$ and $2^{40}$ whose binary expansions have exactly two $1$'s. If a number is chosen at random from $S$, the probability that it is divisible by $9$ is $p/q$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
2004 National High School Mathematics League, 13
A game about passing barriers rules that in the $n$th barrier, you need to throw a dice for $n$ times. If the sum of points you get is larger than $2^n$, then you can pass this barrier.
[b](a)[/b] How many barriers can you pass at most?
[b](b)[/b] Find the probablity of passing the first three barriers.
2005 Taiwan National Olympiad, 1
There are 94 safes and 94 keys. Each key can open only one safe, and each safe can be opened by only one key. We place randomly one key into each safe. 92 safes are then randomly chosen, and then locked. What is the probability that we can open all the safes with the two keys in the two remaining safes?
(Once a safe is opened, the key inside the safe can be used to open another safe.)
2009 Purple Comet Problems, 23
Square $ABCD$ has side length $4$. Points $E$ and $F$ are the midpoints of sides $AB$ and $CD$, respectively. Eight $1$ by $2$ rectangles are placed inside the square so that no two of the eight rectangles overlap (see diagram). If the arrangement of eight rectangles is chosen randomly, then there are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that none of the rectangles crosses the line segment $EF$ (as in the arrangement on the right). Find $m + n$.
[asy]
size(200);
defaultpen(linewidth(0.8)+fontsize(10pt));
real r = 7;
path square=origin--(4,0)--(4,4)--(0,4)--cycle;
draw(square^^shift((r,0))*square,linewidth(1));
draw((1,4)--(1,0)^^(3,4)--(3,0)^^(0,2)--(1,2)^^(1,3)--(3,3)^^(1,1)--(3,1)^^(2,3)--(2,1)^^(3,2)--(4,2));
draw(shift((r,0))*((2,4)--(2,0)^^(0,2)--(4,2)^^(0,1)--(4,1)^^(0,3)--(2,3)^^(3,4)--(3,2)));
label("A",(4,4),NE);
label("A",(4+r,4),NE);
label("B",(0,4),NW);
label("B",(r,4),NW);
label("C",(0,0),SW);
label("C",(r,0),SW);
label("D",(4,0),SE);
label("D",(4+r,0),SE);
label("E",(2,4),N);
label("E",(2+r,4),N);
label("F",(2,0),S);
label("F",(2+r,0),S);
[/asy]
1980 Spain Mathematical Olympiad, 2
A ballot box contains the votes for the election of two candidates $A$ and $B$. It is known that candidate $A$ has $6$ votes and candidate $B$ has $9$. Find the probability that, when carrying out the scrutiny, candidate $B$ always goes first.
2006 AMC 12/AHSME, 25
How many non-empty subsets $ S$ of $ \{1, 2, 3, \ldots, 15\}$ have the following two properties?
(1) No two consecutive integers belong to $ S$.
(2) If $ S$ contains $ k$ elements, then $ S$ contains no number less than $ k$.
$ \textbf{(A) } 277\qquad \textbf{(B) } 311\qquad \textbf{(C) } 376\qquad \textbf{(D) } 377\qquad \textbf{(E) } 405$
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?
2019 BMT Spring, 6
At a party, $2019$ people decide to form teams of three. To do so, each turn, every person not on a team points to one other person at random. If three people point to each other (that is, $A$ points to $B$, $B$ points to $C$, and $C$ points to $A$), then they form a team. What is the probability that after $65, 536$ turns, exactly one person is not on a team
2000 AMC 8, 21
Keiko tosses one penny and Ephraim tosses two pennies. The probability that Ephraim gets the same number of heads that Keiko gets is
$\text{(A)}\ \dfrac{1}{4} \qquad \text{(B)}\ \dfrac{3}{8} \qquad \text{(C)}\ \dfrac{1}{2} \qquad \text{(D)}\ \dfrac{2}{3} \qquad \text{(E)}\ \dfrac{3}{4}$
2014 BMT Spring, 10
Consider $ 8$ points that are a knight’s move away from the origin (i.e., the eight points $\{(2, 1)$ , $(2, -1)$ , $(1, 2)$ , $(1, -2)$ , $(-1, 2)$ , $(-1, -2)$ , $(-2, 1)$, $(-2, -1)\}$). Each point has probability $\frac12$ of being visible. What is the expected value of the area of the polygon formed by points that are visible? (If exactly $0, 1, 2$ points appear, this area will be zero.)
1966 Spain Mathematical Olympiad, 6
They tell us that a married couple has $5$ children. Calculate the probability that among them there are at least two men and at least one woman. Probability of being born male is considered $1/2$.
2016 AMC 12/AHSME, 23
Three numbers in the interval [0,1] are chosen independently and at random. What is the probability that the chosen numbers are the side lengths of a triangle with positive area?
$\textbf{(A) }\frac16\qquad\textbf{(B) }\frac13\qquad\textbf{(C) }\frac12\qquad\textbf{(D) }\frac23\qquad\textbf{(E) }\frac56$