Let $S$ S be a point chosen at random from the interior of the square $ABCD$, which has side $AB$ and diagonal $AC$. Let $P$ be the probability that the segments $AS$, $SB$, and $AC$ are congruent to the sides of a triangle. Then $P$ can be written as $\dfrac{a-\pi\sqrt{b}-\sqrt{c}}{d}$ where $a,b,c,$ and $d$ are all positive integers and $d$ is as small as possible. Find $ab+cd$.

An unfair coin lands heads with probability $\tfrac1{17}$ and tails with probability $\tfrac{16}{17}$. Matt flips the coin repeatedly until he flips at least one head and at least one tail. What is the expected number of times that Matt flips the coin?

Let $X_1,X_2,..$ be independent random variables with the same distribution, and let $S_n=X_1+X_2+...+X_n, n=1,2,...$. For what real numbers $c$ is the following statement true: $$P\left(\left| \frac{S_{2n}}{2n}- c \right| \leqslant \left| \frac{S_n}{n}-c\right| \right)\geqslant \frac{1}{2}$$

Three distinct vertices are chosen at random from the vertices of a given regular polygon of $ (2n\plus{}1)$ sides. If all such choices are equally likely, what is the probability that the center of the given polygon lies in the interior of the triangle determined by the three chosen random points?

Let n be a set of integers. $S(n)$ is defined as the sum of the elements of n. $T=\{1,2,3,4,5,6,7,8,9\}$ and A and B are subsets of T such that A $\cup$ $B=T$ and A $\cap$ $B=\varnothing$. The probability that $S(A)\geq4S(B)$ can be expressed as $\frac{p}{q}$. Compute $p+q$. [i]2022 CCA Math Bonanza Team Round #8[/i]

It has come to a policeman's ears that 5 gangsters (all of different height) are meeting, one of them is the clan leader, he's the tallest of the 5. He knows the members will leave the building one by one, with a 10-minute break between them, and too bad for him Belgium has not enough policemen to follow all gangsters, so he's on his own to spot the clanleader, and he can only follow one member. So he decides to let go the first 2 people, and then follow the first one that is taller than those two. What's the chance he actually catches the clan leader like this?

Sally randomly chooses three different numbers from the set $\left\{1,2,\ldots,14\right\}$. What is the probability that the sum of her smallest number and her biggest number is at least $15$?

Charles has two six-sided dice. One of the dice is fair, and the other die is biased so that it comes up six with probability $\tfrac23,$ and each of the other five sides has probability $\tfrac{1}{15}.$ Charles chooses one of the two dice at random and rolls it three times. Given that the first two rolls are both sixes, the probability that the third roll will also be a six is $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

On a checkerboard composed of 64 unit squares, what is the probability that a randomly chosen unit square does [b] not [/b] touch the outer edge of the board? [asy] unitsize(10); draw((0,0)--(8,0)--(8,8)--(0,8)--cycle); draw((1,8)--(1,0)); draw((7,8)--(7,0)); draw((6,8)--(6,0)); draw((5,8)--(5,0)); draw((4,8)--(4,0)); draw((3,8)--(3,0)); draw((2,8)--(2,0)); draw((0,1)--(8,1)); draw((0,2)--(8,2)); draw((0,3)--(8,3)); draw((0,4)--(8,4)); draw((0,5)--(8,5)); draw((0,6)--(8,6)); draw((0,7)--(8,7)); fill((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); fill((2,0)--(3,0)--(3,1)--(2,1)--cycle,black); fill((4,0)--(5,0)--(5,1)--(4,1)--cycle,black); fill((6,0)--(7,0)--(7,1)--(6,1)--cycle,black); fill((0,2)--(1,2)--(1,3)--(0,3)--cycle,black); fill((2,2)--(3,2)--(3,3)--(2,3)--cycle,black); fill((4,2)--(5,2)--(5,3)--(4,3)--cycle,black); fill((6,2)--(7,2)--(7,3)--(6,3)--cycle,black); fill((0,4)--(1,4)--(1,5)--(0,5)--cycle,black); fill((2,4)--(3,4)--(3,5)--(2,5)--cycle,black); fill((4,4)--(5,4)--(5,5)--(4,5)--cycle,black); fill((6,4)--(7,4)--(7,5)--(6,5)--cycle,black); fill((0,6)--(1,6)--(1,7)--(0,7)--cycle,black); fill((2,6)--(3,6)--(3,7)--(2,7)--cycle,black); fill((4,6)--(5,6)--(5,7)--(4,7)--cycle,black); fill((6,6)--(7,6)--(7,7)--(6,7)--cycle,black); fill((1,1)--(2,1)--(2,2)--(1,2)--cycle,black); fill((3,1)--(4,1)--(4,2)--(3,2)--cycle,black); fill((5,1)--(6,1)--(6,2)--(5,2)--cycle,black); fill((7,1)--(8,1)--(8,2)--(7,2)--cycle,black); fill((1,3)--(2,3)--(2,4)--(1,4)--cycle,black); fill((3,3)--(4,3)--(4,4)--(3,4)--cycle,black); fill((5,3)--(6,3)--(6,4)--(5,4)--cycle,black); fill((7,3)--(8,3)--(8,4)--(7,4)--cycle,black); fill((1,5)--(2,5)--(2,6)--(1,6)--cycle,black); fill((3,5)--(4,5)--(4,6)--(3,6)--cycle,black); fill((5,5)--(6,5)--(6,6)--(5,6)--cycle,black); fill((7,5)--(8,5)--(8,6)--(7,6)--cycle,black); fill((1,7)--(2,7)--(2,8)--(1,8)--cycle,black); fill((3,7)--(4,7)--(4,8)--(3,8)--cycle,black); fill((5,7)--(6,7)--(6,8)--(5,8)--cycle,black); fill((7,7)--(8,7)--(8,8)--(7,8)--cycle,black);[/asy] $ \textbf{(A)}\frac{1}{16}\qquad\textbf{(B)}\frac{7}{16}\qquad\textbf{(C)}\frac12\qquad\textbf{(D)}\frac{9}{16}\qquad\textbf{(E)}\frac{49}{64} $

Let $ 2n$ distinct points on a circle be given. Arrange them into disjoint pairs in an arbitrary way and join the couples by chords. Determine the probability that no two of these $ n$ chords intersect. (All possible arrangement into pairs are supposed to have the same probability.)

For integer $n\geq2$, let $x_1, x_2, \ldots, x_n$ be real numbers satisfying \[x_1+x_2+\ldots+x_n=0, \qquad \text{and}\qquad x_1^2+x_2^2+\ldots+x_n^2=1.\]For each subset $A\subseteq\{1, 2, \ldots, n\}$, define\[S_A=\sum_{i\in A}x_i.\](If $A$ is the empty set, then $S_A=0$.) Prove that for any positive number $\lambda$, the number of sets $A$ satisfying $S_A\geq\lambda$ is at most $2^{n-3}/\lambda^2$. For which choices of $x_1, x_2, \ldots, x_n, \lambda$ does equality hold?

Let $a$ and $b$ be given positive real numbers, with $a<b.$ If two points are selected at random from a straight line segment of length $b,$ what is the probability that the distance between them is at least $a?$

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.

Let $X=\{1,2,\dots,n\},$ and let $k\in X.$ Show that there are exactly $k\cdot n^{n-1}$ functions $f:X\to X$ such that for every $x\in X$ there is a $j\ge 0$ such that $f^{(j)}(x)\le k.$ [Here $f^{(j)}$ denotes the $j$th iterate of $f,$ so that $f^{(0)}(x)=x$ and $f^{(j+1)}(x)=f\left(f^{(j)}(x)\right).$]

Let $n\ge3$ be an integer. A regular $n$-gon $P$ is given. We randomly select three distinct vertices of $P$. The probability that these three vertices form an isosceles triangle is $1/m$, where $m$ is an integer. How many such integers $n\le 2024$ are there? \[\rm a. ~674\qquad \mathrm b. ~675\qquad \mathrm c. ~682 \qquad\mathrm d. ~684\qquad\mathrm e. ~685\]

Let $A=\{1, 3, 5, 7, 9\}$ and $B=\{2, 4, 6, 8, 10\}$. Let $f$ be a randomly chosen function from the set $A\cup B$ into itself. There are relatively prime positive integers $m$ and $n$ such that $\frac{m}{n}$ is the probablity that $f$ is a one-to-one function on $A\cup B$ given that it maps $A$ one-to-one into $A\cup B$ and it maps $B$ one-to-one into $A\cup B$. Find $m+n$.

A drawer has $5$ pairs of socks. Three socks are chosen at random. If the probability that there is a pair among the three is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers, what is $m+n$? [i]Author: Ray Li[/i]

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.)

A magazine printed photos of three celebrities along with three photos of the celebrities as babies. The baby pictures did not identify the celebrities. Readers were asked to match each celebrity with the correct baby pictures. What is the probability that a reader guessing at random will match all three correctly? $\textbf{(A) }\frac{1}{9}\qquad\textbf{(B) }\frac{1}{6}\qquad\textbf{(C) }\frac{1}{4}\qquad\textbf{(D) }\frac{1}{3}\qquad \textbf{(E) }\frac{1}{2}$

Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

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

A certain college student had the night of February 23 to work on a chemistry problem set and a math problem set (both due on February 24, 2006). If the student worked on his problem sets in the math library, the probability of him finishing his math problem set that night is 95% and the probability of him finishing his chemistry problem set that night is 75%. If the student worked on his problem sets in the the chemistry library, the probability of him finishing his chemistry problem set that night is 90% and the probability of him finishing his math problem set that night is 80%. Since he had no bicycle, he could only work in one of the libraries on February 23rd. He works in the math library with a probability of 60%. Given that he finished both problem sets that night, what is the probability that he worked on the problem sets in the math library?

An unfair coin, which has the probability of $a\ \left(0<a<\frac 12\right)$ for showing $Heads$ and $1-a$ for showing $Tails$, is flipped $n\geq 2$ times. After $n$-th trial, denote by $A_n$ the event that heads are showing on at least two times and by$B_n$ the event that are not showing in the order of $tails\rightarrow heads$, until the trials $T_1,\ T_2,\ \cdots ,\ T_n$ will be finished . Answer the following questions: (1) Find the probabilities $P(A_n),\ P(B_n)$. (2) Find the probability $P(A_n\cap B_n )$. (3) Find the limit $\lim_{n\to\infty} \frac{P(A_n) P(B_n)}{P(A_n\cap B_n )}.$ You may use $\lim_{n\to\infty} nr^n=0\ (0<r<1).$

[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$.

Throw $ n$ balls in to $ 2n$ boxes.　Suppose each ball comes into each box with equal probability of entering in any boxes. Let $ p_n$ be the probability such that any box has ball less than or equal to one. Find the limit $ \lim_{n\to\infty} \frac{\ln p_n}{n}$