This is the answer
.... <em>please</em><em> mark</em><em> brainliest</em>
Answer:
36
Step-by-step explanation:
12 x 3 = 36
Answer:
The given sequence 6, 7, 13, 20, ... is a recursive sequence
Step-by-step explanation:
As the given sequence is

- It cannot be an arithmetic sequence as the common difference between two consecutive terms in not constant.
As
, 
As d is not same. Hence, it cannot be an arithmetic sequence.
- It also cannot be a geometrical sequence and exponential sequence.
It cannot be geometric sequence as the common ratio between two consecutive terms in not constant.
As
,
, 
As r is not same, Hence, it cannot be a geometric sequence or exponential sequence. As exponential sequence and geometric sequence are basically the same thing.
So, if we carefully observe, we can determine that:
- The given sequence 6, 7, 13, 20, ... is a recursive sequence.
Please have a close look that each term is being created by adding the preceding two terms.
For example, the sequence is generated by starting from 1.

and

for n > 1.
<em>Keywords: sequence, arithmetic sequence, geometric sequence, exponential sequence</em>
<em>Learn more about sequence from brainly.com/question/10986621</em>
<em>#learnwithBrainly</em>
Actually, this answer would be true. Why?
The first equation is: a(sub <em>n</em>) = 8, 13, 18, 23
The second is: a(sub 1)=8 ; a(sub <em>n</em>)= a(sub <em>n</em>-1)+5
if you wish to find the second term, plug two into the equation for <em /><em>n</em>
8+5=13
to find the third, plug the second term, 13, in for <em>n.</em>
13+5=18.
Hope this helped! I know it's a bit on the late side, but at least you can get the general idea!
The total number of ways by words are formed is 35 ways.
According to the statement
We have given that the 5 letters and we have to make word from them and the letters are repeated as equal to letters in given words.
And we have to find the possible ways.
So, The given words are:
TEXAS and MEXICO
Here X = 2 and E = 2 and all other words are one time used words.
We can find possible ways by use of combination and permutation.
So,
Total number of ways = 
here 3 because three letters are not repeatable and 2 letters are repeated for 2 times.
So,
Total number of ways = 
Total number of ways = 
Total number of ways = 
Total number of ways = 15 + 20
Total number of ways = 35.
So, The total number of ways by letters are formed is 35 ways.
Learn more about combination and permutation here
brainly.com/question/11732255
#SPJ1