Answer:
Recursive rule for arithmetic sequence = an = a[n-1] + 3
Step-by-step explanation:
Given arithmetic sequence;
-7, -4, -1, 2, 5, …
Find:
Recursive rule for arithmetic sequence;
Computation:
Let a1 = -7
So,
⇒ a2 = a1 + 3 = -4
⇒ a3 = a2 + 3 = -1
⇒ a4 = a3 + 3 = 2
⇒ a5 = a4 + 3 = 5
So, the recursive formula is
⇒ an = a[n-1] + 3
Recursive rule for arithmetic sequence = an = a[n-1] + 3
45/100 = 9/20
Work: divide by 5
Let's draw!
H 1 T
HT 2 HT
HTHT 3 HTHT
HTHTHT 4 HTHTHT
HTHTHTHT 5 HTHTHTHT
HTHTHTHTHT 6 HTHTHTHTHT
You can count the probabilities using this.
HHHHTT
HHHTHT
HHTHHT
HHTHTH
HHHTTH
HTHHHT
HTTHHH
HTHTHH
HTHHTH
THHHHT
THHHTH
THHTHH
THTHHH
TTHHHH
Therefore, I think the probability is 14/64. Not sure so check my work.
14 combinations
64 outcomes (2+4+8+16+32+64 or 2^n)
Answer:
4 and 2
Step-by-step explanation:
4x4+2x2
16+4=20
