How many ordered pairs of integers \((x,y) \) are there, subject to \( 1 \leq x \leq 10, 1 \leq y \leq 10 \), such that

\[ (x-5)(y-5) = 0? \]

**Details and assumptions**

For an **ordered pair of integers** \((a,b)\), the order of the integers matter. The ordered pair \((1, 2)\) is different from the ordered pair \((2,1) \).

×

Problem Loading...

Note Loading...

Set Loading...