Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: Let $N$ be the positive integer $7777\ldots777$ , a $313$ -digit number where each digit is a $7$ . Let $f(r)$ be the leading digit of the $r{ }$ th root of $N$ . What is \[f(2) + f(3) + f(4) + f(5)+ f(6)?\] $(\textbf{A})\: 8\qquad(\textbf{B}) \: 9\qquad(\textbf{C}) \: 11\qquad(\textbf{D}) \: 22\qquad(\textbf{E}) \: 29$

Solution: We can rewrite $N$ as $\frac{7}{9}\cdot 9999\ldots999 = \frac{7}{9}\cdot(10^{313}-1)$ . 
When approximating values, as we will shortly do, the minus one will become negligible so we can ignore it.
When we take the power of ten out of the square root, we’ll be multiplying by another power of ten, so the leading digit will not change. Thus the leading digit of $f(r)$ will be equal to the leading digit of $\sqrt[r]{\frac{7}{9} \cdot 10^{313(\mod r)}}$
Then $f(2)$ is the first digit of $\sqrt{\frac{7}{9}\cdot(10)} = \sqrt{\frac{70}{9}} = \sqrt{7.\ldots} \approx 2$
$f(3) - \sqrt[3]{\frac{7}{9} \cdot 10} = \sqrt[3]{\frac{70}{9}} = \sqrt[3]{7.\ldots} \approx 1$
$f(4) - \sqrt[4]{\frac{7}{9} \cdot 10} = \sqrt[4]{\frac{70}{9}} = \sqrt[4]{7.\ldots} \approx 1$
$f(5) - \sqrt[5]{\frac{7}{9} \cdot 1000} = \sqrt[5]{\frac{7000}{9}} = \sqrt[5]{777.\ldots} \approx 3$
$f(6) - \sqrt[6]{\frac{7}{9} \cdot 10} = \sqrt[6]{\frac{70}{9}} = \sqrt[6]{7.\ldots} \approx 1$
The final answer is therefore $2+1+1+3+1 = \boxed{8}$

Answer: A 8
Problem: Let $N$ be the positive integer $7777\ldots777$ , a $313$ -digit number where each digit is a $7$ . Let $f(r)$ be the leading digit of the $r{ }$ th root of $N$ . What is \[f(2) + f(3) + f(4) + f(5)+ f(6)?\] $(\textbf{A})\: 8\qquad(\textbf{B}) \: 9\qquad(\textbf{C}) \: 11\qquad(\textbf{D}) \: 22\qquad(\textbf{E}) \: 29$

Solution: For notation purposes, let $x$ be the number $777 \ldots 777$ with $313$ digits, and let $B(n)$ be the leading digit of $n$ . As an example, $B(x) = 7$ , because $x = 777 \ldots 777$ , and the first digit of that is $7$
Notice that \[B(\sqrt{\frac{n}{100}}) = B(\sqrt{n})\] ​for all numbers $n \geq 100$ ; this is because $\sqrt{\frac{n}{100}} = \frac{\sqrt{n}}{10}$ , and dividing by $10$ does not affect the leading digit of a number. Similarly, \[B(\sqrt[3]{\frac{n}{1000}}) = B(\sqrt[3]{n}).\] In general, for positive integers $k$ and real numbers $n > 10^{k}$ , it is true that \[B(\sqrt[k]{\frac{n}{10^{k}}}) = B(\sqrt[k]{n}).\] Behind all this complex notation, all that we're really saying is that the first digit of something like $\sqrt[3]{123456789}$ has the same first digit as $\sqrt[3]{123456.789}$ and $\sqrt[3]{123.456789}$
The problem asks for \[B(\sqrt[2]{x}) + B(\sqrt[3]{x}) + B(\sqrt[4]{x}) + B(\sqrt[5]{x}) + B(\sqrt[6]{x}).\]
From our previous observation, we know that \[B(\sqrt[2]{x}) = B(\sqrt[2]{\frac{x}{100}} = B(\sqrt[2]{\frac{x}{10,000}} = B(\sqrt[2]{\frac{x}{1,000,000}} = \ldots .\] Therefore, $B(\sqrt[2]{x}) = B(\sqrt[2]{7.777 \dots})$ . We can evaluate $B(\sqrt[2]{7.777 \dots})$ , the leading digit of $\sqrt[2]{7.777 \dots}$ , to be $2$ . Therefore, $f(2) = 2$
Similarly, we have \[B(\sqrt[3]{x}) = B(\sqrt[3]{\frac{x}{1,000}} = B(\sqrt[3]{\frac{x}{1,000,000}} = B(\sqrt[3]{\frac{x}{1,000,000,000}} = \ldots .\] Therefore, $B(\sqrt[3]{x}) = B(\sqrt[3]{7.777 \ldots})$ . We know $B(\sqrt[3]{7.777 \ldots}) = 1$ , so $f(3) = 1$
Next, \[B(\sqrt[4]{x}) = B(\sqrt[4]{7.777 \ldots})\] and $B(\sqrt[4]{7.777 \ldots}) = 1$ , so $f(4) = 1$
We also have \[B(\sqrt[5]{x}) = B(\sqrt[5]{777.777 \ldots})\] and $B(\sqrt[5]{777.777 \ldots}) = 3$ , so $f(5) = 3$
Finally, \[B(\sqrt[6]{x}) = B(\sqrt[6]{7.777 \ldots})\] and $B(\sqrt[4]{7.777 \ldots}) = 1$ , so $f(6) = 1$
We have that $f(2)+f(3)+f(4)+f(5)+f(6) = 2+1+1+3+1 = \boxed{8}$

Answer: A 8
Problem: Let $N$ be the positive integer $7777\ldots777$ , a $313$ -digit number where each digit is a $7$ . Let $f(r)$ be the leading digit of the $r{ }$ th root of $N$ . What is \[f(2) + f(3) + f(4) + f(5)+ f(6)?\] $(\textbf{A})\: 8\qquad(\textbf{B}) \: 9\qquad(\textbf{C}) \: 11\qquad(\textbf{D}) \: 22\qquad(\textbf{E}) \: 29$

Solution: Since $7777..7$ is a $313$ digit number and $\sqrt {7}$ is around $2.5$ , we have $f(2)$ is $2$ $f(3)$ is the same story, so $f(3)$ is $1$ . It is the same as $f(4)$ as well, so $f(4)$ is also $1$ . However, $313$ is $3$ mod $5$ , so we need to take the 5th root of $777$ , which is between $3$ and $4$ , and therefore, $f(5)$ is $3$ $f(6)$ is the same as $f(4)$ , since it is $1$ more than a multiple of $6$ . Therefore, we have $2+1+1+3+1$ which is $\boxed{8}$

Answer: A 8
Problem: Let $N$ be the positive integer $7777\ldots777$ , a $313$ -digit number where each digit is a $7$ . Let $f(r)$ be the leading digit of the $r{ }$ th root of $N$ . What is \[f(2) + f(3) + f(4) + f(5)+ f(6)?\] $(\textbf{A})\: 8\qquad(\textbf{B}) \: 9\qquad(\textbf{C}) \: 11\qquad(\textbf{D}) \: 22\qquad(\textbf{E}) \: 29$

Solution: First, we compute $f \left( 2 \right)$
Because $N > 4 \cdot 10^{312}$ $\sqrt{N} > 2 \cdot 10^{156}$ .
Because $N < 9 \cdot 10^{312}$ $\sqrt{N} < 3 \cdot 10^{156}$
Therefore, $f \left( 2 \right) = 2$
Second, we compute $f \left( 3 \right)$
Because $N > 1 \cdot 10^{312}$ $\sqrt[3]{N} > 1 \cdot 10^{104}$ .
Because $N < 8 \cdot 10^{312}$ $\sqrt[3]{N} < 2 \cdot 10^{104}$
Therefore, $f \left( 3 \right) = 1$
Third, we compute $f \left( 4 \right)$
Because $N > 1 \cdot 10^{312}$ $\sqrt[4]{N} > 1 \cdot 10^{78}$ .
Because $N < 16 \cdot 10^{312}$ $\sqrt[4]{N} < 2 \cdot 10^{78}$
Therefore, $f \left( 4 \right) = 1$
Fourth, we compute $f \left( 5 \right)$
Because $N > 3^5 \cdot 10^{310}$ $\sqrt[5]{N} > 3 \cdot 10^{62}$ .
Because $N < 4^5 \cdot 10^{310}$ $\sqrt[5]{N} < 4 \cdot 10^{62}$
Therefore, $f \left( 5 \right) = 3$
Fifth, we compute $f \left( 6 \right)$
Because $N > 1 \cdot 10^{312}$ $\sqrt[6]{N} > 1 \cdot 10^{52}$ .
Because $N < 2^6 \cdot 10^{312}$ $\sqrt[6]{N} < 2 \cdot 10^{52}$
Therefore, $f \left( 6 \right) = 1$
Therefore, \begin{align*} f \left( 2 \right) + f \left( 3 \right) + f \left( 4 \right) + f \left( 5 \right) + f \left( 6 \right) & = 2 + 1 + 1 + 3 + 1 \\ & = 8 . \end{align*}
Therefore, the answer is $\boxed{8}$

Answer: A 8
Problem: Regular polygons with $5,6,7,$ and $8$ sides are inscribed in the same circle. No two of the polygons share a vertex, and no three of their sides intersect at a common point. At how many points inside the circle do two of their sides intersect?
$(\textbf{A})\: 52\qquad(\textbf{B}) \: 56\qquad(\textbf{C}) \: 60\qquad(\textbf{D}) \: 64\qquad(\textbf{E}) \: 68$

Solution: Imagine we have $2$ regular polygons with $m$ and $n$ sides and $m>n$ inscribed in a circle without sharing a vertex. We see that each side of the polygon with $n$ sides (the polygon with fewer sides) will be intersected twice.
(We can see this because to have a vertex of the $m$ -gon on an arc subtended by a side of the $n$ -gon, there will be one intersection to “enter” the arc and one to “exit” the arc. ~KingRavi)
This means that we will end up with $2$ times the number of sides in the polygon with fewer sides.
If we have polygons with $5,$ $6,$ $7,$ and $8$ sides, we need to consider each possible pair of polygons and count their intersections.
Throughout $6$ of these pairs, the $5$ -sided polygon has the least number of sides $3$ times, the $6$ -sided polygon has the least number of sides $2$ times, and the $7$ -sided polygon has the least number of sides $1$ time.
Therefore the number of intersections is $2\cdot(3\cdot5+2\cdot6+1\cdot7)=\boxed{68}$

Answer: E 68
Problem: For each integer $n\geq 2$ , let $S_n$ be the sum of all products $jk$ , where $j$ and $k$ are integers and $1\leq j<k\leq n$ . What is the sum of the 10 least values of $n$ such that $S_n$ is divisible by $3$
$\textbf{(A)}\ 196\qquad\textbf{(B)}\ 197\qquad\textbf{(C)}\ 198\qquad\textbf{(D)}\ 199\qquad\textbf{(E)}\ 200$

Solution: To get from $S_n$ to $S_{n+1}$ , we add $1(n+1)+2(n+1)+\cdots +n(n+1)=(1+2+\cdots +n)(n+1)=\frac{n(n+1)^2}{2}$
Now, we can look at the different values of $n$ mod $3$ . For $n\equiv 0\pmod{3}$ and $n\equiv 2\pmod{3}$ , then we have $\frac{n(n+1)^2}{2}\equiv 0\pmod{3}$ . However, for $n\equiv 1\pmod{3}$ , we have \[\frac{1\cdot {2}^2}{2}\equiv 2\pmod{3}.\]
Clearly, $S_2\equiv 2\pmod{3}.$ Using the above result, we have $S_5\equiv 1\pmod{3}$ , and $S_8$ $S_9$ , and $S_{10}$ are all divisible by $3$ . After $3\cdot 3=9$ , we have $S_{17}$ $S_{18}$ , and $S_{19}$ all divisible by $3$ , as well as $S_{26}, S_{27}, S_{28}$ , and $S_{35}$ . Thus, our answer is $8+9+10+17+18+19+26+27+28+35=27+54+81+35=162+35=\boxed{197} .$ -BorealBear

Answer: B 197
Problem: For each integer $n\geq 2$ , let $S_n$ be the sum of all products $jk$ , where $j$ and $k$ are integers and $1\leq j<k\leq n$ . What is the sum of the 10 least values of $n$ such that $S_n$ is divisible by $3$
$\textbf{(A)}\ 196\qquad\textbf{(B)}\ 197\qquad\textbf{(C)}\ 198\qquad\textbf{(D)}\ 199\qquad\textbf{(E)}\ 200$

Solution: Since we have a wonky function, we start by trying out some small cases and see what happens. If $j$ is $1$ and $k$ is $2$ , then there is one case. We have $2$ mod $3$ for this case. If $N$ is $3$ , we have $1 \cdot 2 + 1 \cdot 3 + 2 \cdot 3$ which is still $2$ mod $3$ . If $N$ is $4$ , we have to add $1 \cdot 4 + 2 \cdot 4 + 3 \cdot 4$ which is a multiple of $3$ , meaning that we are still at $2$ mod $3$ . If we try a few more cases, we find that when $N$ is $8$ , we get a multiple of $3$ . When $N$ is $9$ , we are adding $0$ mod $3$ , and therefore, we are still at a multiple of $3$
When $N$ is $10$ , then we get $0$ mod $3$ $10(1+2+3+...+9)$ which is $10$ times a multiple of $3$ . Therefore, we have another multiple of $3$ . When $N$ is $11$ , so we have $2$ mod $3$ . So, every time we have $-1$ mod $9$ $0$ mod $9$ , and $1$ mod $9$ , we always have a multiple of $3$ . Think about it: When $N$ is $1$ , it will have to be $0 \cdot 1$ , so it is a multiple of $3$ . Therefore, our numbers are $8, 9, 10, 17, 18, 19, 26, 27, 28, 35$ . Adding the numbers up, we get $\boxed{197}$

Answer: B 197
Problem: For each integer $n\geq 2$ , let $S_n$ be the sum of all products $jk$ , where $j$ and $k$ are integers and $1\leq j<k\leq n$ . What is the sum of the 10 least values of $n$ such that $S_n$ is divisible by $3$
$\textbf{(A)}\ 196\qquad\textbf{(B)}\ 197\qquad\textbf{(C)}\ 198\qquad\textbf{(D)}\ 199\qquad\textbf{(E)}\ 200$

Solution: Denote $A_{n, <} = \left\{ \left( j , k \right) : 1 \leq j < k \leq n \right\}$ $A_{n, >} = \left\{ \left( j , k \right) : 1 \leq k < j \leq n \right\}$ and $A_{n, =} = \left\{ \left( j , k \right) : 1 \leq j = k \leq n \right\}$
Hence, $\sum_{\left( j , k \right) \in A_{n,<}} jk = \sum_{\left( j , k \right) \in A_{n,>}} jk = S_n$
Therefore, \begin{align*} S_n & = \frac{1}{2} \left( \sum_{\left( j , k \right) \in A_{n,<}} jk = \sum_{\left( j , k \right) \in A_{n,>}} jk \right) \\ & = \frac{1}{2} \left( \sum_{1 \leq j, k \leq n} jk - {\left( j , k \right) \in A_{n,=}} jk \right) \\ & = \frac{1}{2} \left( \sum_{j=1}^n \sum_{k=1}^n jk - \sum_{j=1}^n j^2 \right) \\ & = \frac{1}{2} \left( \frac{n^2 \left( n + 1 \right)^2}{4} - \frac{n \left( n + 1 \right) \left( 2 n + 1 \right) }{6} \right) \\ & = \frac{\left( n - 1 \right) n \left( n + 1 \right) \left( 3 n + 2 \right)}{24} . \end{align*}
Hence, $S_n$ is divisible by 3 if and only if $\left( n - 1 \right) n \left( n + 1 \right) \left( 3 n + 2 \right)$ is divisible by $24 \cdot 3 = 8 \cdot 9$
First, $\left( n - 1 \right) n \left( n + 1 \right) \left( 3 n + 2 \right)$ is always divisible by 8. Otherwise, $S_n$ is not even an integer.
Second, we find conditions for $n$ , such that $\left( n - 1 \right) n \left( n + 1 \right) \left( 3 n + 2 \right)$ is divisible by 9.
Because $3 n + 2$ is not divisible by 3, it cannot be divisible by 9.
Hence, we need to find conditions for $n$ , such that $\left( n - 1 \right) n \left( n + 1 \right)$ is divisible by 9.
This holds of $n \equiv 0, \pm 1 \pmod{9}$
Therefore, the 10 least values of $n$ such that $\left( n - 1 \right) n \left( n + 1 \right)$ is divisible by 9 (equivalently, $S_n$ is divisible by 3) are 8, 9, 10, 17, 18, 19, 26, 27, 28, 35.
Their sum is 197.
Therefore, the answer is $\boxed{197}$

Answer: B 197
Problem: A cube is constructed from $4$ white unit cubes and $4$ blue unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.)
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\  8 \qquad\textbf{(C)}\  9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

Solution: This problem is about the relationships between the white unit cubes and the blue unit cubes, which can be solved by Graph Theory . We use a Planar Graph to represent the larger cube. Each vertex of the planar graph represents a unit cube. Each edge of the planar graph represents a shared face between $2$ neighboring unit cubes. Each face of the planar graph represents a face of the larger cube.
Now the problem becomes a Graph Coloring problem of how many ways to assign $4$ vertices blue and $4$ vertices white with Topological Equivalence . For example, in Figure $(1)$ , as long as the $4$ blue vertices belong to the same planar graph face, the different planar graphs are considered to be topological equivalent by rotating the larger cube.
Topology.jpg
Here is how the $4$ blue unit cubes are arranged:
In Figure $(1)$ $4$ blue unit cubes are on the same layer (horizontal or vertical).
In Figure $(2)$ $4$ blue unit cubes are in $T$ shape.
In Figure $(3)$ and $(4)$ $4$ blue unit cubes are in $S$ shape.
In Figure $(5)$ $3$ blue unit cubes are in $L$ shape, and the other is isolated without a shared face.
In Figure $(6)$ $2$ pairs of neighboring blue unit cubes are isolated from each other without a shared face.
In Figure $(7)$ $4$ blue unit cubes are isolated from each other without a shared face.
So the answer is $\boxed{7}$

Answer: A 7
Problem: A cube is constructed from $4$ white unit cubes and $4$ blue unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.)
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\  8 \qquad\textbf{(C)}\  9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

Solution: Let’s split the cube into two layers; a bottom and top. Note that there must be four of each color, so however many number of one color are in the bottom, there will be four minus that number of the color on the top. We do casework on the color distribution of the bottom layer.
Case 1: 4, 0
In this case, there is only one possibility for the top layer - all of the other color - $\binom{4}{4}$ . Therefore there is 1 construction from this case.
Case 2: 3, 1
In this case, the top layer has four possibilities, because there are four different ways to arrange it so that it also has a 3, 1 color distribution - $\binom{4}{3}$ . Therefore there are 4 constructions from this case.
Case 3: 2, 2
In this case, the top layer has six possibilities of arrangement - $\binom{4}{2}$ . However, having adjacent colors one way can be rotated to having adjacent colors any other way, so there is only one construction for the adjacent colors subcase and similarly, only one for the diagonal color subcase. Therefore the total number of constructions for this case is 2.
The total number of constructions for the cube is thus $1+4+2=7=\boxed{7}$

Answer: A 7
Problem: A cube is constructed from $4$ white unit cubes and $4$ blue unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.)
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\  8 \qquad\textbf{(C)}\  9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

Solution: Divide the $2 \times 2 \times 2$ cube into two layers, say, front and back. Any possible construction can be rotated such that the front layer has the same or greater number of white cubes than blue cubes, so we only need to count the number of cases given that is true.
Therefore, our answer is $6+1+0=\boxed{7}$

Answer: A 7
Problem: A cube is constructed from $4$ white unit cubes and $4$ blue unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.)
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\  8 \qquad\textbf{(C)}\  9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

Solution: Burnside lemma is used to counting number of orbit where the element on the same orbit can be achieved by the defined operator, naming rotation, reflection and etc.
The fact for Burnside lemma are
1. the sum of stablizer on the same orbit equals to the # of operators;
2. the sum of stablizer can be counted as $fix(g)$
3. the sum of the $fix(g)/|G|$ equals the # of orbit.
Let's start with defining the operator for a cube,
1. $\textbf{e (identity)}$
For identity, there are $\frac{8!}{4!4!} = 70$
2. ${\bf r^{1}, r^{2}, r^{3}}$ to be the rotation axis along three pair of opposite face,
each contains $r^{i}_{90}, r^{i}_{180}, r^{i}_{270}$ where $i= 1, 2, 3$
$fix(r^{i}_{90}) = fix(r^{i}_{270}) = 2\cdot1 = 2$
$fix(r^{i}_{180}) = \frac{4!}{2!\cdot2!} = 6$
therefore $fix(\bf r^{i}) = 2+2+6 = 10$ , and $fix(\bf r^{1})+fix(\bf r^{2})+fix(\bf r^{3}) = 30$
3. ${\bf r^{4}, r^{5}, r^{6}, r^{7}}$ to the rotation axis along four cube diagnals.
each contains $r^{i}_{120}, r^{i}_{240}$ where $i= 4, 5, 6, 7$
$fix(r^{i}_{120}) = fix(r^{i}_{240}) = 2\cdot1\cdot2\cdot1 = 4$
therefore $fix(\bf r^{i}) = 4+4 = 8$ , and $fix(\bf r^{4})+fix(\bf r^{5})+fix(\bf r^{6})+fix(\bf r^{7}) = 32$
4. ${\bf r^{8}, r^{9}, r^{10}, r^{11}, r^{12}, r^{13}}$ to be the rotation axis along 6 pairs of diagnally opposite sides
each contains $r^{i}_{180}$ where $i= 8, 9, 10, 11, 12, 13$
$fix(r^{i}_{180}) = \frac{4!}{2!\cdot2!} = 6$
therefore $fix(\bf r^{8})+fix(\bf r^{9})+fix(\bf r^{10})+fix(\bf r^{11})+fix(\bf r^{12})+fix(\bf r^{13}) = 36$
5. The total number of operators are
$|G| = 1 + 3\cdot3 + 4\cdot2 + 6\cdot1 = 24$
Based on 1, 2, 3, 4 the total number of stablizer is $70 + 30 + 32 + 36 = 168$
therefore the number of orbit $= \frac{168}{G=24} = \boxed{7}$

Answer:  7
Problem: A cube is constructed from $4$ white unit cubes and $4$ blue unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.)
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\  8 \qquad\textbf{(C)}\  9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

Solution: Since rotations of a single pattern are considered indistinguishable, we can assume that the forward upper right corner of the 2-by-2-by-2 cube is a blue cube (since we can always rotate the big cube to place a blue cube in that spot).
Once we've assigned this cube to be blue, we note that 3 1-by-1-by-1 cubes share a side with it, 3 1-by-1-by-1 cubes share a corner with it, and 1 1-by-1-by-1 cube does not touch the assigned cube at all, from the perspective of someone who can only see the cube's faces. We'll call the first 3 "adjacent", the second 3 "cornering", and the last one "opposite."
We can use a little bit of intuition to confirm that due to the rotation condition, we should treat all adjacents as indistinguishable, all cornerings as indistinguishable, and of course the opposite one is unique from all the others. Thus, we can list out like so (keeping in mind that there are 3 adjacents, 3 cornerings, and 1 opposite, and that we're choosing the positions of the remaining 3 blue cubes):
OAA, OAC, OCC, CCC, CAA, CCA, AAA.
This gives the answer to be $\boxed{7}$

Answer: A 7
Problem: What is the value of \[(2^2-2)-(3^2-3)+(4^2-4)\]
$\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 5 \qquad\textbf{(D) } 8 \qquad\textbf{(E) } 12$

Solution: $(4-2)-(9-3)+(16-4)=2-6+12=8.$ This corresponds to $\boxed{8}.$

Answer: D 8
Problem: What is the value of \[(2^2-2)-(3^2-3)+(4^2-4)\]
$\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 5 \qquad\textbf{(D) } 8 \qquad\textbf{(E) } 12$

Solution: We have \begin{align*} \left(2^2-2\right)-\left(3^2-3\right)+\left(4^2-4\right) &= 2(2-1)-3(3-1)+4(4-1) \\ &= 2(1)-3(2)+4(3) \\ &= 2-6+12 \\ &= \boxed{8} ~MRENTHUSIASM

Answer: D 8
Problem: What is the value of \[(2^2-2)-(3^2-3)+(4^2-4)\]
$\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 5 \qquad\textbf{(D) } 8 \qquad\textbf{(E) } 12$

Solution: We have \begin{align*} (2^2-2)-(3^2-3)+(4^2-4) &= 2^2+4^2-3^2-2+3-4 \\ &=2^2+(4-3)(4+3)-3 \\ &=2^2+7-3=2^2+4 \\ &=4\cdot 2 \\ &=\boxed{8} PureSwag

Answer: D 8
Problem: What is the value of \[(2^2-2)-(3^2-3)+(4^2-4)\]
$\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 5 \qquad\textbf{(D) } 8 \qquad\textbf{(E) } 12$

Solution: Using the difference of squares, we have \[(2-\sqrt{2})(2+\sqrt{2}) - (3-\sqrt{3})(3+\sqrt{3}) + (4-2)(4+2).\] Knowing that $\sqrt{2} \approx 1.41$ and $\sqrt{3} \approx 1.73,$ we get \[(2-\sqrt{2})(2+\sqrt{2}) - (3-\sqrt{3})(3+\sqrt{3}) + (4-2)(4+2) \approx 0.59\cdot 3.41 -1.26\cdot 4.73 + 2 \cdot 6 =8.0521,\] which is closest to $\boxed{8}.$

Answer: D 8
Problem: Portia's high school has $3$ times as many students as Lara's high school. The two high schools have a total of $2600$ students. How many students does Portia's high school have?
$\textbf{(A)} ~600 \qquad\textbf{(B)} ~650 \qquad\textbf{(C)} ~1950 \qquad\textbf{(D)} ~2000\qquad\textbf{(E)} ~2050$

Solution: The following system of equations can be formed with $P$ representing the number of students in Portia's high school and $L$ representing the number of students in Lara's high school: \begin{align*} P&=3L, \\ P+L&=2600. \end{align*} Substituting $P=3L$ gives $4L=2600.$ Solving for $L$ gives $L=650.$ Since we need to find $P,$ we multiply $650$ by $3$ to get $P=\boxed{1950}.$

Answer: C 1950
Problem: Portia's high school has $3$ times as many students as Lara's high school. The two high schools have a total of $2600$ students. How many students does Portia's high school have?
$\textbf{(A)} ~600 \qquad\textbf{(B)} ~650 \qquad\textbf{(C)} ~1950 \qquad\textbf{(D)} ~2000\qquad\textbf{(E)} ~2050$

Solution: Suppose Lara's high school has $x$ students, so Portia's high school has $3x$ students. We have $x+3x=2600,$ or $4x=2600.$ The answer is \[3x=2600\cdot\frac 34=650\cdot3=\boxed{1950}.\]

Answer: C 1950
Problem: Portia's high school has $3$ times as many students as Lara's high school. The two high schools have a total of $2600$ students. How many students does Portia's high school have?
$\textbf{(A)} ~600 \qquad\textbf{(B)} ~650 \qquad\textbf{(C)} ~1950 \qquad\textbf{(D)} ~2000\qquad\textbf{(E)} ~2050$

Solution: Clearly, $2600$ is $4$ times the number of students in Lara's high school. Therefore, Lara's high school has $2600\div4=650$ students, and Portia's high school has $650\cdot3=\boxed{1950}$ students.

Answer: C 1950
Problem: Portia's high school has $3$ times as many students as Lara's high school. The two high schools have a total of $2600$ students. How many students does Portia's high school have?
$\textbf{(A)} ~600 \qquad\textbf{(B)} ~650 \qquad\textbf{(C)} ~1950 \qquad\textbf{(D)} ~2000\qquad\textbf{(E)} ~2050$

Solution: The number of students in Portia's high school must be a multiple of $3.$ This eliminates $\textbf{(B)},\textbf{(D)},$ and $\textbf{(E)}.$ Since $\textbf{(A)}$ is too small (as it is clear that $600+\frac{600}{3}<2600$ ), we are left with $\boxed{1950}.$

Answer: C 1950
Problem: The sum of two natural numbers is $17402$ . One of the two numbers is divisible by $10$ . If the units digit of that number is erased, the other number is obtained. What is the difference of these two numbers?
$\textbf{(A)} ~10272\qquad\textbf{(B)} ~11700\qquad\textbf{(C)} ~13362\qquad\textbf{(D)} ~14238\qquad\textbf{(E)} ~15426$

Solution: The units digit of a multiple of $10$ will always be $0$ . We add a $0$ whenever we multiply by $10$ . So, removing the units digit is equal to dividing by $10$
Let the smaller number (the one we get after removing the units digit) be $a$ . This means the bigger number would be $10a$
We know the sum is $10a+a = 11a$ so $11a=17402$ . So $a=1582$ . The difference is $10a-a = 9a$ . So, the answer is $9(1582) = \boxed{14238}$

Answer: D 14238