[b]p1.[/b] Consider a $4 \times 4$ lattice on the coordinate plane. At $(0,0)$ is Mori’s house, and at $(4,4)$ is Mori’s workplace. Every morning, Mori goes to work by choosing a path going up and right along the roads on the lattice. Recently, the intersection at $(2, 2)$ was closed. How many ways are there now for Mori to go to work? [b]p2.[/b] Given two integers, define an operation $*$ such that if a and b are integers, then a $*$ b is an integer. The operation $*$ has the following properties: 1. $a * a$ = 0 for all integers $a$. 2. $(ka + b) * a = b * a$ for integers $a, b, k$. 3. $0 \le b * a < a$. 4. If $0 \le b < a$, then $b * a = b$. Find $2017 * 16$. [b]p3.[/b] Let $ABC$ be a triangle with side lengths $AB = 13$, $BC = 14$, $CA = 15$. Let $A'$, $B'$, $C'$, be the midpoints of $BC$, $CA$, and $AB$, respectively. What is the ratio of the area of triangle $ABC$ to the area of triangle $A'B'C'$? [b]p4.[/b] In a strange world, each orange has a label, a number from $0$ to $10$ inclusive, and there are an infinite number of oranges of each label. Oranges with the same label are considered indistinguishable. Sally has 3 boxes, and randomly puts oranges in her boxes such that (a) If she puts an orange labelled a in a box (where a is any number from 0 to 10), she cannot put any other oranges labelled a in that box. (b) If any two boxes contain an orange that have the same labelling, the third box must also contain an orange with that labelling. (c) The three boxes collectively contain all types of oranges (oranges of any label). The number of possible ways Sally can put oranges in her $3$ boxes is $N$, which can be written as the product of primes: $$p_1^{e_1} p_2^{e_2}... p_k^{e_k}$$ where $p_1 \ne p_2 \ne p_3 ... \ne p_k$ and $p_i$ are all primes and $e_i$ are all positive integers. What is the sum $e_1 + e_2 + e_3 +...+ e_k$? [b]p5.[/b] Suppose I want to stack $2017$ identical boxes. After placing the first box, every subsequent box must either be placed on top of another one or begin a new stack to the right of the rightmost pile. How many different ways can I stack the boxes, if the order I stack them doesn’t matter? Express your answer as $$p_1^{e_1} p_2^{e_2}... p_n^{e_n}$$ where $p_1, p_2, p_3, ... , p_n$ are distinct primes and $e_i$ are all positive integers. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let circles $ \Gamma $ and $ \omega $ are circumcircle and incircle of the triangle $ABC$, the incircle touches sides $BC,CA,AB$ at the points $A_1,B_1,C_1$. Let $A_2$ and $B_2$ lies the lines $A_1I$ and $B_1I$ ($A_1$ and $A_2$ lies different sides from $I$, $B_1$ and $B_2$ lies different sides from $I$) such that $IA_2=IB_2=R$. Prove that : (a) $AA_2=BB_2=IO$; (b) The lines $AA_2$ and $BB_2$ intersect on the circle $ \Gamma ;$

$(GDR 1)$ Find all real numbers $\lambda$ such that the equation $\sin^4 x - \cos^4 x = \lambda(\tan^4 x - \cot^4 x)$ $(a)$ has no solution, $(b)$ has exactly one solution, $(c)$ has exactly two solutions, $(d)$ has more than two solutions (in the interval $(0, \frac{\pi}{4}).$

Let $P$ and $Q$ be points on line $\ell$ with $PQ = 12$. Two circles, $\omega$ and ­$\Omega$, are both tangent to $\ell$ at $P$ and are externally tangent to each other. A line through $Q$ intersects $\omega$ at $A$ and $B$, with $A$ closer to $Q$ than $B$, such that $AB = 10$. Similarly, another line through $Q$ intersects ­ ­$\Omega$ at $C$ and $D$, with $C$ closer to $Q$ than $D$, such that $CD = 7$. Find the ratio $AD/BC$.

Let $ABCDE$ be a pentagon such that $\angle DCB < 90^{\circ} < \angle EDC$. The circle with diameter $BD$ intersects the line $BC$ again at $F$, and the circle with diameter $DE$ intersects the line $CE$ again at $G$. Prove that the second intersection ($\neq D$) of the circumcircle of $\triangle DFG$ and the circle with diameter $AD$ lies on $AC$. Proposed by [i]Petar Filipovski[/i]

Let $A_{1}A_{2}B_{1}B_{2}$ be a convex quadrilateral. At adjacent vertices $A_{1}$ and $A_{2}$ there are two Argentinian cities. At adjacent vertices $B_{1}$ and $B_{2}$ there are two Brazilian cities. There are $a$ Argentinian cities and $b$ Brazilian cities in the quadrilateral interior, no three of which collinear. Determine if it's possible, independently from the cities position, to build straight roads, each of which connects two Argentinian cities ou two Brazilian cities, such that: $\bullet$ Two roads does not intersect in a point which is not a city; $\bullet$ It's possible to reach any Argentinian city from any Argentinian city using the roads; and $\bullet$ It's possible to reach any Brazilian city from any Brazilian city using the roads. If it's always possible, construct an algorithm that builds a possible set of roads.

Suppose $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function such that $$f^n(n) = 2n$$ for all $n\in \mathbb{N}$. Must $f(n) = n+1$ for all $n$?

Let $ABCD$ be a circumscribed quadrilateral. Prove that the common point of the diagonals, the incenter of triangle $ABC$ and the centre of excircle of triangle $CDA$ touching the side $AC$ are collinear.

Find the number of positive integers $n$ not greater than 2017 such that $n$ divides $20^n + 17k$ for some positive integer $k$.

Let $ABCD$ be a isosceles trapezoid such that $AB || CD$ and all of its sides are tangent to a circle. $[AD]$ touches this circle at $N$. $NC$ and $NB$ meet the circle again at $K$ and $L$, respectively. What is $\dfrac {|BN|}{|BL|} + \dfrac {|CN|}{|CK|}$? $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 10 $

Find all pairs of integers $(x,y)$ satisfying the following condition: [i]each of the numbers $x^3 + y$ and $x + y^3$ is divisible by $x^2 + y^2$ [/i] Tournament of Towns

$64$ people are in a single elimination rock-paper-scissors tournament, which consists of a $6$-round knockout bracket. Each person has a different rock-paper-scissors skill level, and in any game, the person with the higher skill level will always win. For how many players $P$ is it possible that $P$ wins the first four rounds that he plays? (A $6$-round knockout bracket is a tournament which works as follows: (a) In the first round, all 64 competitors are paired into $32$ groups, and the two people in each group play each other. The winners advance to the second round, and the losers are eliminated. (b) In the second round, the remaining $32$ players are paired into $16$ groups. Again, the winner of each group proceeds to the next round, while the loser is eliminated. (c) Each round proceeds in a similar way, eliminating half of the remaining players. After the sixth round, only one player will not have been eliminated. That player is declared the champion.) [i]In the game of rock-paper-scissors, two players each choose one of rock, paper, or scissors to play. Rock beats scissors, scissors beats paper, and paper beats rock. If the players play the same thing, the match is considered a draw.[/i]

If $d$ is a positive integer such that $d \mid 5+2022^{2022}$, show that $d=2x^2+2xy+3y^2$ for some $x, y \in \mathbb{Z}$ iff $d \equiv 3,7 \pmod {20}$.

Evaluate $\int_{-a}^a \left(x+\frac{1}{\sin x+\frac{1}{e^x-e^{-x}}}\right)dx\ (a>0)$. created by kunny

How many positive integers $n$ are there such that $n+2$ divides $(n+18)^2$?

Given a random string of 33 bits (0 or 1), how many (they can overlap) occurrences of two consecutive 0's would you expect? (i.e. "100101" has 1 occurrence, "0001" has 2 occurrences)