Write an explicit furmula for the question below 40 points!!!!!!!!!!!!!
1 answer:
Answer:
aₙ = a₁ . 5⁽ⁿ⁻¹⁾
Step-by-step explanation:
The first term in the sequence is a₁ = 6.
a₂ = 30. a₃ = 150.
We see that each consecutive term is multiplies by 5 to arrive at the next term.
That is: a₂ = 30 = a₁ . = 6.5 = 30.
Similarly, a₃ = 150 = 6
Generalizing this, we have:
aₙ = a₁ .
This is called the recursive formula of the sequence.
You might be interested in
Answer:
0 onto functions
Step-by-step explanation:
Let the sets be such that:
Required
The number of onto functions
The condition for onto functions is:
For there to be an onto function from set A to set B, the number of elements of B must be less than the elements in set A
Since n(B) > n(A) i.e. 8 > 3
Then, there can't be onto functions from A to B