What type of counting problem is this? How many different sequences of 3 playing cards (from a single 52-card deck) exist?
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
Let the ends of the given segment are A and B.
Coordinates of A → (8, 6)
Coordinates of B → (12, 12)
If a point (x, y) is dilated by a scale factor 'k' about the origin, rule to be followed,
(x, y) → (kx, ky)
If k =
(x, y) →
By this rule coordinates of the image points of A and B will be,
A(8, 6) →
→ A'(5.3, 4)
B(12, 12) →
→ B'(8, 8)
Now we can get the image of segment AB after dilation by a scale factor of .
