Answer:
it is c
Step-by-step explanation:
tje biggest is 34-9 which is smallest and get 25
Since there is no repetition allowed, there are 10 possibilities for the 1st digit, 9 for the 2nd, 8 for the 3rd, and 7 for the 4th. This gives a total of (10)(9)(8)(7) = 5040 four-digit codes.
For all odd digits to be used, there are 5 possibilities for the 1st digit (1,3,5,7,9), 4 for the 2nd, 3 for the 3rd, 2 for the 4th. This gives a total of (5)(4)(3)(2) = 120 codes that only use odd digits.
Therefore there are 5040 - 120 = 4920 codes that do not consist of all odd digits. The probability is 4920/5040 = 41/42.
Answer:
Step-by-step explanation:
We have to find the quotient of the following division, 
.
Now,
= ![- \frac{3}{4} p^{[- 4 - (- 12)]} q^{[-6 - (- 3)]}](https://tex.z-dn.net/?f=-%20%5Cfrac%7B3%7D%7B4%7D%20p%5E%7B%5B-%204%20-%20%28-%2012%29%5D%7D%20q%5E%7B%5B-6%20-%20%28-%203%29%5D%7D)
{Since all the terms in the expression are in product form, so we can treat them separately}
{Since we know the property of exponent as 
}
= 
= (Answer)
{Since we know, 
}
Answer:
10 I think
Step-by-step explanation:
well we add it all together 2+1+3+4
Where an, an-1,a2, a1, a0 are constants. We call the term containing the highest power of x the leading term, and we call an the leading coefficient. The degree of the polynomial is the power of x in the leading term. We have already seen degree 0, 1, and 2 polynomials which were the constant, linear, and quadratic functions, respectively. Degree 3, 4, and 5
