Step-by-step explanation:
Permutation
:The number of ways to choose a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed.
Factorial
: There are n! ways of arranging n distinct objects into an ordered sequence.
Considering a situation when n = r in a permutation, nPr reduces to n!, a simple factorial of n.
Proof: 3P3 = 3!
n = 3 and r = 3
But 0! = 1
3P3 = 3!
$13 (?) off the original price of 240 is 229. She will have to pay $229.00
Answer:
Step-by-step explanation:
Can you give me more information on the question, so i can make sure that i give you the correct answer . I think its A but not totally for sure
<span>For the plane, we have z = 5x + 9y
For the region, we first find its boundary curves' points of intersection.
x = x^4 ==> x = 0, 1.
Since x > x^4 for y in [0, 1],
The volume of the solid equals
</span>