This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1111

2013 AMC 8, 8

A fair coin is tossed 3 times. What is the probability of at least two consecutive heads? $\textbf{(A)}\ \frac18 \qquad \textbf{(B)}\ \frac14 \qquad \textbf{(C)}\ \frac38 \qquad \textbf{(D)}\ \frac12 \qquad \textbf{(E)}\ \frac34$

2012 Korea Junior Math Olympiad, 8

Let there be $n$ students, numbered $1$ through $n$. Let there be $n$ cards with numbers $1$ through $n$ written on them. Each student picks a card from the stack, and two students are called a pair if they pick each other's number. Let the probability that there are no pairs be $p_n$. Prove that $p_n - p_{n-1}=0$ if $n$ is odd, and prove that $p_n - p_{n-1}= \frac{1}{(-2)^kk^{1-k}}$ if $n = 2k$.

2018 PUMaC Combinatorics A, 4

If $a$ and $b$ are selected uniformly from $\{0,1,\ldots,511\}$ without replacement, the expected number of $1$'s in the binary representation of $a+b$ can be written in simplest from as $\tfrac{m}{n}$. Compute $m+n$.

2009 Princeton University Math Competition, 1

Tags: probability
Three people, John, Macky, and Rik, play a game of passing a basketball from one to another. Find the number of ways of passing the ball starting with Macky and reaching Macky again at the end of the seventh pass.

2014 NIMO Problems, 8

Let $p=2^{16}+1$ be a prime. A sequence of $2^{16}$ positive integers $\{a_n\}$ is [i]monotonically bounded[/i] if $1\leq a_i\leq i$ for all $1\leq i\leq 2^{16}$. We say that a term $a_k$ in the sequence with $2\leq k\leq 2^{16}-1$ is a [i]mountain[/i] if $a_k$ is greater than both $a_{k-1}$ and $a_{k+1}$. Evan writes out all possible monotonically bounded sequences. Let $N$ be the total number of mountain terms over all such sequences he writes. Find the remainder when $N$ is divided by $p$. [i]Proposed by Michael Ren[/i]

2013 Princeton University Math Competition, 9

If two distinct integers from $1$ to $50$ inclusive are chosen at random, what is the expected value of their product? Note: The expectation is defined as the sum of the products of probability and value, i.e., the expected value of a coin flip that gives you $\$10$ if head and $\$5$ if tail is $\tfrac12\times\$10+\tfrac12\times\$5=\$7.5$.

2017 Purple Comet Problems, 11

Tags: probability
Dave has a pile of fair standard six-sided dice. In round one, Dave selects eight of the dice and rolls them. He calculates the sum of the numbers face up on those dice to get $r_1$. In round two, Dave selects $r_1$ dice and rolls them. He calculates the sum of the numbers face up on those dice to get $r_2$. In round three, Dave selects $r_2$ dice and rolls them. He calculates the sum of the numbers face up on those dice to get $r_3$. Find the expected value of $r_3$.

2006 AMC 10, 20

Tags: probability
Six distinct positive integers are randomly chosen between 1 and 2006, inclusive. What is the probability that some pair of these integers has a difference that is a multiple of 5? $ \textbf{(A) } \frac 12 \qquad \textbf{(B) } \frac 35 \qquad \textbf{(C) } \frac 23 \qquad \textbf{(D) } \frac 45 \qquad \textbf{(E) } 1$

2018 Brazil Undergrad MO, 12

Let $ABC$ be an equilateral triangle. $A $ point $P$ is chosen at random within this triangle. What is the probability that the sum of the distances from point $P$ to the sides of triangle $ABC$ are measures of the sides of a triangle?

2013 Purple Comet Problems, 17

A rectangle has side lengths $6$ and $8$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that a point randomly selected from the inside of the rectangle is closer to a side of the rectangle than to either diagonal of the rectangle. Find $m + n$.

1987 AMC 12/AHSME, 26

Tags: probability
The amount $2.5$ is split into two nonnegative real numbers uniformly at random, for instance, into $2.143$ and $.357$, or into $\sqrt{3}$ and $2.5-\sqrt{3}.$ Then each number is rounded to its nearest integer, for instance, $2$ and $0$ in the first case above, $2$ and $1$ in the second. What is the probability that the two integers sum to $3$? $ \textbf{(A)}\ \frac{1}{4} \qquad\textbf{(B)}\ \frac{2}{5} \qquad\textbf{(C)}\ \frac{1}{2} \qquad\textbf{(D)}\ \frac{3}{5} \qquad\textbf{(E)}\ \frac{3}{4} $

2019 AMC 12/AHSME, 19

Tags: probability
Raashan, Sylvia, and Ted play the following game. Each starts with $\$1$. A bell rings every $15$ seconds, at which time each of the players who currently have money simultaneously chooses one of the other two players independently and at random and gives $\$1$ to that player. What is the probability that after the bell has rung $2019$ times, each player will have $\$1$? (For example, Raashan and Ted may each decide to give $\$1$ to Sylvia, and Sylvia may decide to give her dollar to Ted, at which point Raashan will have $\$0$, Sylvia would have $\$2$, and Ted would have $\$1$, and and that is the end of the first round of play. In the second round Raashan has no money to give, but Sylvia and Ted might choose each other to give their $\$1$ to, and and the holdings will be the same as the end of the second [sic] round. $\textbf{(A) } \frac{1}{7} \qquad\textbf{(B) } \frac{1}{4} \qquad\textbf{(C) } \frac{1}{3} \qquad\textbf{(D) } \frac{1}{2} \qquad\textbf{(E) } \frac{2}{3}$

2006 Putnam, A2

Alice and Bob play a game in which they take turns removing stones from a heap that initially has $n$ stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays first. Prove that there are infinitely many such $n$ such that Bob has a winning strategy. (For example, if $n=17,$ then Alice might take $6$ leaving $11;$ then Bob might take $1$ leaving $10;$ then Alice can take the remaining stones to win.)

2014 Contests, 1

1. What is the probability that a randomly chosen word of this sentence has exactly four letters?

2008 Pre-Preparation Course Examination, 1

$ R_k(m,n)$ is the least number such that for each coloring of $ k$-subsets of $ \{1,2,\dots,R_k(m,n)\}$ with blue and red colors, there is a subset with $ m$ elements such that all of its k-subsets are red or there is a subset with $ n$ elements such that all of its $ k$-subsets are blue. a) If we give a direction randomly to all edges of a graph $ K_n$ then what is the probability that the resultant graph does not have directed triangles? b) Prove that there exists a $ c$ such that $ R_3(4,n)\geq2^{cn}$.

2017 Miklós Schweitzer, 10

Let $X_1,X_2,\ldots$ be independent and identically distributed random variables with distribution $\mathbb{P}(X_1=0)=\mathbb{P}(X_1=1)=\frac12$. Let $Y_1$, $Y_2$, $Y_3$, and $Y_4$ be independent, identically distributed random variables, where $Y_1:=\sum_{k=1}^\infty \frac{X_k}{16^k}$. Decide whether the random variables $Y_1+2Y_2+4Y_3+8Y_4$ and $Y_1+4Y_3$ are absolutely continuous.

2013 NIMO Problems, 2

Square $\mathcal S$ has vertices $(1,0)$, $(0,1)$, $(-1,0)$ and $(0,-1)$. Points $P$ and $Q$ are independently selected, uniformly at random, from the perimeter of $\mathcal S$. Determine, with proof, the probability that the slope of line $PQ$ is positive. [i]Proposed by Isabella Grabski[/i]

2012 Online Math Open Problems, 7

Two distinct points $A$ and $B$ are chosen at random from 15 points equally spaced around a circle centered at $O$ such that each pair of points $A$ and $B$ has the same probability of being chosen. The probability that the perpendicular bisectors of $OA$ and $OB$ intersect strictly inside the circle can be expressed in the form $\frac{m}{n}$, where $m,n$ are relatively prime positive integers. Find $m+n$. [i]Ray Li.[/i]

1986 ITAMO, 3

Two numbers are randomly selected from interval $I = [0, 1]$. Given $\alpha \in I$, what is the probability that the smaller of the two numbers does not exceed $\alpha$? Is the answer $(100 \alpha)$%, it just seems too easy. :|

2006 AMC 10, 25

A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once? $ \textbf{(A) } \frac {1}{2187} \qquad \textbf{(B) } \frac {1}{729} \qquad \textbf{(C) } \frac {2}{243} \qquad \textbf{(D) } \frac {1}{81} \qquad \textbf{(E) } \frac {5}{243}$

2007 Stanford Mathematics Tournament, 5

The polynomial $-400x^5+2660x^4-3602x^3+1510x^2+18x-90$ has five rational roots. Suppose you guess a rational number which could possibly be a root (according to the rational root theorem). What is the probability that it actually is a root?

2017 Kürschák Competition, 1

Let $ABC$ be a triangle. Choose points $A'$, $B'$ and $C'$ independently on side segments $BC$, $CA$ and $AB$ respectively with a uniform distribution. For a point $Z$ in the plane, let $p(Z)$ denote the probability that $Z$ is contained in the triangle enclosed by lines $AA'$, $BB'$ and $CC'$. For which interior point $Z$ in triangle $ABC$ is $p(Z)$ maximised?

2008 AMC 10, 17

Tags: probability
A poll shows that $ 70\%$ of all voters approve of the mayor's work. On three separate occasions a pollster selects a voter at random. What is the probability that on exactly one of these three occasions the voter approves of the mayor's work? $ \textbf{(A)}\ 0.063 \qquad \textbf{(B)}\ 0.189 \qquad \textbf{(C)}\ 0.233 \qquad \textbf{(D)}\ 0.333 \qquad \textbf{(E)}\ 0.441$

2006 Denmark MO - Mohr Contest, 3

A natural number $n$, which is at most $500$, has the property that when one chooses at at random among the numbers $1, 2, 3,...,499, 500$, then the probability is $\frac{1}{100}$ for $m$ to add up to $n$. Determine the largest possible value of $n$.

1964 AMC 12/AHSME, 36

Tags: probability
In this figure the radius of the circle is equal to the altitude of the equilateral triangle $ABC$. The circle is made to roll along the side $AB$, remaining tangent to it at a variable point $T$ and intersecting lines $AC$ and $BC$ in variable points $M$ and $N$, respectively. Let $n$ be the number of degrees in arc $MTN$. Then $n$, for all permissible positions of the circle: $\textbf{(A) }\text{varies from }30^{\circ}\text{ to }90^{\circ}$ $\textbf{(B) }\text{varies from }30^{\circ}\text{ to }60^{\circ}$ $\textbf{(C) }\text{varies from }60^{\circ}\text{ to }90^{\circ}$ $\textbf{(D) }\text{remains constant at }30^{\circ}$ $\textbf{(E) }\text{remains constant at }60^{\circ}$ [asy] pair A = (0,0), B = (1,0), C = dir(60), T = (2/3,0); pair M = intersectionpoint(A--C,Circle((2/3,sqrt(3)/2),sqrt(3)/2)), N = intersectionpoint(B--C,Circle((2/3,sqrt(3)/2),sqrt(3)/2)); draw((0,0)--(1,0)--dir(60)--cycle); draw(Circle((2/3,sqrt(3)/2),sqrt(3)/2)); label("$A$",A,dir(210)); label("$B$",B,dir(-30)); label("$C$",C,dir(90)); label("$M$",M,dir(190)); label("$N$",N,dir(75)); label("$T$",T,dir(-90)); //Credit to bobthesmartypants for the diagram [/asy]