Given that the first term is LaTeX: t_1=5t 1 = 5, and the recursive definition is LaTeX: t_{n+1}=3\cdot t_nt n + 1 = 3 ⋅ t n, wh
at would be the second term (i.e. LaTeX: t_2t 2)
Group of answer choices
3
5
8
15
Group of answer choices
3
5
8
15
1 answer:
You might be interested in
Answer:
120
Step-by-step explanation:
The number of friends is 5 and there are 5 seats only. So , we can find it out with the help of permutations ,
⇒ 5! / (5-5)!
⇒ 5! / 1!
⇒ 5!
⇒ 5 × 4 × 3 × 2 × 1
⇒ 120
<h3><u>Hence </u><u>there</u><u> </u><u>are</u><u> </u><u>1</u><u>2</u><u>0</u><u> </u><u>ways</u><u> </u><u>by</u><u> </u><u>which </u><u> 5 friends sit together at the movies in 5 seats</u><u>. </u></h3>