Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$, at least one of the first $k$ terms of the permutation is greater than $k$.
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$, $BC = 14$, and $AD = 2\sqrt{65}$. Assume that the diagonals of $ABCD$ intersect at point $P$, and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$. Find the area of quadrilateral $ABCD$.
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. Find the probability that she will roll the die an odd number of times.
The incircle $\omega$ of triangle $ABC$ is tangent to $\overline{BC}$ at $X$. Let $Y \neq X$ be the other intersection of $\overline{AX}$ with $\omega$. Points $P$ and $Q$ lie on $\overline{AB}$ and $\overline{AC}$, respectively, so that $\overline{PQ}$ is tangent to $\omega$ at $Y$. Assume that $AP = 3$, $PB = 4$, $AC = 8$, and $AQ = \dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Find the number of functions $f$ from $\{0, 1, 2, 3, 4, 5, 6\}$ to the integers such that $f(0) = 0$, $f(6) = 12$, and $|x - y|$ $\leq$ $|f(x) - f(y)|$ $\leq$ $3|x - y|$ for all $x$ and $y$ in $\{0, 1, 2, 3, 4, 5, 6\}$.
Compute: $1\times 2\times 3 + 2\times 3\times 4 + \cdots + 18\times 19\times 20$.
Let $x_1$ and $x_2$ be the two roots of equation $x^2 − 3x + 2 = 0$. Find the following values without computing $x_1$ and $x_2$ directly.
i) $x_1^4 + x_2^4$
ii) $x_1 - x_2$
(Note: for (i) above, how many different solutions can you find?)
Find the sum of all possible integer values of $a$ such that the equation $(a + 1)x^2-(a^2 + 1)x + (2a^2 − 6) = 0$ is solvable in integers.
Find the number of non-negative integer solutions to the following equation: $$x_1+x_2+\cdots+x_5=14$$
Find the number of integer solutions to the following equation: $$x_1+x_2+\cdots+x_6=12$$
where $x_1, x_5\ge 0$ and $x_2, x_3, x_4 > 0$
(Hockey Sticker Identity) Show that for any positive integer $n \ge k$, the following relationship holds: $$\binom{k}{k} +\binom{k+1}{k} + \binom{k+2}{k} + \cdots + \binom{n}{k} = \binom{n+1}{k+1} $$
Find the number of integer pairs $(x, y)$ such that $x^2 + y^2 = 2019$.
If a square number's tens digit is $7$, what is its units digit?
There are $100$ lights lined up in a long room. Each light has its own switch and is currently off. The room has an entry door and an exit door. There are $100$ people lined up outside the entry door. Each light is numbered consecutively from $1$ to $100$. So is each person.
Person No. $1$ enters the room, switches on every light, and exits. Person No. $2$ enters and flips the switch on every second light (i.e. turn off lights $2$, $4$, $6$...). Person No. $3$ enters and flips the switch on every third light (i.e. toggle lights $3$, $6$, $9$...). This continues until all $100$ people have passed through the room. How many of the lights are on at the end?
Let $n^2$ be a square number, show that $n^2\equiv 0, 1\pmod{4}$.
Show that if $n^2$ is a square number, then $n^2\equiv 0, 1, 4, 9\pmod{16}$.
In plain English, this means that the remainder can only be $0$, $1$, $4$ or $9$ when a square number is divided by $16$.
Find the number of non-decrease sequences of length $n$ and each element is a non-negative integer not exceeding $d$.
Find, with proof, all pairs of positive integers $(n, d)$ with the following property: for every integer $S$, there exists a unique non-decreasing sequence of n integers $a_1$, $a_2$, $\cdots$, $a_n$ such that $a_1 + a_2 + \cdots + a_n = S$ and $a_n-a_1 = d$.
How many terms in this sequence are squares? $$1, 11, 111, 1111, \cdots $$
How many terms in this sequence are squares? $$4, 44, 444, 4444, \cdots$$
Let $N$ be an odd square number. Show that $N$'s tens digit must be even.
Let $N$ be a square number. If its units digit is $6$, then its tens digit must be odd.