Correct me if I’m wrong but I believe it is C
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:
brainly.com/question/1216161.
#SPJ1
Given:
3, -2
1, 2
-1, -4
-1, 2
The format is (x,y)
The domain is all the x-values while range is all the y-values.
domain: (3,1, -1,-1) 2nd option given.
The answer is 4 square root 80
If the problem is 6r•s•4rt•10rst, then the answer is 240•r^3•s^2•t^2.