Select all the sequences of transformations that always maintain congruence. a reflection and then a translation a translation a
1 answer:
You might be interested in
15444 ways we can choose 5 objects, without replacement, from 15 distinct objects.
Given that, suppose we want to choose 5 objects, without replacement, from 15 distinct objects.
<h3>What is a permutation?</h3>A permutation is a mathematical calculation of the number of ways a particular set can be arranged, where the order of the arrangement matters.
Now, = 13!/(13-5)!
= 13!/8! = 13x12x11x10x9= 1287 x 120 = 15,444
Therefore, 15444 ways we can choose 5 objects, without replacement, from 15 distinct objects.
To learn more about the permutation visit:
#SPJ1