The question requires finding the distance between two points given in a coordinate plane. Point A has coordinates $(-5, 7)$ and Point B has coordinates $(-1, 3)$. We can use the distance formula, a standard tool in coordinate geometry, to solve this.
The distance formula is derived from the Pythagorean theorem ($a^2 + b^2 = c^2$). It helps find the length of the hypotenuse (the distance, $d$) of a right triangle formed by the horizontal and vertical distances between two points $(x_1, y_1)$ and $(x_2, y_2)$. The formula is:
$d = \sqrt{(x_2 - x_1)^2 + (y_2 - y_1)^2}$
Here's what the variables represent:
Given points:
Let's substitute these coordinates into the distance formula step-by-step:
The distance is $\sqrt{32}$. We can simplify this radical by finding the largest perfect square factor of 32, which is 16.
$ d = \sqrt{16 \times 2} $
Using the property $\sqrt{ab} = \sqrt{a} \times \sqrt{b}$:
$ d = \sqrt{16} \times \sqrt{2} $
$ d = 4 \times \sqrt{2} = 4\sqrt{2} $
Therefore, the distance between points A and B is $4\sqrt{2}$ units.
The calculated distance is $4\sqrt{2}$ units. Let's examine the provided options:
| Option 1: 4 units |
| Option 2: 6 units |
| Option 3: $4\sqrt{2}$ units |
| Option 4: 7 units |
The calculation matches Option 3.
A triangle is formed with vertices (0, 0), (0, 100) and (100, 100). What is the number of points inside the triangle with integer coordinates?
Suppose R is the region bounded by the two curves $Y = x^2$ and $Y = 2x^2 - 1$ as shown in the following diagram :

Two distinct lines are drawn such that each of these lines partitions the regions into at least two parts. If 'n' is the total number of regions generated by these lines, then :