Take the square with vertices $(0,0)$, $(1,0)$, $(0,1)$, and $(1,1)$. Choose a random point in this square and draw the line segment from it to $(0,0)$. Choose a second random point in this square and draw the line segment from it to $(1,0)$. What is the probability that the two line segments intersect?

Steve stands in the middle of a field of an infinitely large chessboard, all of which are fields square and one square meter. Every second it randomly wanders into the middle one of the four neighboring fields, each of which has the same probability. How high is the probability that after $2015$ steps, he will have taken exactly five meters way from his starting square?

Ten identical crates each of dimensions $ 3$ ft $ \times$ $ 4$ ft $ \times$ $ 6$ ft. The first crate is placed flat on the floor. Each of the remaining nine crates is placed, in turn, flat on top of the previous crate, and the orientation of each crate is chosen at random. Let $ \frac{m}{n}$ be the probability that the stack of crates is exactly $ 41$ ft tall, where $ m$ and $ n$ are relatively prime positive integers. Find $ m$.

One day Jason finishes his math homework early, and decides to take a jog through his neighborhood. While jogging, Jason trips over a leprechaun. After dusting himself off and apologizing to the odd little magical creature, Jason, thinking there is nothing unusual about the situation, starts jogging again. Immediately the leprechaun calls out, "hey, stupid, this is your only chance to win gold from a leprechaun!" Jason, while not particularly greedy, recognizes the value of gold. Thinking about his limited college savings, Jason approaches the leprechaun and asks about the opportunity. The leprechaun hands Jason a fair coin and tells him to flip it as many times as it takes to flip a head. For each tail Jason flips, the leprechaun promises one gold coin. If Jason flips a head right away, he wins nothing. If he first flips a tail, then a head, he wins one gold coin. If he's lucky and flips ten tails before the first head, he wins $\textit{ten gold coins.}$ What is the expected number of gold coins Jason wins at this game? $\textbf{(A) }0\hspace{14em}\textbf{(B) }\dfrac1{10}\hspace{13.5em}\textbf{(C) }\dfrac18$ $\textbf{(D) }\dfrac15\hspace{13.8em}\textbf{(E) }\dfrac14\hspace{14em}\textbf{(F) }\dfrac13$ $\textbf{(G) }\dfrac25\hspace{13.7em}\textbf{(H) }\dfrac12\hspace{14em}\textbf{(I) }\dfrac35$ $\textbf{(J) }\dfrac23\hspace{14em}\textbf{(K) }\dfrac45\hspace{14em}\textbf{(L) }1$ $\textbf{(M) }\dfrac54\hspace{13.5em}\textbf{(N) }\dfrac43\hspace{14em}\textbf{(O) }\dfrac32$ $\textbf{(P) }2\hspace{14.1em}\textbf{(Q) }3\hspace{14.2em}\textbf{(R) }4$ $\textbf{(S) }2007$

I give you a deck of $n$ cards numbered $1$ through $n$. On each turn, you take the top card of the deck and place it anywhere you choose in the deck. You must arrange the cards in numerical order, with card $1$ on top and card $n$ on the bottom. If I place the deck in a random order before giving it to you, and you know the initial order of the cards, what is the expected value of the minimum number of turns you need to arrange the deck in order?

A square with side length $8$ is colored white except for $4$ black isosceles right triangular regions with legs of length $2$ in each corner of the square and a black diamond with side length $2\sqrt{2}$ in the center of the square, as shown in the diagram. A circular coin with diameter $1$ is dropped onto the square and lands in a random location where the coin is completely contained within the square, The probability that the coin will cover part of the black region of the square can be written as $\frac{1}{196}(a+b\sqrt{2}+\pi)$, where $a$ and $b$ are positive integers. What is $a+b$? [asy] //Diagram by Samrocksnature draw((0,0)--(8,0)--(8,8)--(0,8)--(0,0)); fill((2,0)--(0,2)--(0,0)--cycle, black); fill((6,0)--(8,0)--(8,2)--cycle, black); fill((8,6)--(8,8)--(6,8)--cycle, black); fill((0,6)--(2,8)--(0,8)--cycle, black); fill((4,6)--(2,4)--(4,2)--(6,4)--cycle, black); filldraw(circle((2.6,3.31),0.47),gray); [/asy] $\textbf{(A) }64 \qquad \textbf{(B) }66 \qquad \textbf{(C) }68 \qquad \textbf{(D) }70 \qquad \textbf{(E) }72$

A player chooses one of the numbers $ 1$ through $ 4$. After the choice has been made, two regular four-sided (tetrahedral) dice are rolled, with the sides of the dice numbered $ 1$ through $ 4$. If the number chosen appears on the bottom of exactly one die after it is rolled, then the player wins $ \$1$. If the number chosen appears on the bottom of both of the dice, then the player wins $ \$2$. If the number chosen does not appear on the bottom of either of the dice, the player loses $ \$1$. What is the expected return to the player, in dollars, for one roll of the dice? $ \textbf{(A)}\ \minus{}\frac{1}{8}\qquad \textbf{(B)}\ \minus{}\frac{1}{16}\qquad \textbf{(C)}\ 0\qquad \textbf{(D)}\ \frac{1}{16}\qquad \textbf{(E)}\ \frac{1}{8}$

Crisp All, a basketball player, is [i]dropping dimes[/i] and nickels on a number line. Crisp drops a dime on every positive multiple of $10$, and a nickel on every multiple of $5$ that is not a multiple of $10$. Crisp then starts at $0$. Every second, he has a $\frac{2}{3}$ chance of jumping from his current location $x$ to $x+3$, and a $\frac{1}{3}$ chance of jumping from his current location $x$ to $x+7$. When Crisp jumps on either a dime or a nickel, he stops jumping. What is the probability that Crisp [i]stops on a dime[/i]?

Pick a $3$-digit number $abc$, which contains no $0$'s. The probability that this is a winning number is $\frac1a\cdot\frac1b\cdot\frac1c$. However, the BMT problem writer tries to balance out the chances for the numbers in the following ways: [list] [*] For the lowest digit $n$ in the number, he rolls an $n$-sided die for each time that the digit appears, and gives the number $0$ probability of winning if an $n$ is rolled. [*] For the largest digit $m$ in the number, he rolls an $m$-sided die once and scales the probability of winning by that die roll. [/list] If you choose optimally, what is the probability that your number is a winning number?

a government has decided to help it's people by giving them $n$ coupons for $n$ fundamental things, but because of being unmanaged, the giving of the coupons to the people is random. in each time that a person goes to the office to get a coupon, the office manager gives him one of the $n$ coupons randomly and with the same probability. It's obvious that in this system a person may get a coupon that he had it before. suppose that $X_n$ is the random varieble of the first time that a person gets all of the $n$ coupons. show that $\frac{X_n}{n ln(n)}$ in probability converges to $1$.

A standard six-sided fair die is rolled four times. The probability that the product of all four numbers rolled is a perfect square is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

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}$

Dan has a fair $6$-sided die with faces labeled $1,2,3,4,+,$ and $-.$ In order to complete the equation \[ \underline{\qquad} \ \underline{\qquad} \ \underline{\qquad}=\underline{\qquad}, \] Dan repeatedly rolls his die and fills in a blank with the character he obtained, starting with the leftmost blank and progressing rightward. The probability that, when all blanks are filled, Dan forms a true equation, is $\frac{p}{q},$ where $p$ and $q$ are relatively prime integers. Find $p+q.$

If 100 dice are rolled, what is the probability that the sum of the numbers rolled is even? [i]Lightning 1.1[/i]

An insurance company believes that people can be divided into 2 classes: those who are accident prone and those who are not. Their statistics show that an accident prone person will have an accident in a yearly period with probability 0.4, whereas this probability is 0.2 for the other kind. Given that 30% of people are accident prone, what is the probability that a new policyholder will have an accident within a year of purchasing a policy?

Written on a blackboard is the polynomial $x^2+x+2014$. Calvin and Hobbes take turns alternately (starting with Calvin) in the following game. At his turn, Calvin should either increase or decrease the coefficient of $x$ by $1$. And at this turn, Hobbes should either increase or decrease the constant coefficient by $1$. Calvin wins if at any point of time the polynomial on the blackboard at that instant has integer roots. Prove that Calvin has a winning stratergy.

Amelia has $27$ unit cubes. She selects one and paints one of its faces. She then randomly glues all $27$ cubes together to form a $3 \times 3 \times 3$ cube (with all possible arrangements of the unit cubes being equally likely). Compute the probability that the resulting cube appears unpainted.

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?

A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0),$ $(2020, 0),$ $(2020, 2020),$ and $(0, 2020)$. The probability that the point is within $d$ units of a lattice point is $\tfrac{1}{2}$. (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$ to the nearest tenth$?$ $\textbf{(A) } 0.3 \qquad \textbf{(B) } 0.4 \qquad \textbf{(C) } 0.5 \qquad \textbf{(D) } 0.6 \qquad \textbf{(E) } 0.7$

Let $\zeta_1, \ldots, \zeta_n$ be (not necessarily independent) random variables with normal distribution for which $E\zeta_j=0$ and $E\zeta_j^2\le 1$ for all $1\le j\le n$. Prove that $$E\left( \max_{1\le j\le n} \zeta_j \right)\le\sqrt{2\log n}$$ (translated by Miklós Maróti)

For each positive integer $ n$, evaluate the sum \[ \sum_{k\equal{}0}^{2n}(\minus{}1)^{k}\frac{\binom{4n}{2k}}{\binom{2n}{k}}\]

Juan rolls a fair regular octahedral die marked with the numbers $ 1$ through $ 8$. Then Amal rolls a fair six-sided die. What is the probability that the product of the two rolls is a multiple of $ 3$? $ \textbf{(A)}\ \frac{1}{12} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{1}{2} \qquad \textbf{(D)}\ \frac{7}{12} \qquad \textbf{(E)}\ \frac{2}{3}$

We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]

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$

Let $S$ be the set of 81 points $(x, y)$ such that $x$ and $y$ are integers from $-4$ through $4$. Let $A$, $B$, and $C$ be random points chosen independently from $S$, with each of the 81 points being equally likely. (The points $A$, $B$, and $C$ do not have to be different.) Let $K$ be the area of the (possibly degenerate) triangle $ABC$. What is the expected value (average value) of $K^2$ ?