Answer:
amog us
Step-by-step explanation:
Answer:
-5 or 5 depending on how you write the simplified form
Step-by-step explanation:
__
The applicable rules of exponents are ...
(a^b)(a^c) = a^(b+c)
1/a^b = a^-b
__
Some folks like their simplified form to contain only positive exponents. Other folks avoid unnecessary fractions. Choose the form that satisfies your grader.
Answer: 8648640 ways
Step-by-step explanation:
Number of positions = 7
Number of eligible candidates = 13
This can be done by solving the question using the combination Formula for selection in which we use the combination formula to choose 7 candidates amomg the possible 13.
The combination Formula is denoted as:
nCr = n! / (n-r)! * r!
Where n = total number of possible options.
r = number of options to be selected.
Hence, selecting 7 candidates from 13 becomes:
13C7 = 13! / (13-7)! * 7!
13C7 = 1716.
Considering the order they can come in, they can come in 7! Orders. We multiply this order by the earlier answer we calculated. This give: 1716 * 7! = 8648640
Answer:
Step-by-step explanation:
multiply 64 and 8
512
dividing both sides by -4, we get:
this means, each term is its previous term divided by -4.
now we can construct the sequence as follows:
Answer: the last term is -1/32
