Answer:
C
Step-by-step explanation:
Answer:
3/1
Step-by-step explanation:
Answer: 2405970 ways
Step-by-step explanation:
When the order of selecting r individuals out of n individual , we use permutations.
The number of permutations of r things taking out of n things is given by :-

Given : There are 135 people and three door prizes .
i.e. n= 135 , r= 3
Then, the total number of ways = 

Hence, there are 2405970 ways to distribute door prizes of $7,500, $750 and $75 .
Answer:
171
Step-by-step explanation:
First you plug -4 into the g(x) equation
g(-4)= 1-3(-4)
Use pemdas
g(-4)= 1+12
g(-4)= 13
Next you plug 13 into the f(x) equation
f(13)= 13^2 + 2
First you do 13^2=169
Add 2 and you get 171