Answer:
149.5
Step-by-step explanation:
Answer:
x > 8
Step-by-step explanation:
The open circle means that 8 is not included in the solution.
All values greater than 8 are included.
Answer: x > 8
Answer:
7,140
Step-by-step explanation:
Given the following :
Total Number of majors = 120
To obtain a double major, any to majors are combined) 2
Hence, maximum number of double majors available by obtaining 120C2.
Recall :
nCr = n! / (n-r)! r!
120C2 = 120!/(120-2)!2!
120! / 118! × 2!
= (120 × 119) / 2 * 1
= 14280 / 2
= 7140 ways.
Hence, there are a maximum of 7,140 ways of combining two majors
10000000
Because 10 to the 7th power means multiply 10 by itself 7 times.
The recursive formula of the sequence is f(n) = 12 + f(n -1), where f(1) = 5
<h3>How to determine the recursive formula?</h3>
The explicit formula of the arithmetic sequence is given as;
f(n) = 5 + 12(n - 1)
Open the bracket
f(n) = 5 + 12n - 12
Evaluate the like terms
f(n)= 12n - 7
Calculate f(1) and f(2)
f(1)= 12(1) - 7= 5
f(2)= 12(2) - 7= 17
The difference between f(1) and f(2) is 12
Hence, the recursive formula of the sequence is f(n) = 12 + f(n -1), where f(1) = 5
Read more about sequence at:
brainly.com/question/7882626
#SPJ1
<u>Complete question</u>
The explicit formula of the arithmetic sequence is f(n)=5+12(n-1)
Determine the recursive formula