[b]p1.[/b] If $a \diamond b = ab - a + b$, find $(3 \diamond 4) \diamond 5$


[b]p2.[/b] If $5$ chickens lay $5$ eggs in $5$ days, how many chickens are needed to lay $10$ eggs in $10$ days?


[b]p3.[/b] As Alissa left her house to go to work one hour away, she noticed that her odometer read $16261$ miles. This number is a "special" number for Alissa because it is a palindrome and it contains exactly $1$ prime digit. When she got home that evening, it had changed to the next greatest "special" number. What was Alissa's average speed, in miles per hour, during her two hour trip?


[b]p4.[/b] How many $1$ in by $3$ in by $8$ in blocks can be placed in a $4$ in by $4$ in by $9$ in box?


[b]p5.[/b] Apple loves eating bananas, but she prefers unripe ones. There are $12$ bananas in each bunch sold. Given any bunch, if there is a $\frac13$ probability that there are $4$ ripe bananas, a $\frac16$ probability that there are $6$ ripe bananas, and a $\frac12$ probability that there are $10$ ripe bananas, what is the expected number of unripe bananas in $12$ bunches of bananas?


[b]p6.[/b] The sum of the digits of a $3$-digit number $n$ is equal to the same number without the hundreds digit. What is the tens digit of $n$?


[b]p7.[/b] How many ordered pairs of positive integers $(a, b)$ satisfy $a \le 20$, $b \le 20$, $ab > 15$?


[b]p8.[/b] Let $z(n)$ represent the number of trailing zeroes of $n!$. What is $z(z(6!))?$ 
(Note: $n! = n\cdot  (n-1) \cdot\cdot\cdot 2 \cdot 1$) 


[b]p9.[/b] On the Cartesian plane, points $A = (-1, 3)$, $B = (1, 8)$, and $C = (0, 10)$ are marked. $\vartriangle ABC$ is reflected over the line $y = 2x + 3$ to obtain $\vartriangle A'B'C'$. The sum of the $x$-coordinates of the vertices of $\vartriangle A'B'C'$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Compute $a + b$.


[b]p10.[/b] How many ways can Bill pick three distinct points from the figure so that the points form a non-degenerate triangle?
[img]https://cdn.artofproblemsolving.com/attachments/6/a/8b06f70d474a071b75556823f70a2535317944.png[/img]

[b]p11.[/b] Say piece $A$ is attacking piece $B$ if the piece $B$ is on a square that piece $A$ can move to. How many ways are there to place a king and a rook on an $8\times 8$ chessboard such that the rook isn't attacking the king, and the king isn't attacking the rook? Consider rotations of the board to be indistinguishable. (Note: rooks move horizontally or vertically by any number of squares, while kings move $1$ square adjacent horizontally, vertically, or diagonally).


[b]p12.[/b] Let the remainder when $P(x) = x^{2020} - x^{2017} - 1$ is divided by $S(x) = x^3 - 7$ be the polynomial $R(x) = ax^2 + bx + c$ for integers $a$, $b$, $c$. Find the remainder when $R(1)$ is divided by $1000$.


[b]p13.[/b] Let $S(x) = \left \lfloor \frac{2020}{x} \right\rfloor + \left \lfloor \frac{2020}{x + 1} \right\rfloor$. Find the number of distinct values $S(x)$ achieves for integers $x$ in the interval $[1, 2020]$.


[b]p14.[/b] Triangle $\vartriangle ABC$ is inscribed in a circle with center $O$ and has sides $AB = 24$, $BC = 25$, $CA = 26$. Let $M$ be the midpoint of $\overline{AB}$.  Points $K$ and $L$ are chosen on sides $\overline{BC}$ and $\overline{CA}$, respectively such that $BK < KC$ and $CL < LA$. Given that $OM = OL = OK$,  the area of triangle $\vartriangle MLK$ can be expressed as $\frac{a\sqrt{b}}{c}$ where $a, b, c$ are positive integers, $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime. Find $a + b + c$.


[b]p15.[/b] Euler's totient function, $\phi (n)$, is defined as the number of positive integers less than $n$ that are relatively prime to $n$. Let $S(n)$ be the set of composite divisors of $n$. Evaluate $$\sum^{50}_{k=1}\left( k - \sum_{d\in S(k)} \phi (d) \right)$$


PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
To solve the problem, we need to find the number of trailing zeroes in \(6!\) and then find the number of trailing zeroes in that result.

1. **Calculate \(z(6!)\):**
   The number of trailing zeroes in \(n!\) is given by the formula:
   \[
   z(n!) = \left\lfloor \frac{n}{5} \right\rfloor + \left\lfloor \frac{n}{25} \right\rfloor + \left\lfloor \frac{n}{125} \right\rfloor + \cdots
   \]
   For \(n = 6\):
   \[
   z(6!) = \left\lfloor \frac{6}{5} \right\rfloor + \left\lfloor \frac{6}{25} \right\rfloor + \left\lfloor \frac{6}{125} \right\rfloor + \cdots
   \]
   Since \(\left\lfloor \frac{6}{5} \right\rfloor = 1\) and all other terms are zero:
   \[
   z(6!) = 1
   \]

2. **Calculate \(z(z(6!))\):**
   We need to find the number of trailing zeroes in \(1!\):
   \[
   z(1!) = \left\lfloor \frac{1}{5} \right\rfloor + \left\lfloor \frac{1}{25} \right\rfloor + \left\lfloor \frac{1}{125} \right\rfloor + \cdots
   \]
   Since all terms are zero:
   \[
   z(1!) = 0
   \]

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