[u]Round 1[/u]

[b]1.1.[/b] A classroom has $29$ students. A teacher needs to split up the students into groups of at most $4$. What is the minimum number of groups needed?

[b]1.2.[/b] On his history map quiz, Eric recalls that Sweden, Norway and Finland are adjacent countries, but he has
forgotten which is which, so he labels them in random order. The probability that he labels all three countries
correctly can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

[b]1.3.[/b] In a class of $40$ sixth graders, the class average for their final test comes out to be $90$ (out of a $100$). However, a student brings up an issue with problem $5$, and $10$ students receive credit for this question, bringing the class average to a $90.75$. How many points was problem $5$ worth?

[u]Round 2[/u]

[b]2.1.[/b] Compute $1 - 2 + 3 - 4 + ... - 2022 + 2023$.

[b]2.2.[/b] In triangle $ABC$, $\angle ABC = 75^o$. Point $D$ lies on side $AC$ such that $BD = CD$ and $\angle BDC$ is a right angle. Compute the measure of $\angle A$.

[b]2.3.[/b] Joe is rolling three four-sided dice each labeled with positive integers from $1$ to $4$. The probability the sum of the numbers on the top faces of the dice is $6$ can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime integers. Find $p + q$.

[u]Round 3[/u]

[b]3.1.[/b] For positive integers $a, b, c, d$ that satisfy $a + b + c + d = 23$, what is the maximum value of $abcd$?

[b]3.2.[/b] A buckball league has twenty teams. Each of the twenty teams plays exactly five games with each of the other teams. If each game takes 1 hour and thirty minutes, then how many total hours are spent playing games?

[b]3.3.[/b] For a triangle $\vartriangle ABC$, let $M, N, O$ be the midpoints of $AB$, $BC$, $AC$, respectively. Let $P, Q, R$ be points on $AB$, $BC$, $AC$ such that $AP =\frac13 AB$, $BQ =\frac13 BC$, and $CR =\frac13 AC$. The ratio of the areas of $\vartriangle MNO$ and $\vartriangle P QR$ can be expressed as $\frac{m}{n}$ , where $ m$ and $n$ are relatively prime positive integers. Find $m + n$.

[u]Round 4[/u]

[b]4.1.[/b] $2023$ has the special property that leaves a remainder of $1$ when divided by $2$, $21$ when divided by $22$, and $22$ when divided by $23$. Let $n$ equal the lowest integer greater than $2023$ with the above properties. What is $n$?

[b]4.2.[/b] Ants $A, B$ are on points $(0, 0)$ and $(3, 3)$ respectively, and ant A is trying to get to $(3, 3)$ while ant $B$ is trying to get to $(0, 0)$. Every second, ant $A$ will either move up or right one with equal probability, and ant $B$ will move down or left one with equal probability. The probability that the ants will meet each other be $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Find $a + b$.

[b]4.3.[/b] Find the number of trailing zeros of $100!$ in base $ 49$.


PS. You should  use hide for answers. Rounds 5-9 have been posted [url=https://artofproblemsolving.com/community/c3h3129723p28347714]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
1. **Problem 1.1:**
   To find the minimum number of groups needed to split 29 students into groups of at most 4, we use the ceiling function to determine the smallest integer greater than or equal to the division of 29 by 4.
   \[
   \left\lceil \frac{29}{4} \right\rceil = \left\lceil 7.25 \right\rceil = 8
   \]
   Therefore, the minimum number of groups needed is \( \boxed{8} \).

2. **Problem 1.2:**
   Eric labels the three countries in random order. The total number of permutations of three countries is \(3! = 6\). Only one of these permutations is correct.
   \[
   \text{Probability} = \frac{1}{6}
   \]
   The fraction \(\frac{1}{6}\) is already in simplest form, so \(m = 1\) and \(n = 6\). Thus, \(m + n = 1 + 6 = \boxed{7}\).

3. **Problem 1.3:**
   The initial total score for the class is:
   \[
   90 \times 40 = 3600
   \]
   After the adjustment, the new total score is:
   \[
   90.75 \times 40 = 3630
   \]
   The increase in total score is:
   \[
   3630 - 3600 = 30
   \]
   Since 10 students received extra credit, the points per student for problem 5 is:
   \[
   \frac{30}{10} = 3
   \]
   Therefore, problem 5 was worth \( \boxed{3} \) points.

4. **Problem 2.1:**
   We need to compute the alternating sum:
   \[
   1 - 2 + 3 - 4 + \ldots - 2022 + 2023
   \]
   Grouping the terms in pairs:
   \[
   (1 - 2) + (3 - 4) + \ldots + (2021 - 2022) + 2023
   \]
   Each pair sums to \(-1\), and there are 1011 such pairs:
   \[
   -1 \times 1011 + 2023 = -1011 + 2023 = 1012
   \]
   Therefore, the result is \( \boxed{1012} \).

5. **Problem 2.2:**
   Given \(BD = CD\) and \(\angle BDC = 90^\circ\), triangle \(BDC\) is an isosceles right triangle. Thus, \(\angle CBD = 45^\circ\). Since \(\angle ABC = 75^\circ\):
   \[
   \angle DBA = 75^\circ - 45^\circ = 30^\circ
   \]
   In triangle \(ABD\), \(\angle A\) is:
   \[
   \angle A = 180^\circ - 30^\circ - 90^\circ = 60^\circ
   \]
   Therefore, \(\angle A = \boxed{60^\circ}\).

6. **Problem 2.3:**
   The total number of possible outcomes when rolling three four-sided dice is:
   \[
   4^3 = 64
   \]
   We need to find the number of outcomes where the sum is 6. The possible combinations are:
   - (4, 1, 1): 3 ways (since the 1s are indistinguishable)
   - (3, 2, 1): \(3! = 6\) ways
   - (2, 2, 2): 1 way

   Total favorable outcomes:
   \[
   3 + 6 + 1 = 10
   \]
   Probability:
   \[
   \frac{10}{64} = \frac{5}{32}
   \]
   Therefore, \(p = 5\) and \(q = 32\), so \(p + q = 5 + 32 = \boxed{37}\).

7. **Problem 3.1:**
   To maximize \(abcd\) given \(a + b + c + d = 23\), we want the values to be as close as possible. The optimal values are \(a = 5\) and \(b = c = d = 6\):
   \[
   5 \cdot 6 \cdot 6 \cdot 6 = 5 \cdot 216 = 1080
   \]
   Therefore, the maximum value is \( \boxed{1080} \).

8. **Problem 3.2:**
   Each team plays 5 games with each of the other 19 teams. Total games:
   \[
   \frac{20 \times 19 \times 5}{2} = 950
   \]
   Each game takes 1.5 hours:
   \[
   950 \times 1.5 = 1425
   \]
   Therefore, the total hours spent playing games is \( \boxed{1425} \).

9. **Problem 3.3:**
   Using barycentric coordinates, the areas of \(\triangle MNO\) and \(\triangle PQR\) are:
   \[
   [MNO] = \frac{1}{4}[ABC], \quad [PQR] = \frac{1}{3}[ABC]
   \]
   Ratio:
   \[
   \frac{[MNO]}{[PQR]} = \frac{\frac{1}{4}}{\frac{1}{3}} = \frac{3}{4}
   \]
   Therefore, \(m = 3\) and \(n = 4\), so \(m + n = 3 + 4 = \boxed{7}\).

10. **Problem 4.1:**
    We need \(n\) such that:
    \[
    n \equiv -1 \pmod{2}, \quad n \equiv -1 \pmod{22}, \quad n \equiv -1 \pmod{23}
    \]
    This implies:
    \[
    n \equiv -1 \pmod{506}
    \]
    The smallest \(n > 2023\) is:
    \[
    2023 + 506 = 2529
    \]
    Therefore, \(n = \boxed{2529}\).

11. **Problem 4.2:**
    The probability that the ants meet after 3 moves:
    \[
    (2^3)^2 = 8^2 = 64
    \]
    Number of ways they can meet:
    \[
    2\binom{3}{0}^2 + 2\binom{3}{1}^2 = 2 \cdot 1^2 + 2 \cdot 3^2 = 2 + 18 = 20
    \]
    Probability:
    \[
    \frac{20}{64} = \frac{5}{16}
    \]
    Therefore, \(a = 5\) and \(b = 16\), so \(a + b = 5 + 16 = \boxed{21}\).

12. **Problem 4.3:**
    To find the number of trailing zeros of \(100!\) in base \(49\):
    \[
    \nu_{49}(100!) = \left\lfloor \frac{\nu_7(100!)}{2} \right\rfloor
    \]
    \[
    \nu_7(100!) = \left\lfloor \frac{100}{7} \right\rfloor + \left\lfloor \frac{100}{49} \right\rfloor = 14 + 2 = 16
    \]
    \[
    \left\lfloor \frac{16}{2} \right\rfloor = 8
    \]
    Therefore, the number of trailing zeros is \( \boxed{8} \).