A positive integer $ N$ with three digits in its base ten representation is chosen at random, with each three digit number having an equal chance of being chosen. The probability that $ \log_2 N$ is an integer is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 3/899 \qquad \textbf{(C)}\ 1/225 \qquad \textbf{(D)}\ 1/300 \qquad \textbf{(E)}\ 1/450$

Prove the following inequalities: (1) $ x\minus{}\sin x\leq \tan x\minus{}x\ \ \left(0\leq x<\frac{\pi}{2}\right)$ (2) $ \int_0^x \cos (\tan t\minus{}t)\ dt\leq \sin (\sin x)\plus{}\frac 12 \left(x\minus{}\frac{\sin 2x}{2}\right)\ \left(0\leq x\leq \frac{\pi}{3}\right)$

What is the sum of all of the distinct prime factors of $25^3 - 27^2$?

Two standard six-sided dice are tossed. What is the probability that the sum of the numbers is greater than $7$? $\text{(A) }1\qquad\text{(B) }\frac{5}{12}\qquad\text{(C) }\frac{2}{3}\qquad\text{(D) }\frac{4}{9}\qquad\text{(E) }\frac{7}{36}$

Given positive integer $k$, prove that there exists a positive integer $N$ depending only on $k$ such that for any integer $n\geq N$, $\binom{n}{k}$ has at least $k$ different prime divisors.

Given an integer $n \geq 3$, determine if there are $n$ integers $b_1, b_2, \dots , b_n$, distinct two-by-two (that is, $b_i \neq b_j$ for all $i \neq j$) and a polynomial $P(x)$ with coefficients integers, such that $P(b_1) = b_2, P(b_2) = b_3, \dots , P(b_{n-1}) = b_n$ and $P(b_n) = b_1$.

[u]Round 5[/u] [b]p13.[/b] Express the number $3024_8$ in base $2$. [b]p14.[/b] $\vartriangle ABC$ has a perimeter of $10$ and has $AB = 3$ and $\angle C$ has a measure of $60^o$. What is the maximum area of the triangle? [b]p15.[/b] A weighted coin comes up as heads $30\%$ of the time and tails $70\%$ of the time. If I flip the coin $25$ times, howmany tails am I expected to flip? [u]Round 6[/u] [b]p16.[/b] A rectangular box with side lengths $7$, $11$, and $13$ is lined with reflective mirrors, and has edges aligned with the coordinate axes. A laser is shot from a corner of the box in the direction of the line $x = y = z$. Find the distance traveled by the laser before hitting a corner of the box. [b]p17.[/b] The largest solution to $x^2 + \frac{49}{x^2}= 2018$ can be represented in the form $\sqrt{a}+\sqrt{b}$. Compute $a +b$. [b]p18.[/b] What is the expected number of black cards between the two jokers of a $54$ card deck? [u]Round 7[/u] p19. Compute ${6 \choose 0} \cdot 2^0 + {6 \choose 1} \cdot 2^1+ {6 \choose 2} \cdot 2^2+ ...+ {6 \choose 6} \cdot 2^6$. [b]p20.[/b] Define a sequence by $a_1 =5$, $a_{n+1} = a_n + 4 * n -1$ for $n\ge 1$. What is the value of $a_{1000}$? [b]p21.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle B = 15^o$ and $\angle C = 30^o$. Let $D$ be the point such that $\vartriangle ADC$ is an isosceles right triangle where $D$ is in the opposite side from $A$ respect to $BC$ and $\angle DAC = 90^o$. Find the $\angle ADB$. [u]Round 8[/u] [b]p22.[/b] Say the answer to problem $24$ is $z$. Compute $gcd (z,7z +24).$ [b]p23.[/b] Say the answer to problem $22$ is $x$. If $x$ is $1$, write down $1$ for this question. Otherwise, compute $$\sum^{\infty}_{k=1} \frac{1}{x^k}$$ [b]p24.[/b] Say the answer to problem $23$ is $y$. Compute $$\left \lfloor \frac{y^2 +1}{y} \right \rfloor$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165983p28809209]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166045p28809814]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The right prism $[A_1A_2A_3\ldots A_nA_1'A_2'A_3'\ldots A_n'],n\in\mathbb{N},n\ge 3$, has a convex polygon as its base. It is known that $A_1A_2'\perp A_2A_3',A_2A_3'\perp A_3A_4',$$\ldots A_{n-1}A_n'\perp A_nA_1', A_nA_1'\perp A_1A_2'$. Show that: $a)$ $n=3$; $b)$ the prism is regular.

Recall that for an arbitrary prime $p$, we define a [b]primitive root[/b] modulo $p$ as an integer $r$ for which the least positive integer $v$ such that $r^{v}\equiv 1\pmod{p}$ is $p-1$.\\ Prove or disprove the following statement: [center] For every prime $p>2023$, there exists positive integers $1\leqslant a<b<c<p$\\ such that $a,b$ and $c$ are primitive roots modulo $p$ but $abc$ is not a primitive root modulo $p$. [/center]

Five test scores have a mean (average score) of $90$, a median (middle score) of $91$ and a mode (most frequent score) of $94$. The sum of the two lowest test scores is $\text{(A)}\ 170 \qquad \text{(B)}\ 171 \qquad \text{(C)}\ 176 \qquad \text{(D)}\ 177 \qquad \text{(E)}\ \text{not determined by the information given}$

The degree measures of the angles of nondegenerate hexagon $ABCDEF$ are integers that form a non-constant arithmetic sequence in some order, and $\angle A$ is the smallest angle of the (not necessarily convex) hexagon. Compute the sum of all possible degree measures of $\angle A$. [i]Proposed by Lewis Chen[/i]

Find the minimum value of $k$ such that there exists two sequence ${a_i},{b_i}$ for $i=1,2,\cdots ,k$ that satisfies the following conditions. (i) For all $i=1,2,\cdots ,k,$ $a_i,b_i$ is the element of $S=\{1996^n|n=0,1,2,\cdots\}.$ (ii) For all $i=1,2,\cdots, k, a_i\ne b_i.$ (iii) For all $i=1,2,\cdots, k, a_i\le a_{i+1}$ and $b_i\le b_{i+1}.$ (iv) $\sum_{i=1}^{k} a_i=\sum_{i=1}^{k} b_i.$

Let $A$ be a $101$-element subset of the set $S=\{1,2,\ldots,1000000\}$. Prove that there exist numbers $t_1$, $t_2, \ldots, t_{100}$ in $S$ such that the sets \[ A_j=\{x+t_j\mid x\in A\},\qquad j=1,2,\ldots,100 \] are pairwise disjoint.

Let $ABC$ be an isosceles triangle, in which $AB=AC$ , and let $M$ and $N$ be two points on the sides $BC$ and $AC$, respectively such that $\angle BAM = \angle MNC$. Suppose that the lines $MN$ and $AB$ intersects at $P$. Prove that the bisectors of the angles $\angle BAM$ and $\angle BPM$ intersects at a point lying on the line $BC$

There are relatively prime positive integers $m$ and $n$ so that the parabola with equation $y = 4x^2$ is tangent to the parabola with equation $x = y^2 + \frac{m}{n}$ . Find $m + n$.

Let $ g: \mathbb{C} \rightarrow \mathbb{C}$, $ \omega \in \mathbb{C}$, $ a \in \mathbb{C}$, $ \omega^3 \equal{} 1$, and $ \omega \ne 1$. Show that there is one and only one function $ f: \mathbb{C} \rightarrow \mathbb{C}$ such that \[ f(z) \plus{} f(\omega z \plus{} a) \equal{} g(z),z\in \mathbb{C} \]

Albrecht is travelling in his car on the motorway at a constant speed. The journey is very long so Marvin who is sitting next to Albrecht gets bored and decides to calculate the speed of the car. He was a bit careless but he noted that at noon they passed milestone $XY$ (where $X$ and $Y$ are digits), at $12:42$ milestone $YX$ and at $1$pm they arrived at milestone $X0Y$. What did Marvin deduce, what is the speed of the car?

Suppose that $ a$, $ b$, $ c$ are positive real numbers, prove that \[ 1 < \frac {a}{\sqrt {a^{2} \plus{} b^{2}}} \plus{} \frac {b}{\sqrt {b^{2} \plus{} c^{2}}} \plus{} \frac {c}{\sqrt {c^{2} \plus{} a^{2}}}\leq\frac {3\sqrt {2}}{2} \]

Let $f$ be a polynomial of degree $98$, such that $f (k) =\frac{1}{k}$ for $k=1,2,3,\ldots,99$. Determine $f(100)$.

Let $N(n)$ denote the smallest positive integer $N$ such that $x^N =e$ for every element $x$ of the symmetric group $S_n$, where $e$ denotes the identity permutation. Prove that if $n>1,$ $$\frac{N(n)}{N(n-1)} =\begin{cases} p \;\text{if}\; n\; \text{is a power of a prime } p\\ 1\; \text{otherwise}. \end{cases}$$

If two circles intersect at $A,B$ and common tangents of them intesrsect circles at $C,D$if $O_a$is circumcentre of $ACD$ and $O_b$ is circumcentre of $BCD$ prove $AB$ intersects $O_aO_b$ at its midpoint

In a triangle $ABC$, the bisectors of angles $A$ and $B$ meet the opposite sides of the triangle at points $D$ and $E$, respectively. A point $P$ is arbitrarily chosen on the line $DE$. Prove that the distance of $P$ from line $AB$ equals the sum or the difference of the distances of $P$ from lines $AC$ and $BC$.

Given a triangle $ABC$ with symmedians $BE,CF(E,F$ are on the sides $CA,AB,$ respectively$)$ intersecting at [i]Lemoine[/i] point $L.$ Prove that: $AB=AC$ in each case: a) $LB=LC.$ b) $BE=CF.$

Consider the set $A = \{1, 2, 3, ..., 2008\}$. We say that a set is of [i]type[/i] $r, r \in \{0, 1, 2\}$, if that set is a nonempty subset of $A$ and the sum of its elements gives the remainder $r$ when divided by $3$. Denote by $X_r, r \in \{0, 1, 2\}$ the class of sets of type $r$. Determine which of the classes $X_r, r \in \{0, 1, 2\}$, is the largest.

[i]Version 1[/i]. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \] [i]Version 2[/i]. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]