Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: You are playing a game. A $2 \times 1$ rectangle covers two adjacent squares (oriented either horizontally or vertically) of a $3 \times 3$ grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensure that at least one of your guessed squares is covered by the rectangle?
$\textbf{(A)}~3\qquad\textbf{(B)}~5\qquad\textbf{(C)}~4\qquad\textbf{(D)}~8\qquad\textbf{(E)}~6$

Solution: Since the hidden rectangle can only hide two adjacent squares, we may think that we eliminate 8 squares and we're done, but think again. This is the AMC 10, so there must be a better solution (also note that every other solution choice is below 8 so we're probably not done) So, we think again, we notice that we haven't used the adjacent condition, and then it clicks. If we eliminate the four squares with only one edge on the boundary of the 9x9 square. We are left with 5 diagonal squares, since our rectangle cant be diagonal, we can ensure that we find it in 4 moves. So our answer is : $\boxed{4}$

Answer: C 4
Problem: You are playing a game. A $2 \times 1$ rectangle covers two adjacent squares (oriented either horizontally or vertically) of a $3 \times 3$ grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensure that at least one of your guessed squares is covered by the rectangle?
$\textbf{(A)}~3\qquad\textbf{(B)}~5\qquad\textbf{(C)}~4\qquad\textbf{(D)}~8\qquad\textbf{(E)}~6$

Solution: The $3 \times 3$ grid can be colored like a checkerboard with alternating black and white squares.
Let the top left square be white, and the rest of the squares alternate colors.
Each $2 \times 1$ rectangle always covers $1$ white square and $1$ black square.
You can ensure that at least one of your guessed squares is covered by the rectangle by choosing either each of the white squares ( $5$ turns) or each of the black squares ( $4$ turns).
Since it is ideal to be the most efficient with our turns, by choosing all the black squares, we guarantee that one of the $\boxed{4}$ squares are of the $2 \times 1$ rectangle.

Answer:  4
Problem: You are playing a game. A $2 \times 1$ rectangle covers two adjacent squares (oriented either horizontally or vertically) of a $3 \times 3$ grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensure that at least one of your guessed squares is covered by the rectangle?
$\textbf{(A)}~3\qquad\textbf{(B)}~5\qquad\textbf{(C)}~4\qquad\textbf{(D)}~8\qquad\textbf{(E)}~6$

Solution: We realize that every $2 \times 1$ rectangle must contain an edge and no more than one edge. There are a total of four edges so the answer is $\boxed{4.}$ .
~darrenn.cp

Answer: C 4.
Problem: Suzanne went to the bank and withdrew $$800$ . The teller gave her this amount using $$20$ bills, $$50$ bills, and $$100$ bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?
$\textbf{(A) } 45 \qquad \textbf{(B) } 21 \qquad \text{(C) } 36 \qquad \text{(D) } 28 \qquad \text{(E) } 32$

Solution: Denote by $x$ $y$ $z$ the amount of $20 bills, $50 bills and $100 bills, respectively.
Thus, we need to find the number of tuples $\left( x , y, z \right)$ with $x, y, z \in \Bbb N$ that satisfy \[ 20 x + 50 y + 100 z = 800.  \]
First, this equation can be simplified as \[ 2 x + 5 y + 10 z = 80. \]
Second, we must have $5 |x$ . Denote $x = 5 x'$ .
The above equation can be converted to \[ 2 x' + y + 2 z = 16 . \]
Third, we must have $2 | y$ . Denote $y = 2 y'$ .
The above equation can be converted to \[ x' + y' + z = 8 . \]
Denote $x'' = x' - 1$ $y'' = y' - 1$ and $z'' = z - 1$ .
Thus, the above equation can be written as \[ x'' + y'' + z'' = 5 . \]
Therefore, the number of non-negative integer solutions $\left( x'', y'', z'' \right)$ is $\binom{5 + 3 - 1}{3 - 1} = \boxed{21}$

Answer: B 21
Problem: Suzanne went to the bank and withdrew $$800$ . The teller gave her this amount using $$20$ bills, $$50$ bills, and $$100$ bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?
$\textbf{(A) } 45 \qquad \textbf{(B) } 21 \qquad \text{(C) } 36 \qquad \text{(D) } 28 \qquad \text{(E) } 32$

Solution: We notice that each $100 can be split 3 ways: 5 $20 dollar bills, 2 $50 dollar bills, or 1 $100 dollar bill.
There are 8 of these $100 chunks in total--take away 3 as each split must be used at least once.
Now there are five left--so we use stars and bars.
5 chunks, 3 categories or 2 bars. This gives us $\binom{5+2}{2}=\boxed{21}$

Answer: B 21
Problem: When the roots of the polynomial
\[P(x)  = (x-1)^1 (x-2)^2 (x-3)^3 \cdot \cdot \cdot (x-10)^{10}\]
are removed from the number line, what remains is the union of $11$ disjoint open intervals. On how many of these intervals is $P(x)$ positive?
$\textbf{(A)}~3\qquad\textbf{(B)}~7\qquad\textbf{(C)}~6\qquad\textbf{(D)}~4\qquad\textbf{(E)}~5$

Solution: The expressions to the power of even powers are always positive, so we don't need to care about those. We only need to care about $(x-1)^1(x-3)^3(x-5)^5(x-7)^7(x-9)^9$ . We need 0, 2, or 4 of the expressions to be negative. The 9 through 10 interval and 10 plus interval make all of the expressions positive. The 5 through 6 and 6 through 7 intervals make two of the expressions negative. The 1 through 2 and 2 through 3 intervals make four of the expressions negative. There are $\boxed{6}$ intervals.

Answer: C 6
Problem: When the roots of the polynomial
\[P(x)  = (x-1)^1 (x-2)^2 (x-3)^3 \cdot \cdot \cdot (x-10)^{10}\]
are removed from the number line, what remains is the union of $11$ disjoint open intervals. On how many of these intervals is $P(x)$ positive?
$\textbf{(A)}~3\qquad\textbf{(B)}~7\qquad\textbf{(C)}~6\qquad\textbf{(D)}~4\qquad\textbf{(E)}~5$

Solution: The roots of the factorized polynomial are intervals from numbers 1 to 10. We take each interval as being defined as the number behind it. To make the function positive, we need to have an even number of negative expressions. Real numbers raised to even powers are always positive, so we only focus on $x-1$ $x-3$ $x-5$ $x-7$ , and $x-9$ . The intervals 1 and 2 leave 4 negative expressions, so they are counted. The same goes for intervals 5, 6, 9, and 10. Intervals 3 and 4 leave 3 negative expressions and intervals 7 and 8 leave 1 negative expression. The solution is the number of intervals which is $\boxed{6}$

Answer: C 6
Problem: When the roots of the polynomial
\[P(x)  = (x-1)^1 (x-2)^2 (x-3)^3 \cdot \cdot \cdot (x-10)^{10}\]
are removed from the number line, what remains is the union of $11$ disjoint open intervals. On how many of these intervals is $P(x)$ positive?
$\textbf{(A)}~3\qquad\textbf{(B)}~7\qquad\textbf{(C)}~6\qquad\textbf{(D)}~4\qquad\textbf{(E)}~5$

Solution: We can use the turning point behavior at the roots of a polynomial graph to find out the amount of intervals that are positive.
First, we evaluate any value on the interval $(-\infty, 1)$ . Since the degree of $P(x)$ is $1+2+...+9+10$ $\frac{10\times11}{2}$ $55$ , and every term in $P(x)$ is negative, multiplying $55$ negatives gives a negative value. So $(-\infty, 0)$ is a negative interval.
We know that the roots of $P(x)$ are at $1,2,...,10$ . When the degree of the term of each root is odd, the graph of $P(x)$ will pass through the graph and change signs, and vice versa. So at $x=1$ , the graph will change signs; at $x=2$ , the graph will not, and so on.
This tells us that the interval $(1,2)$ is positive, $(2,3)$ is also positive, $(3,4)$ is negative, $(4,5)$ is also negative, and so on, with the pattern being $+,+,-,-,+,+,-,-,...$
The positive intervals are therefore $(1,2)$ $(2,3)$ $(5,6)$ $(6,7)$ $(9,10)$ , and $(10,\infty)$ , for a total of $\boxed{6}$

Answer: C 6
Problem: When the roots of the polynomial
\[P(x)  = (x-1)^1 (x-2)^2 (x-3)^3 \cdot \cdot \cdot (x-10)^{10}\]
are removed from the number line, what remains is the union of $11$ disjoint open intervals. On how many of these intervals is $P(x)$ positive?
$\textbf{(A)}~3\qquad\textbf{(B)}~7\qquad\textbf{(C)}~6\qquad\textbf{(D)}~4\qquad\textbf{(E)}~5$

Solution: Denote by $I_k$ the interval $\left( k - 1 , k \right)$ for $k \in \left\{ 2, 3, \cdots , 10 \right\}$ and $I_1$ the interval $\left( - \infty, 1 \right)$
Therefore, the number of intervals that $P(x)$ is positive is \begin{align*} 1 + \sum_{i=1}^{10} \Bbb I \left\{  \sum_{j=i}^{10} j \mbox{ is even}   \right\}   & = 1 + \sum_{i=1}^{10} \Bbb I \left\{ \frac{\left( i + 10 \right) \left( 11 - i \right)}{2} \mbox{ is even}   \right\} \\  & = 1 + \sum_{i=1}^{10} \Bbb I \left\{ \frac{- i^2 + i + 110}{2} \mbox{ is even}   \right\} \\  & = 1 + \sum_{i=1}^{10} \Bbb I \left\{ \frac{i^2 - i}{2} \mbox{ is odd}   \right\} \\  & = \boxed{6}

Answer: C 6
Problem: What is the area of the region in the coordinate plane defined by
$| | x | - 1 | + | | y | - 1 | \le 1$
$\text{(A)}\ 2 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 15 \qquad \text{(E)}\ 12$

Solution: First consider, $|x-1|+|y-1| \le 1.$ We can see that it is a square with a radius of $1$ (diagonal $\sqrt{2}$ ). The area of the square is $\sqrt{2}^2 = 2.$
Next, we insert an absolute value sign into the equation and get $|x-1|+||y|-1| \le 1.$ This will double the square reflecting over x-axis.
So now we have $2$ squares.
Finally, we add one more absolute value and obtain $||x|-1|+||y|-1| \le 1.$ This will double the squares as we reflect the $2$ squares we already have over the y-axis.
Concluding, we have $4$ congruent squares.  The total area is $4\cdot2 =$ $\boxed{8}$

Answer: B 8
Problem: What is the area of the region in the coordinate plane defined by
$| | x | - 1 | + | | y | - 1 | \le 1$
$\text{(A)}\ 2 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 15 \qquad \text{(E)}\ 12$

Solution: We first consider the lattice points that satisfy $||x|-1| = 0$ and $||y|-1| = 1$ . The lattice points satisfying these equations
are $(1,0), (1,2), (1,-2), (-1,0), (-1,2),$ and $(-1,-2).$ By symmetry, we also have points $(0,1), (2,1), (-2,1), (0,-1), (2,-1),$ and $(-2,-1)$ when $||x|-1| = 1$ and $||y|-1| = 0$ .  Graphing and connecting these points, we form 5 squares. However,
we can see that any point within the square in the middle does not satisfy the given inequality (take $(0,0)$ , for instance). As
noted in the above solution, each square has a diagonal $2$ for an area of $\frac{2^2}{2} = 2$ , so the total area is $4\cdot2 =$ $\boxed{8}.$

Answer: B 8
Problem: What is the area of the region in the coordinate plane defined by
$| | x | - 1 | + | | y | - 1 | \le 1$
$\text{(A)}\ 2 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 15 \qquad \text{(E)}\ 12$

Solution: The value of $|x|$ and $|y|$ can be a maximum of 1 when the other is 0. Therefore the value of $x$ and $y$ range from -2 to 2. This forms a diamond shape which has area $4 \times \frac{2^2}{2}$ which is $\boxed{8}.$

Answer: B 8
Problem: What is the area of the region in the coordinate plane defined by
$| | x | - 1 | + | | y | - 1 | \le 1$
$\text{(A)}\ 2 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 15 \qquad \text{(E)}\ 12$

Solution: We start by considering the graph of $|x|+|y|\leq 1$ . To get from this graph to $||x|-1|+||y|-1| \leq 1$ we have to translate it by $\pm 1$ on the $x$ axis and $\pm 1$ on the $y$ axis.
Graphing $|x|+|y|\leq 1$ we get a square with side length of $\sqrt{2}$ , so the area of one of these squares is just $2$
We have to multiply by $4$ since there are $4$ combinations of shifting the $x$ and $y$ axis.
So we have $2\times 4$ which is $\boxed{8}$

Answer: B 8
Problem: How many ordered pairs of integers $(m, n)$ satisfy the equation $m^2+mn+n^2 = m^2n^2$
$\textbf{(A) }7\qquad\textbf{(B) }1\qquad\textbf{(C) }3\qquad\textbf{(D) }6\qquad\textbf{(E) }5$

Solution: Clearly, $m=0,n=0$ is one of the solutions. However, we can be quite sure that there are more, so we apply Simon's Favorite Factoring Trick to get the following:
\begin{align*} m^2+mn+n^2 &= m^2n^2\\ m^2+mn+n^2 +mn &= m^2n^2 +mn\\ (m+n)^2 &= m^2n^2 +mn\\ (m+n)^2 &= mn(mn+1).\\ \end{align*}
Essentially, this says that the product of two consecutive numbers $mn,mn+1$ must be a perfect square. This is practically impossible except $mn=0$ or $mn+1=0$ $mn=0$ gives $(0,0)$ $mn=-1$ gives $(1,-1), (-1,1)$ . Answer: $\boxed{3}.$

Answer: C 3
Problem: How many ordered pairs of integers $(m, n)$ satisfy the equation $m^2+mn+n^2 = m^2n^2$
$\textbf{(A) }7\qquad\textbf{(B) }1\qquad\textbf{(C) }3\qquad\textbf{(D) }6\qquad\textbf{(E) }5$

Solution: Case 1: $mn = 0$
In this case, $m = n = 0$
Case 2: $mn \neq 0$
Denote $k = {\rm gcd} \left( m, n \right)$ .
Denote $m = k u$ and $n = k v$ .
Thus, ${\rm gcd} \left( u, v \right) = 1$
Thus, the equation given in this problem can be written as \[ u^2 + uv + v^2 = k^2 u^2 v^2 . \]
Modulo $u$ , we have $v^2 \equiv 0 \pmod{u}$ .
Because ${\rm gcd} \left( u, v \right) = 1$ ., we must have $|u| = |v| = 1$ .
Plugging this into the above equation, we get $2 + uv = k^2$ .
Thus, we must have $uv = -1$ and $k = 1$
Thus, there are two solutions in this case: $\left( m , n \right) = \left( 1, -1 \right)$ and $\left( m , n \right) = \left( -1, 1 \right)$
Putting all cases together, the total number of solutions is $\boxed{3}$

Answer: C 3
Problem: How many ordered pairs of integers $(m, n)$ satisfy the equation $m^2+mn+n^2 = m^2n^2$
$\textbf{(A) }7\qquad\textbf{(B) }1\qquad\textbf{(C) }3\qquad\textbf{(D) }6\qquad\textbf{(E) }5$

Solution: We can move all terms to one side and write the equation as a quadratic in terms of $n$ to get \[(1-m^2)n^2+(m)n+(m^2)=0.\] The discriminant of this quadratic is \[\Delta = m^2-4(1-m^2)(m^2)=m^2(4m^2-3).\] For $n$ to be an integer, we must have $m^2(4m^2-3)$ be a perfect square. Thus, either $4m^2-3$ is a perfect square or $m^2 = 0$ and $m = 0$ . The first case gives $m=-1,1$ , which result in the equations $-n+1=0$ and $n-1=0$ , for a total of two pairs: $(-1,1)$ and $(1,-1)$ . The second case gives the equation $n^2=0$ , so it's only pair is $(0,0)$ . In total, the total number of solutions is $\boxed{3}$

Answer: C 3
Problem: How many ordered pairs of integers $(m, n)$ satisfy the equation $m^2+mn+n^2 = m^2n^2$
$\textbf{(A) }7\qquad\textbf{(B) }1\qquad\textbf{(C) }3\qquad\textbf{(D) }6\qquad\textbf{(E) }5$

Solution: Let $x=m+n, y=mn$ then \[x^2-y=y^2\] Completing the square then gives \[4x^2+1=(2y+1)^2\] Since the RHS is a square, clearly the only solutions are $x=0,y=0$ and $x=0,y=-1$ . The first gives $(0,0)$ while the second gives $(-1,1)$ and $(1,-1)$ by solving it as a quadratic with roots $m$ and $n$ . Thus there are $\boxed{3}$ solutions.

Answer: C 3
Problem: Four congruent semicircles are drawn on the surface of a sphere with radius $2$ , as
shown, creating a close curve that divides the surface into two congruent regions.
The length of the curve is $\pi\sqrt{n}$ . What is $n$
$\textbf{(A) } 32 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 48 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 27$

Solution: There are four marked points on the diagram; let us examine the top two points and call them $A$ and $B$ . Similarly, let the bottom two dots be $C$ and $D$ , as shown:
[asy] import graph; import geometry;  unitsize(1cm);  pair A = (-1.41, 1.41); pair B = (1.41, 1.41); pair C = (1.41, -1.41); pair D = (-1.41, -1.41); pair O = (0, 0);  draw(circle(O,2)); draw(A--O--B,black+dashed); draw(C--O--D,black+dashed);  dot(A);dot(B);dot(C);dot(D);dot(O);  label("$A$", A, NW); label("$B$", B, NE); label("$C$", C, SE); label("$D$", D, SW); label("$O$", (0,0.1), N); [/asy]
This is a cross-section of the sphere seen from the side. We know that ${AO}={BO}={CO}={DO}=2$ , and by Pythagorean Theorem, length of $\overline{AB}=2\sqrt2.$
Each of the four congruent semicircles has the length $AB$ as a diameter (since $\overline{AB}$ is congruent to $\overline{BC},\overline{CD},$ and $\overline{DA}$ ), so its radius is $\dfrac{2\sqrt2}2=\sqrt2.$ Each one's arc length is thus $\pi\cdot\sqrt2=\sqrt2\pi.$
We have $4$ of these, so the total length is $4\sqrt2\pi=\sqrt{32}\pi$ , so thus our answer is $\boxed{32.}$

Answer: A 32.
Problem: Four congruent semicircles are drawn on the surface of a sphere with radius $2$ , as
shown, creating a close curve that divides the surface into two congruent regions.
The length of the curve is $\pi\sqrt{n}$ . What is $n$
$\textbf{(A) } 32 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 48 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 27$

Solution: We put the sphere to a coordinate space by putting the center at the origin.
The four connecting points of the curve have the following coordinates: $A = \left( 0, 0, 2 \right)$ $B = \left( 2, 0, 0 \right)$ $C = \left( 0, 0, -2 \right)$ $D = \left( -2, 0, 0 \right)$
Now, we compute the radius of each semicircle.
Denote by $M$ the midpoint of $A$ and $B$ . Thus, $M$ is the center of the semicircle that ends at $A$ and $B$ .
We have $M = \left( 1, 0, 1 \right)$ .
Thus, $OM = \sqrt{1^2 + 0^2 + 1^2} = \sqrt{2}$
In the right triangle $\triangle OAM$ , we have $MA = \sqrt{OA^2 - OM^2} = \sqrt{2}$
Therefore, the length of the curve is \begin{align*} 4 \cdot \frac{1}{2} 2 \pi \cdot MA = \pi \sqrt{32} . \end{align*}
Therefore, the answer is $\boxed{32}$

Answer: A 32
Problem: Four congruent semicircles are drawn on the surface of a sphere with radius $2$ , as
shown, creating a close curve that divides the surface into two congruent regions.
The length of the curve is $\pi\sqrt{n}$ . What is $n$
$\textbf{(A) } 32 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 48 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 27$

Solution: Note that each of the diameters are the chord of the sphere of a quarter arc. Thus, the semicircles diameter's length is $2\sqrt{2}$ . Thus, the entire curve is $2\sqrt{2} \cdot \pi \cdot \frac{1}{2} \cdot 4 = 4\sqrt{2} \pi = \sqrt{32} \pi$ . Therefore, the answer is $\boxed{32}$ .
~andliu766

Answer: A 32
Problem: Four congruent semicircles are drawn on the surface of a sphere with radius $2$ , as
shown, creating a close curve that divides the surface into two congruent regions.
The length of the curve is $\pi\sqrt{n}$ . What is $n$
$\textbf{(A) } 32 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 48 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 27$

Solution: Cheese: You can immediately say that the answer choice is either ${\text{(A) }32}$ or ${\text{(C) }48}$ because there are four semicircles in that curve; there are $4 = \sqrt{16}$ semicircles in the curve, so n has to be a multiple of 16, and if you don't know how to do this problem, just guess one of ${\text{(A)}}$ or ${\text{(C)}}$ .
Actual way: Take a cross-section of the sphere to get four different points equidistant from the center $O$ of the sphere, $A$ $B$ $C$ $D$ such that $AO = BO = CO = DO = 2$ , and so $ABCD$ is a square with side length $2\sqrt{2}$ , and proceed as in Solution 1 to get $\boxed{32}$ .       ~get-rickrolled ~LaTeX errors fixed by get-rickrolled

Answer: A 32
Problem: Each of $2023$ balls is randomly placed into one of $3$ bins. Which of the following is closest to the probability that each of the bins will contain an odd number of balls?
$\textbf{(A) } \frac{2}{3} \qquad\textbf{(B) } \frac{3}{10} \qquad\textbf{(C) } \frac{1}{2} \qquad\textbf{(D) } \frac{1}{3} \qquad\textbf{(E) } \frac{1}{4}$

Solution: We first examine the possible arrangements for parity of number of balls in each box for $2022$ balls.
If a $E$ denotes an even number and a $O$ denotes an odd number, then the distribution of balls for $2022$ balls could be $EEE,EOO,OEO,$ or $OOE$ . With the insanely overpowered magic of cheese, we assume that each case is about equally likely.
From $EEE$ , it is not possible to get to all odd by adding one ball; we could either get $OEE,EOE,$ or $EEO$ . For the other $3$ cases, though, if we add a ball to the exact right place, then it'll work.
For each of the working cases, we have $1$ possible slot the ball can go into (for $OEO$ , for example, the new ball must go in the center slot to make $OOO$ ) out of the $3$ slots, so there's a $\dfrac13$ chance. We have a $\dfrac34$ chance of getting one of these working cases, so our answer is $\dfrac34\cdot\dfrac13=\boxed{14.}$

Answer: E 14.
Problem: How many distinct values of $x$ satisfy $\lfloor{x}\rfloor^2-3x+2=0$ , where $\lfloor{x}\rfloor$ denotes the largest integer less than or equal to $x$
$\textbf{(A) } \text{an infinite number} \qquad \textbf{(B) } 4 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 0$

Solution: To further grasp at this equation, we rearrange the equation into \[\lfloor{x}\rfloor^2=3x-2.\] Thus, $3x-2$ is a perfect square and nonnegative. It is now much more apparent that $x \ge 2/3,$ and that $x = 2/3$ is a solution.
Additionally, by observing the RHS, $x<4,$ as \[\lfloor{4}\rfloor^2 > 3\cdot4,\] since squares grow quicker than linear functions.
Now that we have narrowed down our search, we can simply test for intervals $[2/3,1], [1,2],[2,3],[3,4).$ This intuition to use intervals stems from the fact that $x=1,2$ are observable integral solutions.
Notice how there is only one solution per interval, as $3x-2$ increases while $\lfloor{x}\rfloor^2$ stays the same.
Finally, we see that $x=3$ does not work, however, through setting $\lfloor{x}\rfloor^2 = 9,$ $x = 11/3$ is a solution and within our domain of $[3,4).$
This provides us with solutions $\left(\frac23, 1, 2, \frac{11}{3}\right),$ thus the final answer is $\boxed{4}.$

Answer: B 4
Problem: How many distinct values of $x$ satisfy $\lfloor{x}\rfloor^2-3x+2=0$ , where $\lfloor{x}\rfloor$ denotes the largest integer less than or equal to $x$
$\textbf{(A) } \text{an infinite number} \qquad \textbf{(B) } 4 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 0$

Solution: Notice there has to be a solution for $x$ between $(2,-3)$ and $(1,2)$ because of the floors. There is also no way $2$ solutions because of the quadratic, and when we add them together, we get $\boxed{4}.$ ~perion.

Answer: B 4
Problem: How many distinct values of $x$ satisfy $\lfloor{x}\rfloor^2-3x+2=0$ , where $\lfloor{x}\rfloor$ denotes the largest integer less than or equal to $x$
$\textbf{(A) } \text{an infinite number} \qquad \textbf{(B) } 4 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 0$

Solution: First, let's take care of the integer case--clearly, only $x=1,2$ work.
Then, we know that $3x$ must be an integer. Set $x=\frac{a}3$ . Now, there are two cases for the value of $\lfloor x\rfloor$ .
Case 1: $\lfloor x\rfloor=\frac{a-1}{3}$ \[\frac{a^2-2a+1}{9}=a-2\rightarrow a^2-2a+1=9a-18\rightarrow a^2-11a+19=0.\] There are no solutions in this case.
Case 2: $\lfloor x\rfloor=\frac{a-2}{3}$ \[\frac{a^2-4a+4}{9}=a-2\rightarrow a^2-4a+4=9a-18\rightarrow a^2-13a+22=0.\] This case provides the two solutions $\frac23$ and $\frac{11}3$ as two more solutions. Our final answer is thus $\boxed{4}$

Answer:  4