Answer:
see explanation
Step-by-step explanation:
Given the recursive formula
=
and
= 2
=
, then
=
( multiply both sides by 4 )
a₃ = 4 ×
= 9
= 9 ( multiply both sides by 4 )
a₂ = 36
= 36 ( multiply both sides by 4 )
a₁ = 144
The first 4 terms are
144, 36, 9, 2 
Answer:
d
Step-by-step explanation:
You distribute -7 into (4-2p) and then combine like terms to get 116=-28-18p
You must earn 243 points to have earned 93% of all possible points.
We first multiply each percentage on the previous tests by 150:
0.88*150 = 132
0.94*150 = 141
0.9*150 = 135
The total number of points possible is given by adding up the possible points for the three previous tests and the 250 for the last test:
150+150+150+250 = 700
93% of the 700 points would be 0.93(700) = 651 points.
Now we have 132+141+135+x (last test) = 651
408 + x = 651
Subtract 408 from both sides:
408+x-408 = 651-408
x = 243
Step-by-step explanation:
that is
sum(2^r) for r=1 to n, plus sum(1/2) for r=1 to n.
and that is
sum(2^r) + n/2 for r=1 to n.
2^r is a geometric sequence with 2 being the common ratio (every new term is created by multiplying the previous term by 2).
and since r is starting at 1, the first term a1 = 2.
the formula for the sum of a finite geometric sequence is
Sn = a1×(1 - r^n) / (1 - r)
with r being the common ratio .
so, in our case
Sn = 2×(1 - 2^n) / (1 - 2)
Sn = (2 - 2^(n+1)) / -1 = 2^(n+1) - 2
and so, in total we get
2^(n+1) - 2 + n/2 = 2^(n+1) + (n - 4)/2
Answer:
Yes.
Step-by-step explanation:
This relation is a function because each input has one and only one output, i.e. 2 yields 1, 4 yields 2, 6 yields 3, 8 yields 4 and 10 has an output of 3. Therefore, it is a function.