f (n + 1) = f(n) – 5 is the recursive formula can be used to generate the sequence below, where f(1) = 6 and n ≥ 1
<h3><u>Solution:</u></h3>
Given that,
f(1) = 6 and n ≥ 1
Given sequence is 6, 1, -4, -9, -14
<em><u>Let us first analyse the logic used in this sequence</u></em>
6 - 5 = 1
1 - 5 = -4
-4 - 5 = -9
-9 - 5 = -14
Thus the next terms in sequence are obtained by subtracting 5 from previous term
Thus a recursive formula can be formed as:
f (n + 1) = f(n) – 5
Where "n" is the nth term
Let us check our recursive formula:
f(1+ 1) = f(1) - 5
f(2) = f(1) - 5
f(2) = 6 - 5 = 1
Thus we have got f(2) = 1 which is correct as per given sequence
We know that
step 1the area to install tiles is equal to A
A=area rectangle-area of a circle
area of a rectangle=(13+x)*x-----> (13x+x²) ft²
area of a circle=pi*r²-----> pi*6²------> 36*pi ft²
A=(x²+13x)-36*pi ft²
step 2
find the cost of installing tiles CT
CT=$1*[(x²+13x)-36*pi]-----> CT=$x²+$13x-$36*pi
step 3
find the cost <span>the of installing the pond CP
CP=$0.62*36*pi------> CP$22.32*pi
step 4
find the inequality
we know that
CT+CP </span>

<span> $536
[</span>$x²+$13x-$36*pi]+[$22.32*pi]

$536
[$x²+$13x-$13.68*pi]

$536
the answer is the option D
Answer:
Step-by-step explanation:
Answer:
.98
Step-by-step explanation:
1-(35/43)^18 im in stats too tehee
Possible outcomes :
Heads Heads
Heads Tails
Tails Tails
Tails Heads
Probability of matching : 2/4 = 0.5
Torin should agree since the proposal is fair