Let $S$ be the increasing sequence of positive integers whose binary representation has exactly $8$ ones. Find the $1000^{th}$ number in $S$ (in base $10$).
- In a group of nine people each person shakes hands with exactly two of the other people from the group. Let $N$ be the number of ways this handshaking can occur. Consider two handshaking arrangements different if and only if at least two people who shake hands under one arrangement do not shake hands under the other arrangement. Find $N$.
The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits 1 through 9 in such a way that the sum of the numbers on every three consecutive vertices is a multiple of 3. Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements.
The probability that a set of three distinct vertices chosen at random from among the vertices of a regular $n$-gon determine an obtuse triangle is $\frac{93}{125}$ . Find the sum of all possible values of $n$.
Six men and some number of women stand in a line in random order. Let $p$ be the probability that a group of at least four men stand together in the line, given that every man stands next to at least one other man. Find the least number of women in the line such that $p$ does not exceed $1$ percent.
Define an ordered quadruple of integers $(a, b, c, d)$ as interesting if $1 \le a < b < c < d \le 10$, and $a+d>b+c$. How many interesting ordered quadruples are there?
Ed has five identical green marbles, and a large supply of identical red marbles. He arranges the green marbles and some of the red ones in a row and finds that the number of marbles whose right hand neighbor is the same color as themselves is equal to the number of marbles whose right hand neighbor is the other color. An example of such an arrangement is GGRRRGGRG. Let $m$ be the maximum number of red marbles for which such an arrangement is possible, and let $N$ be the number of ways he can arrange the $m+5$ marbles to satisfy the requirement. Find the remainder when $N$ is divided by $1000$.
Nine delegates, three each from three different countries, randomly select chairs at a round table that seats nine people. Find the probability that each delegate sits next to at least one delegate from another country.
There are $N$ permutations $(a_{1}, a_{2}, ... , a_{30})$ of $1, 2, \ldots, 30$ such that for $m \in \left\{{2, 3, 5}\right\}$, $m$ divides $(a_{n+m} - a_{n})$ for all integers $n$ with $1 \leq n < n+m \leq 30$. Find $N$.
Let $P(x) = x^2 - 3x - 9$. A real number $x$ is chosen at random from the interval $5 \le x \le 15$. The probability that $\lfloor\sqrt{P(x)}\rfloor = \sqrt{P(\lfloor x \rfloor)}$ is equal to $\frac{\sqrt{a} + \sqrt{b} + \sqrt{c} - d}{e}$ , where $a$, $b$, $c$, $d$, and $e$ are positive integers. Find $a + b + c + d + e$.
A perfect power is a number that can be written as a positive integer raised to an integer power greater than $1$. For example, $125$ is a perfect power because it is equal $5^3$. The list $2$, $3$, $5$, $6$, $7$, $10$, $11$, $12$, $13$, $14$, $15$, $17$, $\cdots$ contains every positive integer less than $1000$ that is not a perfect power. How many integer are in the list?
Find the coefficient of $x^{17}$ in the expansion of $(1+x^5 + x^7)^{20}$.
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 + n$.
Jackie and Phil have two fair coins and a third coin that comes up heads with probability $\frac47$. Jackie flips the three coins, and then Phil flips the three coins. Let $\frac {m}{n}$ be the probability that Jackie gets the same number of heads as Phil, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$, where the $a_i$'s are integers, and $0 \le a_i \le 99$. An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$. Find $N$.
A point $P$ is chosen at random in the interior of a unit square $S$. Let $d(P)$ denote the distance from $P$ to the closest side of $S$. The probability that $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is equal to $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Dave arrives at an airport which has twelve gates arranged in a straight line with exactly $100$ feet between adjacent gates. His departure gate is assigned at random. After waiting at that gate, Dave is told the departure gate has been changed to a different gate, again at random. Let the probability that Dave walks $400$ feet or less to the new gate be a fraction $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Find the number of second-degree polynomials $f(x)$ with integer coefficients and integer zeros for which $f(0)=2010$.
The $52$ cards in a deck are numbered $1, 2, \cdots, 52$. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let $p(a)$ be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards $a$ and $a+9$, and Dylan picks the other of these two cards. The minimum value of $p(a)$ for which $p(a)\ge\frac{1}{2}$ can be written as $\frac{m}{n}$. where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
There are $n$ points, $A_1$, $A_2$, $\cdots$, $A_n$ on a line segment, $\overline{A_0A_{n+1}}$. The point $A_0$ is black, $A_{n+1}$ is white, and the rest points are colored randomly either black or white. Prove: among these $n+1$ line segments $A_kA_{k+1}$, where $k=0, 1, \cdots, n$, the number of those with different colored ending points is odd.
A box contains 2 red marbles, 2 green marbles, and 2 yellow marbles. Carol takes 2 marbles from the box at random; then Claudia takes 2 of the remaining marbles at random; and then Cheryl takes the last 2 marbles. What is the probability that Cheryl gets 2 marbles of the same color?
For each positive integer $n$, let $S(n)$ be the number of sequences of length $n$ consisting solely of the letters $A$ and $B$, with no more than three $A$s in a row and no more than three $B$s in a row. What is the remainder when $S(2015)$ is divided by $12$?
The Tigers beat the Sharks $2$ out of $3$ times they played. They then played $N$ more times, and the Sharks ended up winning at least $95\%$ of all the games played. What is the minimum possible value for $N$?
Larry and Julius are playing a game, taking turns throwing a ball at a bottle sitting on a ledge. Larry throws first. The winner is the first person to knock the bottle off the ledge. At each turn the probability that a player knocks the bottle off the ledge is $\tfrac{1}{2}$, independently of what has happened before. What is the probability that Larry wins the game?
How many noncongruent integer-sided triangles with positive area and perimeter less than 15 are neither equilateral, isosceles, nor right triangles?