
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
<u>Round 5</u>**p13.** In coordinate space, a lattice point is a point all of whose coordinates are integers. The lattice points  $(x, y, z)$  in three-dimensional space satisfying  $0 \le x, y, z \le 5$  are colored in n colors such that any two points that are  $\sqrt3$  units apart have different colors. Determine the minimum possible value of  $n$ .**p14.** Determine the number of ways to express  $121$  as a sum of strictly increasing positive Fibonacci numbers.**p15.** Let  $ABCD$  be a rectangle with  $AB = 7$  and  $BC = 15$ . Equilateral triangles  $ABP$ ,  $BCQ$ ,  $CDR$ , and  $DAS$  are constructed outside the rectangle. Compute the area of quadrilateral  $P QRS$ .


<u>Round 6</u>

Each of the three problems in this round depends on the answer to one of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct.**p16.** Let  $C$  be the answer to problem  $18$ . Suppose that  $x$  and  $y$  are real numbers with  $y > 0$  and  $$ x + y = C $$    $$ x +\frac{1}{y} = -2. $$  Compute  $y +\frac{1}{y}$ .**p17.** Let  $A$  be the answer to problem  $16$ . Let  $P QR$  be a triangle with  $\angle P QR = 90^o$ , and let  $X$  be the foot of the perpendicular from point  $Q$  to segment  $P R$ . Given that  $QX = A$ , determine the minimum possible area of triangle  $PQR$ .**p18.** Let  $B$  be the answer to problem  $17$  and let  $K = 36B$ . Alice, Betty, and Charlize are identical triplets, only distinguishable by their hats. Every day, two of them decide to exchange hats. Given that they each have their own hat today, compute the probability that Alice will have her own hat in  $K$  days.


<u>Round 7</u>**p19.** Find the number of positive integers a such that all roots of  $x^2 + ax + 100$  are real and the sum of their squares is at most  $2013$ .**p20.**  Determine all values of  $k$  such that the system of equations  $$ y = x^2 - kx + 1 $$    $$ x = y^2 - ky + 1 $$  has a real solution.**p21.** Determine the minimum number of cuts needed to divide an  $11 \times 5 \times 3$  block of chocolate into  $1\times 1\times 1$  pieces. (When a block is broken into pieces, it is permitted to rotate some of the pieces, stack some of the pieces, and break any set of pieces along a vertical plane simultaneously.)


<u>Round 8</u>**p22.** A sequence that contains the numbers  $1, 2, 3, ... , n$  exactly once each is said to be a permutation of length  $n$ . A permutation  $w_1w_2w_3... w_n$  is said to be sad if there are indices  $i < j < k$  such that  $w_j > w_k$  and  $w_j > w_i$ . For example, the permutation  $3142756$  is sad because  $7 > 6$  and  $7 > 1$ . Compute the number of permutations of length  $11$  that are not sad.**p23.** Let  $ABC$  be a triangle with  $AB = 39$ ,  $BC = 56$ , and  $CA = 35$ . Compute  $\angle CAB - \angle ABC$  in degrees.**p24.** On a strange planet, there are  $n$  cities. Between any pair of cities, there can either be a one-way road, two one-way roads in different directions, or no road at all. Every city has a name, and at the source of every one-way road, there is a signpost with the name of the destination city. In addition, the one-way roads only intersect at cities, but there can be bridges to prevent intersections at non-cities. Fresh Mann has been abducted by one of the aliens, but Sophy Moore knows that he is in Rome, a city that has no roads leading out of it. Also, there is a direct one-way road leading from each other city to Rome. However, Rome is the secret police’s name for the so-described city; its official name, the name appearing on the labels of the one-way roads, is unknown to Sophy Moore. Sophy Moore is currently in Athens and she wants to head to Rome in order to rescue Fresh Mann, but she does not know the value of  $n$ . Assuming that she tries to minimize the number of roads on which she needs to travel, determine the maximum possible number of roads that she could be forced to travel in order to find Rome. Express your answer as a function of  $n$ .


PS. You should use hide for answers. Rounds 1-4 have been posted [here](https://artofproblemsolving.com/community/c4h2809419p24782489). Collected [here](https://artofproblemsolving.com/community/c5h2760506p24143309).

Present the answer in LaTex format: \boxed{Your answer}
user