Question and Answers Forum

All Questions      Topic List

Mensuration Questions

Previous in All Question      Next in All Question      

Previous in Mensuration      Next in Mensuration      

Question Number 109834 by 675480065 last updated on 25/Aug/20

Commented by 675480065 last updated on 25/Aug/20

Greetings. please i need help

$$\mathrm{Greetings}. \\ $$$$\mathrm{please}\:\mathrm{i}\:\mathrm{need}\:\mathrm{help} \\ $$

Answered by mathmax by abdo last updated on 25/Aug/20

1)u_0 =1 ,u_1 =3 and u_(n+1) =3u_n +4u_(n−1) ⇒ u_(n+2) =3u_(n+1) +4u_n ⇒u_(n+2) −3u_(n+1) −4u_n =0 →x^2 −3x −4 =0 Δ =9+16 =25 ⇒x_1 =((3+5)/2) =4 and x_2 =((3−5)/2) =−1 ⇒ u_n =a 4^n +b(−1)^n we have u_0 =a+b =1 and u_1 =4a−b =3 ⇒ { ((a+b=1 _(⇒ { ((b=1−a)),((4a−1+a =3 ⇒)) :}) )),((4a−b =3 )) :} { ((5a =4)),((b=1−a ⇒ { ((a =(4/5) ⇒ { (),() :})),((b =(1/5))) :})) :} ⇒ u_n =(4/5).4^n +(1/5)(−1)^n ⇒u_n =(1/5){ 4^(n+1) +(−1)^n } ⇒ u_2 =(1/5){ 4^3 +1} =(1/5){65} =((65)/5)

$$\left.\mathrm{1}\right)\mathrm{u}_{\mathrm{0}} =\mathrm{1}\:,\mathrm{u}_{\mathrm{1}} =\mathrm{3}\:\mathrm{and}\:\mathrm{u}_{\mathrm{n}+\mathrm{1}} =\mathrm{3u}_{\mathrm{n}} +\mathrm{4u}_{\mathrm{n}−\mathrm{1}} \:\Rightarrow \\ $$$$\mathrm{u}_{\mathrm{n}+\mathrm{2}} =\mathrm{3u}_{\mathrm{n}+\mathrm{1}} +\mathrm{4u}_{\mathrm{n}} \:\Rightarrow\mathrm{u}_{\mathrm{n}+\mathrm{2}} −\mathrm{3u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} =\mathrm{0}\:\rightarrow\mathrm{x}^{\mathrm{2}} −\mathrm{3x}\:−\mathrm{4}\:=\mathrm{0} \\ $$$$\Delta\:=\mathrm{9}+\mathrm{16}\:=\mathrm{25}\:\Rightarrow\mathrm{x}_{\mathrm{1}} =\frac{\mathrm{3}+\mathrm{5}}{\mathrm{2}}\:=\mathrm{4}\:\mathrm{and}\:\mathrm{x}_{\mathrm{2}} =\frac{\mathrm{3}−\mathrm{5}}{\mathrm{2}}\:=−\mathrm{1}\:\Rightarrow \\ $$$$\mathrm{u}_{\mathrm{n}} =\mathrm{a}\:\mathrm{4}^{\mathrm{n}} \:+\mathrm{b}\left(−\mathrm{1}\right)^{\mathrm{n}} \:\:\mathrm{we}\:\mathrm{have}\:\mathrm{u}_{\mathrm{0}} =\mathrm{a}+\mathrm{b}\:=\mathrm{1}\:\mathrm{and}\:\mathrm{u}_{\mathrm{1}} =\mathrm{4a}−\mathrm{b}\:=\mathrm{3}\:\Rightarrow \\ $$$$\begin{cases}{\mathrm{a}+\mathrm{b}=\mathrm{1}\:\:\:\:\:\:\:_{\Rightarrow\:\:\:\:\:\:\:\:\begin{cases}{\mathrm{b}=\mathrm{1}−\mathrm{a}}\\{\mathrm{4a}−\mathrm{1}+\mathrm{a}\:=\mathrm{3}\:\Rightarrow}\end{cases}} }\\{\mathrm{4a}−\mathrm{b}\:=\mathrm{3}\:}\end{cases} \\ $$$$\begin{cases}{\mathrm{5a}\:=\mathrm{4}}\\{\mathrm{b}=\mathrm{1}−\mathrm{a}\:\Rightarrow\:\:\:\:\:\:\:\:\:\:\:\:\:\begin{cases}{\mathrm{a}\:=\frac{\mathrm{4}}{\mathrm{5}}\:\Rightarrow\:\:\:\:\:\begin{cases}{}\\{}\end{cases}}\\{\mathrm{b}\:=\frac{\mathrm{1}}{\mathrm{5}}}\end{cases}}\end{cases} \\ $$$$\Rightarrow\:\mathrm{u}_{\mathrm{n}} =\frac{\mathrm{4}}{\mathrm{5}}.\mathrm{4}^{\mathrm{n}} \:+\frac{\mathrm{1}}{\mathrm{5}}\left(−\mathrm{1}\right)^{\mathrm{n}} \:\Rightarrow\mathrm{u}_{\mathrm{n}} =\frac{\mathrm{1}}{\mathrm{5}}\left\{\:\mathrm{4}^{\mathrm{n}+\mathrm{1}} \:+\left(−\mathrm{1}\right)^{\mathrm{n}} \right\} \\ $$$$\Rightarrow\:\mathrm{u}_{\mathrm{2}} =\frac{\mathrm{1}}{\mathrm{5}}\left\{\:\mathrm{4}^{\mathrm{3}} \:+\mathrm{1}\right\}\:=\frac{\mathrm{1}}{\mathrm{5}}\left\{\mathrm{65}\right\}\:=\frac{\mathrm{65}}{\mathrm{5}} \\ $$$$ \\ $$

Commented by 675480065 last updated on 26/Aug/20

thanks

$$\mathrm{thanks} \\ $$

Commented by abdomsup last updated on 26/Aug/20

you are welcome

$${you}\:{are}\:{welcome} \\ $$

Answered by Aziztisffola last updated on 25/Aug/20

(i) u_2 =3u_1 +4u_0 =9+4=13 (ii) u_(n+1) −4u_n =−(u_n −4u_(n−1) ) =−(−(u_(n−2) −4u_(n−3) )) =(−1)^2 (u_(n−2) −4u_(n−3) ) =(−1)^3 (u_(n−4) −4u_(n−5) ) =.............................. =(−1)^(n+1) (u_1 −4u_0 ) (iii) u_(n+1) −4u_n =(−1)^(n+1) (u_1 −4u_0 ) =(−1)^(n+1) (3−4)=(−1)^(n+2) ⇒u_(n+1) −4u_n =(−1)^(n+2) ⇒u_(n+1) =(−1)^(n+2) +4u_n

$$\:\left(\mathrm{i}\right)\:\mathrm{u}_{\mathrm{2}} =\mathrm{3u}_{\mathrm{1}} +\mathrm{4u}_{\mathrm{0}} =\mathrm{9}+\mathrm{4}=\mathrm{13} \\ $$$$\:\left(\mathrm{ii}\right)\:\mathrm{u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} =−\left(\mathrm{u}_{\mathrm{n}} −\mathrm{4u}_{\mathrm{n}−\mathrm{1}} \right) \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:=−\left(−\left(\mathrm{u}_{\mathrm{n}−\mathrm{2}} −\mathrm{4u}_{\mathrm{n}−\mathrm{3}} \right)\right) \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:=\left(−\mathrm{1}\right)^{\mathrm{2}} \left(\mathrm{u}_{\mathrm{n}−\mathrm{2}} −\mathrm{4u}_{\mathrm{n}−\mathrm{3}} \right) \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:=\left(−\mathrm{1}\right)^{\mathrm{3}} \left(\mathrm{u}_{\mathrm{n}−\mathrm{4}} −\mathrm{4u}_{\mathrm{n}−\mathrm{5}} \right) \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:=.............................. \\ $$$$\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:\:=\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{1}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right) \\ $$$$\:\left(\mathrm{iii}\right)\:\mathrm{u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} =\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{1}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right) \\ $$$$\:=\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{1}} \left(\mathrm{3}−\mathrm{4}\right)=\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{2}} \\ $$$$\:\Rightarrow\mathrm{u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} =\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{2}} \\ $$$$\Rightarrow\mathrm{u}_{\mathrm{n}+\mathrm{1}} =\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{2}} +\mathrm{4u}_{\mathrm{n}} \\ $$

Answered by mathmax by abdo last updated on 25/Aug/20

2) i think tbe relstion is u_(n+1) −4u_n =(−1)^n (u_1 −4u_0 ) let prove it by recurrence n =0 ⇒u_1 −4u_0 =(−1)^o (u_1 −4u_0 ) the relstion is true let suppose u_(n+1) −4u_n =(−1)^n (u_1 −4u_0 ) and show u_(n+2) −4u_(n+1) =(−1)^(n+1) (u_1 −4u_0 ) we have u_(n+1) =3u_n +4u_(n−1) ⇒ u_(n+2) =3u_(n+1) +4u_n ⇒u_(n+2) −4u_(n+1) =−u_(n+1) +4u_n =−(u_(n+1) −4u_n ) =−(−1)^n (u_1 −4u_0 ) =(−1)^(n+1) (u_1 −4u_0 ) the relation is true st term n+1

$$\left.\mathrm{2}\right)\:\:\mathrm{i}\:\mathrm{think}\:\mathrm{tbe}\:\mathrm{relstion}\:\mathrm{is}\:\mathrm{u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} =\left(−\mathrm{1}\right)^{\mathrm{n}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right) \\ $$$$\mathrm{let}\:\mathrm{prove}\:\mathrm{it}\:\mathrm{by}\:\mathrm{recurrence}\: \\ $$$$\mathrm{n}\:=\mathrm{0}\:\Rightarrow\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} =\left(−\mathrm{1}\right)^{\mathrm{o}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right)\:\mathrm{the}\:\mathrm{relstion}\:\mathrm{is}\:\mathrm{true}\: \\ $$$$\mathrm{let}\:\mathrm{suppose}\:\:\mathrm{u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} =\left(−\mathrm{1}\right)^{\mathrm{n}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right)\:\mathrm{and}\:\mathrm{show} \\ $$$$\mathrm{u}_{\mathrm{n}+\mathrm{2}} −\mathrm{4u}_{\mathrm{n}+\mathrm{1}} =\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{1}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right)\:\mathrm{we}\:\mathrm{have}\:\mathrm{u}_{\mathrm{n}+\mathrm{1}} =\mathrm{3u}_{\mathrm{n}} +\mathrm{4u}_{\mathrm{n}−\mathrm{1}} \:\Rightarrow \\ $$$$\mathrm{u}_{\mathrm{n}+\mathrm{2}} =\mathrm{3u}_{\mathrm{n}+\mathrm{1}} +\mathrm{4u}_{\mathrm{n}} \:\Rightarrow\mathrm{u}_{\mathrm{n}+\mathrm{2}} −\mathrm{4u}_{\mathrm{n}+\mathrm{1}} =−\mathrm{u}_{\mathrm{n}+\mathrm{1}} +\mathrm{4u}_{\mathrm{n}} \\ $$$$=−\left(\mathrm{u}_{\mathrm{n}+\mathrm{1}} −\mathrm{4u}_{\mathrm{n}} \right)\:=−\left(−\mathrm{1}\right)^{\mathrm{n}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right)\:=\left(−\mathrm{1}\right)^{\mathrm{n}+\mathrm{1}} \left(\mathrm{u}_{\mathrm{1}} −\mathrm{4u}_{\mathrm{0}} \right) \\ $$$$\mathrm{the}\:\mathrm{relation}\:\mathrm{is}\:\mathrm{true}\:\mathrm{st}\:\mathrm{term}\:\mathrm{n}+\mathrm{1} \\ $$$$ \\ $$

Commented by 675480065 last updated on 26/Aug/20

thanks so much. is it possible if you can complete it.? pls

$$\mathrm{thanks}\:\mathrm{so}\:\mathrm{much}. \\ $$$$\mathrm{is}\:\mathrm{it}\:\mathrm{possible}\:\mathrm{if}\:\mathrm{you}\:\mathrm{can}\:\mathrm{complete}\:\mathrm{it}.?\:\mathrm{pls} \\ $$

Terms of Service

Privacy Policy

Contact: info@tinkutara.com