You would start out with multiplying giving you 5(x+6). then you would have a product of 5x+30. hoped this helped!
Answer:
See proof below
Step-by-step explanation:
We have to verify that if we substitute
in the equation
the equality is true.
Let's substitute first in the right hand side:
![3a_{n-1}+4a_{n-2}=3(4^{n-1}+2(-1)^{n-1})+4(4^{n-2}+2(-1)^{n-2})](https://tex.z-dn.net/?f=3a_%7Bn-1%7D%2B4a_%7Bn-2%7D%3D3%284%5E%7Bn-1%7D%2B2%28-1%29%5E%7Bn-1%7D%29%2B4%284%5E%7Bn-2%7D%2B2%28-1%29%5E%7Bn-2%7D%29)
Now we use the distributive laws. Also, note that
(this also works when the power is n-2).
![=3(4^{n-1})+6(-1)^{n-1}+4(4^{n-2})+8(-1)^{n-2}](https://tex.z-dn.net/?f=%3D3%284%5E%7Bn-1%7D%29%2B6%28-1%29%5E%7Bn-1%7D%2B4%284%5E%7Bn-2%7D%29%2B8%28-1%29%5E%7Bn-2%7D)
![=3(4^{n-1})+(-1)(6)(-1)^{n}+4^{n-1}+(-1)^2(8)(-1)^{n}](https://tex.z-dn.net/?f=%3D3%284%5E%7Bn-1%7D%29%2B%28-1%29%286%29%28-1%29%5E%7Bn%7D%2B4%5E%7Bn-1%7D%2B%28-1%29%5E2%288%29%28-1%29%5E%7Bn%7D)
![=4(4^{n-1})-6(-1)^{n}+8(-1)^{n}=4^n+2(-1)^n=a_n](https://tex.z-dn.net/?f=%3D4%284%5E%7Bn-1%7D%29-6%28-1%29%5E%7Bn%7D%2B8%28-1%29%5E%7Bn%7D%3D4%5En%2B2%28-1%29%5En%3Da_n)
then the sequence solves the recurrence relation.
1. 21,150
2. 2.5193
3. 27.98
4. 11,100
Answer:
n how many ways can a president, vice president, and a secretary be chosen? It is 12X11X10. Permutation of n things taken r at a time: nPr=n!/(n-r)! 12P3=12*11*10*9!/9!= 12*11*10=1320 ways.
Step-by-step explanation:
Answer:
T=21
Step-by-step explanation:
Plugin the values of m and a;
(3)2+(5)(3)
6+15= 21