This problem is basically
If I plug in n = 16 and r = 9
So there are 4151347200 different nine player batting orders that can be chosen from a baseball team of 16 :)
Answer:
<h3>See explanations below</h3>
Step-by-step explanation:
1) Given the recursive function An=an-1 + 3 when a1 = 5, we are to find the first four terms;
First term a1 = 5
a2 = a1 +3
a2 = 5 + 3
a2 = 8
a3 = a2 + 3
a3 = 8+3
a3 = 11
a4 = a3 + 3
a4 = 11 + 3
a4 = 14
<em>The first four terms are 5, 8, 11 and 14</em>
<em></em>
<em>2) </em>For the recursive function An=an-1 + 2/3 when a1 = 1
a2 = a1 + 2/3
a2 = 1 + 2/3
a2 = 5/3
a3 = a2 + 2/3
a3 = 5/3 + 2/3
a3 = 7/3
a4 = a3 + 2/3
a4 = 7/3 + 2/3
a4 = 9/3
a4 = 3
<em>Hence the first four terms of the sequence are 2/3, 5/3, 7/3, 3</em>
<em></em>
3) For the recursive function An=an-1 + 12 when a1=30
a2 = a1 + 12
a2 = 30 + 12
a2 = 42
a3 = a2 +12
a3 = 42 + 12
a3 = 54
a4 = a3 + 12
a4 = 54+12
a4 = 66
<em>Hence the first four terms of the sequence are 30, 42, 54, 66</em>
Answer:
B
Step-by-step explanation:
I hope I helped you.
Answer:erhy46jj
Step-by-step explanation: