To answer this problem, the utilization of the provided formula is of utmost importance.
The formula to be used would be for the combination with no repetition since it is what is asked and possibly happens when involving the products mentioned in the problem. The formula would be
n! where in
------------- n = number of things to choose from
(n - r)! r! r = number of things needed to form
the symbol ! is called a factorial function which replaces the sequence of multiplying a number in a descending order.
lets substitute and solve
13!
--------------
(13 - 6)! 6!
13!
-------------
(7!) 6!
6,227,020,800
-------------------
5,040 x 720
6,227,020,800
-------------------
3,628,800
1,716
The answer would be 1,716.
F(g(3))
f(4 * 3^2 + 9)
f(45)
3 * 45 - 1
134
Answer:
435.2kg (1DP)
Step-by-step explanation:
0.64x680
64 divided by 100 = 0.64
Answer:
2835x^5.
Step-by-step explanation:
By Binomial Theorem, T(r+1) = nCr * a^(r+1) * b^r.
Term 5 = 7C4 * x^5 * 3^4
= 35 * x^5 * 3^4
= 2835x^5.
$42.
13/2 = 6.5, 25/4 = 6.25, 42/7 = 6.
