{"id":14658,"date":"2016-03-06T22:47:05","date_gmt":"2016-03-06T22:47:05","guid":{"rendered":"http:\/\/www.oracletutoring.ca\/blog\/?p=14658"},"modified":"2016-03-06T22:47:05","modified_gmt":"2016-03-06T22:47:05","slug":"math-finding-the-general-solution-to-a-first-degree-nonhomogeneous-recurrence-relation","status":"publish","type":"post","link":"https:\/\/www.oracletutoring.ca\/blog\/math-finding-the-general-solution-to-a-first-degree-nonhomogeneous-recurrence-relation\/","title":{"rendered":"Math:  finding the general solution to a first degree nonhomogeneous recurrence relation"},"content":{"rendered":"<h1>The tutor shows how to find the general solution to the recurrence relation from last post.<\/h1>\n<p>In my <a href=\"?p=14621\">previous post<\/a> I posed the recurrence relation<\/p>\n<p style=\"text-align:center\">2a<sub>n+1<\/sub> &#8211; a<sub>n<\/sub> = 3, a<sub>0<\/sub>=12<\/p>\n<p>then generated the first few terms:<\/p>\n<p><img decoding=\"async\" src=\"\/..\/images\/recurtab_mar4_16.png\" style=\"display:block;margin:auto\" \/><\/p>\n<p>The general solution is a formula that, when n is inputted, yields a<sub>n<\/sub>.<\/p>\n<p><strong>Example:  Find the general solution to 2a<sub>n+1<\/sub> &#8211; a<sub>n<\/sub> = 3, a<sub>0<\/sub>=12<\/strong><\/p>\n<p>Solution:<\/p>\n<p>Grimaldi reveals that for an equation of the form<\/p>\n<p style=\"text-align:center\">a<sub>n+1<\/sub> + ra<sub>n<\/sub> = k<\/p>\n<p>the solution will take the form<\/p>\n<p style=\"text-align:center\">a<sub>n<\/sub> = Ar<sup>n<\/sup> + B<\/p>\n<p>where A, B are constants that need to be solved.<\/p>\n<p>To bring our equation to that form, we divide both sides by two:<\/p>\n<p style=\"text-align:center\">a<sub>n+1<\/sub> &#8211; 0.5a<sub>n<\/sub> = 1.5<\/p>\n<p>The general solution will have the form<\/p>\n<p style=\"text-align:center\">a<sub>n<\/sub> = A(0.5)<sup>n<\/sup> + B<\/p>\n<p>In our case, a<sub>0<\/sub> = 12:<\/p>\n<p style=\"text-align:center\">a<sub>0<\/sub> = 12 = A(0.5)<sup>0<\/sup> + B<\/p>\n<p>so that<\/p>\n<p style=\"text-align:center\">12 = A + B<\/p>\n<p>Solving for B we get<\/p>\n<p style=\"text-align:center\">12 &#8211; A = B<\/p>\n<p>Then, for a<sub>1<\/sub> = 7.5, we get<\/p>\n<p style=\"text-align:center\">7.5 = A(0.5)<sup>1<\/sup> + B<\/p>\n<p>which means<\/p>\n<p style=\"text-align:center\">7.5 = A(0.5) + B<\/p>\n<p>Recalling 12 &#8211; A = B, we can rewrite:<\/p>\n<p style=\"text-align:center\">7.5 = A(0.5) + 12 &#8211; A<\/p>\n<p>which gives<\/p>\n<p style=\"text-align:center\">7.5-12 = -0.5A<\/p>\n<p>then<\/p>\n<p style=\"text-align:center\">-4.5 = -0.5A<\/p>\n<p>Next, dividing both sides by -0.5, we arrive at<\/p>\n<p style=\"text-align:center\">9 = A<\/p>\n<p>Then<\/p>\n<p style=\"text-align:center\">12 &#8211; A = B<\/p>\n<p>becomes<\/p>\n<p style=\"text-align:center\">12 &#8211; 9 = B<\/p>\n<p>so that<\/p>\n<p style=\"text-align:center\">B = 3<\/p>\n<p>Apparently, the general solution to 2a<sub>n+1<\/sub> &#8211; a<sub>n<\/sub> = 3, a<sub>0<\/sub>=12, is a<sub>n<\/sub> = 9(0.5)<sup>n<\/sup> + 3<\/p>\n<p>We seek to confirm the solution:  From the table, a<sub>4<\/sub> = 3.5625.  Plugging 4 in for n in our general solution gives<\/p>\n<p style=\"text-align:center\">a<sub>4<\/sub> = 9(0.5)<sup>4<\/sup> + 3 = 0.5625 + 3 = 3.5625<\/p>\n<p>HTH:<\/p>\n<p>Source:<\/p>\n<p>Grimaldi, Ralph P.  <u>Discrete and Combinatorial Mathematics<\/u>.  Don Mills:  Addison-<br \/>&nbsp;&nbsp;Wesley, 1994.<\/p>\n<p>Jack of <a href=\"https:\/\/www.oracletutoring.ca\">Oracle Tutoring by Jack and Diane,<\/a> Campbell River, BC.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The tutor shows how to find the general solution to the recurrence relation from last post. In my previous post I posed the recurrence relation 2an+1 &#8211; an = 3, a0=12 then generated the first few terms: The general solution &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"more-link\" href=\"https:\/\/www.oracletutoring.ca\/blog\/math-finding-the-general-solution-to-a-first-degree-nonhomogeneous-recurrence-relation\/\"> <span class=\"screen-reader-text\">Math:  finding the general solution to a first degree nonhomogeneous recurrence relation<\/span> Read More &raquo;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[1476,1479,1477,1480],"class_list":["post-14658","post","type-post","status-publish","format-standard","hentry","category-math","tag-difference-equation","tag-first-degree-difference-equation","tag-first-degree-nonhomogeneous-recurrence-relation","tag-general-solution-to-first-degree-nonhomogeneous-recurrence-relation"],"_links":{"self":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts\/14658","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/comments?post=14658"}],"version-history":[{"count":29,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts\/14658\/revisions"}],"predecessor-version":[{"id":14687,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts\/14658\/revisions\/14687"}],"wp:attachment":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/media?parent=14658"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/categories?post=14658"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/tags?post=14658"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}