Which is equivalent to 3v8
2 answers:
You might be interested in
Answer:
f(n) = f(n - 1) + 3
Step-by-step explanation:
Substitute to get the recursive formula.
OPTION 1: f(n) = f(n - 1) + 3
Substituting n = 1.
f(1) = f(1 - 1) + 3 = 0 + 3 = 3.
Substituting n = 2.
f(2) = f(2 - 1) + 3 = f(1) + 3 = 3 + 3 = 6.
Substituting n = 3.
f(3) = f(3 - 1) + 3 = f(2) + 3 = 6 + 3 = 9.
The numbers match the given sequence. So, we say the above recursive formula represents the sequence.
OPTION 2: f(n) = f(n - 1) + 2
Substituting n = 1
f(1) = f(0) + 2 3.
So, this is eliminated.
Similarly, OPTION 3 and OPTION 4 can be eliminated as well.
Answer: 5/6, 19/36, 11/24, 7/18
Step-by-step explanation:
Descending order is going from largest to smallest. We can do this by comparing the fractions. We make all the fractions have the same denominator. Then we will see which has the larger numerator.
A common denominator we can use is 72, since it is a common multiple.
Now that all the numbers have the same denominator, we compare to see which number is largest to smallest.
With our descending order, let's put it back into the original fractions.