Write a recursive formula for a_na n , the n^{\text{th}}n th term of the sequence 16, -8, 4, ...16,−8,4,....
1 answer:
You might be interested in
To solve that question we can think by the following way:
- The first letter can be any of the letters (A, C, T or G). Therefore there are 4 possibilites.
- To choose the second letter of the sequence, any letter also can be chose. So, one more time, there are 4 possibilites.
Using the fundamental principle of counting, we will find out that can be formed differents sequences (for example, AA, AG, TT, TG, CT...).
Know we know that, we can generalize. If I have elements and I must choose one of them
times to do a sequence, the total number of sequence that I can form will be
.
In our question, we want to know how many DNA sequence are exactly 29 letters long. As indicated above, the answer for that is (29 times)
.
Therefore, there are DNA sequences with exactly 29 letters long.
I hope I've helped you. =D
Enjoy your studies. \o/