use function notation to write a recursive formula to represent the sequence: 3, 6, 9, …

f(n) = f(n − 1) + 3
f(n) = f(n − 1) + 2
f(n) = f(n − 1) ⋅ 3
f(n) = f(n − 1) ⋅ 2

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.

∠1≅∠2 by the alternate exterior angles theorem.

step-by-step explanation:

given, a ∥ b and ∠1 ≅ ∠3 .we have to prove that e ∥ f

we know that ∠1≅∠3 and that a || b because they are given. we see that by the alternate exterior angles theorem. therefore, ∠2≅∠3 by the transitive property. so, we can conclude that e || f by the converse alternate exterior angles theorem.

we have to fill the missing statement.

transitivity property states that if a = b and b = c, then a = c.

now, given ∠1≅∠3 and by transitivity property ∠2≅∠3 .

hence, to apply transitivity property one angle must be common which is not in result after applying this property which is ∠1.

the only options in which ∠1 is present are ∠1 and ∠2, ∠1 and ∠4

∠1 and ∠4 is not possible ∵ after applying transitivity we didn't get ∠4.

hence, the missing statement is ∠1≅∠2.

so, ∠1≅∠2 by the alternate exterior angles theorem.