A jar contains 4 blue marbles, 3 green marbles, and 5 red marbles. If Helen reaches in the jar and selects a marble at random, then the probability that she selects a red marble can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $S$ be a randomly selected four-element subset of $\{1, 2, 3, 4, 5, 6, 7, 8\}$. Let $m$ and $n$ be relatively prime positive integers so that the expected value of the maximum element in $S$ is $\dfrac{m}{n}$. Find $m + n$.

Find all positive integers $n$ with the property that the set \[\{n,n+1,n+2,n+3,n+4,n+5\}\] can be partitioned into two sets such that the product of the numbers in one set equals the product of the numbers in the other set.

An infinite geometric series has sum $2005$. A new series, obtained by squaring each term of the original series, has $10$ times the sum of the original series. The common ratio of the original series is $\frac{m}{n}$ where $m$ and $n$ are relatively prime integers. Find $m+n$.

Prove that every nonzero coefficient of the Taylor series of $(1-x+x^2)e^x$ about $x=0$ is a rational number whose numerator (in lowest terms) is either $1$ or a prime number.

A triangular array of numbers has a first row consisting of the odd integers $ 1,3,5,\ldots,99$ in increasing order. Each row below the first has one fewer entry than the row above it, and the bottom row has a single entry. Each entry in any row after the top row equals the sum of the two entries diagonally above it in the row immediately above it. How many entries in the array are multiples of $ 67$? [asy]size(200); defaultpen(fontsize(10)); label("1", origin); label("3", (2,0)); label("5", (4,0)); label("$\cdots$", (6,0)); label("97", (8,0)); label("99", (10,0)); label("4", (1,-1)); label("8", (3,-1)); label("12", (5,-1)); label("196", (9,-1)); label(rotate(90)*"$\cdots$", (6,-2));[/asy]

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

The sets $A = \{z : z^{18} = 1\}$ and $B = \{w : w^{48} = 1\}$ are both sets of complex roots of unity. The set $C = \{zw : z \in A \ \text{and} \ w \in B\}$ is also a set of complex roots of unity. How many distinct elements are in $C$?

Compute the smallest positive integer $n$ that is a multiple of $29$ with the property that for every positive integer that is relatively prime to $n$, $k^{n}\equiv 1\pmod{n}.$

Find all positive integers $n, n>1$ for wich holds : If $a_1, a_2 ,\dots ,a_k$ are all numbers less than $n$ and relatively prime to $n$ , and holds $a_1<a_2<\dots <a_k $, then none of sums $a_i+a_{i+1}$ for $i=1,2,3,\dots k-1 $ are divisible by $3$.

Find the smallest possible sum $a + b + c + d + e$ where $a, b, c, d,$ and $e$ are positive integers satisfying the conditions $\star$ each of the pairs of integers $(a, b), (b, c), (c, d),$ and $(d, e)$ are [b]not[/b] relatively prime $\star$ all other pairs of the five integers [b]are[/b] relatively prime.

Equilateral triangle $ T$ is inscribed in circle $ A$, which has radius $ 10$. Circle $ B$ with radius $ 3$ is internally tangent to circle $ A$ at one vertex of $ T$. Circles $ C$ and $ D$, both with radius $ 2$, are internally tangent to circle $ A$ at the other two vertices of $ T$. Circles $ B$, $ C$, and $ D$ are all externally tangent to circle $ E$, which has radius $ \frac {m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$. [asy]unitsize(2.2mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair A=(0,0), D=8*dir(330), C=8*dir(210), B=7*dir(90); pair Ep=(0,4-27/5); pair[] dotted={A,B,C,D,Ep}; draw(Circle(A,10)); draw(Circle(B,3)); draw(Circle(C,2)); draw(Circle(D,2)); draw(Circle(Ep,27/5)); dot(dotted); label("$E$",Ep,E); label("$A$",A,W); label("$B$",B,W); label("$C$",C,W); label("$D$",D,E);[/asy]

A hexagon inscribed in a circle has three consecutive sides each of length $3$ and three consecutive sides each of length $5$. The chord of the circle that divides the hexagon into two trapezoids, one with three sides each of length $3$ and the other with three sides each of length $5$, has length equal to $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. $\text{(A)}\ 309 \qquad \text{(B)}\ 349 \qquad \text{(C)}\ 369 \qquad \text{(D)}\ 389\qquad \text{(E)}\ 409$

The positive integers $a,b,c$ are pairwise relatively prime, $a$ and $c$ are odd and the numbers satisfy the equation $a^2+b^2=c^2$. Prove that $b+c$ is the square of an integer.

We have $2022$ $1s$ written on a board in a line. We randomly choose a strictly increasing sequence from ${1, 2, . . . , 2022}$ such that the last term is $2022$. If the chosen sequence is $a_1, a_2, ..., a_k$ ($k$ is not fixed), then at the $i^{th}$ step, we choose the first a$_i$ numbers on the line and change the 1s to 0s and 0s to 1s. After $k$ steps are over, we calculate the sum of the numbers on the board, say $S$. The expected value of $S$ is $\frac{a}{b}$ where $a, b$ are relatively prime positive integers. Find $a + b.$