[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].
### p1
1. **Total Paths Calculation**:
   - A path from \((0,0)\) to \((4,4)\) can be represented as a sequence of 4 'U' (up) moves and 4 'R' (right) moves.
   - The total number of such sequences is given by the binomial coefficient:
     \[
     \binom{8}{4} = \frac{8!}{4!4!} = 70
     \]

2. **Paths Through \((2,2)\)**:
   - To go from \((0,0)\) to \((2,2)\), we need 2 'U' and 2 'R' moves. The number of such sequences is:
     \[
     \binom{4}{2} = \frac{4!}{2!2!} = 6
     \]
   - Similarly, to go from \((2,2)\) to \((4,4)\), we again need 2 'U' and 2 'R' moves, which also gives:
     \[
     \binom{4}{2} = 6
     \]
   - Therefore, the total number of paths passing through \((2,2)\) is:
     \[
     6 \times 6 = 36
     \]

3. **Paths Avoiding \((2,2)\)**:
   - Subtract the number of paths passing through \((2,2)\) from the total number of paths:
     \[
     70 - 36 = 34
     \]

The final answer is \(\boxed{1}\)