[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$
($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits).


[b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table:
the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game.
 a) The player who makes the first move can win the game.  What is the winning first move?
 b) How can he win? (Describe his strategy.)


[b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover?


[b]p4.[/b]  Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back.


[b]p5.[/b]  (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line.
(b) Do the same with $6$ points. 


PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
**p4.** Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back.

To solve this problem, we need to find the smallest amount of money \( x \) such that \( x - 1 \) can be expressed as a combination of $\$5$ and $\$7$ bills. This means we need to find the smallest \( x \) such that:

\[ x - 1 = 5a + 7b \]

where \( a \) and \( b \) are non-negative integers.

1. Start by testing small values of \( x \):

   - For \( x = 2 \):
     \[ 2 - 1 = 1 \]
     \( 1 \) cannot be expressed as \( 5a + 7b \).

   - For \( x = 3 \):
     \[ 3 - 1 = 2 \]
     \( 2 \) cannot be expressed as \( 5a + 7b \).

   - For \( x = 4 \):
     \[ 4 - 1 = 3 \]
     \( 3 \) cannot be expressed as \( 5a + 7b \).

   - For \( x = 5 \):
     \[ 5 - 1 = 4 \]
     \( 4 \) cannot be expressed as \( 5a + 7b \).

   - For \( x = 6 \):
     \[ 6 - 1 = 5 \]
     \( 5 \) can be expressed as \( 5 \times 1 + 7 \times 0 \).

2. Therefore, the smallest amount of money \( x \) such that \( x - 1 \) can be expressed as a combination of $\$5$ and $\$7$ bills is \( x = 6 \).

The final answer is \( \boxed{6} \).