<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, Double summation of a function(which is recursive) with a recursion error</title>
    <link>http://www.mapleprimes.com/questions/143530-Double-Summation-Of-A-Functionwhich-Is-Recursive</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Wed, 10 Jun 2026 21:00:10 GMT</lastBuildDate>
    <pubDate>Wed, 10 Jun 2026 21:00:10 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, Double summation of a function(which is recursive) with a recursion error</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, Double summation of a function(which is recursive) with a recursion error</title>
      <link>http://www.mapleprimes.com/questions/143530-Double-Summation-Of-A-Functionwhich-Is-Recursive</link>
    </image>
    <item>
      <title>Change sum to add</title>
      <link>http://www.mapleprimes.com/questions/143530-Double-Summation-Of-A-Functionwhich-Is-Recursive?ref=Feed:MaplePrimes:Double summation of a function(which is recursive) with a recursion error:Comments#answer143621</link>
      <itunes:summary>&lt;p&gt;If you replace all three occurences of &lt;strong&gt;sum&lt;/strong&gt; with &lt;strong&gt;add&lt;/strong&gt;, then your function will work. However, it can be improved in several ways, which I'll write about later. I just wanted to get you a minimally working version before I work further with it.&lt;/p&gt;
&lt;p&gt;Edit: Here are some improvements:&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;f:= proc(h::And(even,nonnegint)) &lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; option remember;&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; local m;&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; h! - add(3*thisproc(2*m)*m, m= 1..h/2-1)&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;end proc:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;f(2):= 3:&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;g:= proc(n::nonnegint)&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; local a,m;&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; 3 + 2*n - add(add(f(2*a), a= 1..iquo(m,2)), m= 1..n)&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;end proc:&lt;/strong&gt;&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;If you replace all three occurences of &lt;strong&gt;sum&lt;/strong&gt; with &lt;strong&gt;add&lt;/strong&gt;, then your function will work. However, it can be improved in several ways, which I'll write about later. I just wanted to get you a minimally working version before I work further with it.&lt;/p&gt;
&lt;p&gt;Edit: Here are some improvements:&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;f:= proc(h::And(even,nonnegint)) &lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; option remember;&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; local m;&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; h! - add(3*thisproc(2*m)*m, m= 1..h/2-1)&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;end proc:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;f(2):= 3:&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;g:= proc(n::nonnegint)&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; local a,m;&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;&amp;nbsp;&amp;nbsp; 3 + 2*n - add(add(f(2*a), a= 1..iquo(m,2)), m= 1..n)&lt;/strong&gt;&lt;br&gt;&lt;strong&gt;end proc:&lt;/strong&gt;&lt;/p&gt;</description>
      <guid>143621</guid>
      <pubDate>Tue, 19 Feb 2013 00:17:30 Z</pubDate>
      <itunes:author>Carl Love</itunes:author>
      <author>Carl Love</author>
    </item>
    <item>
      <title>This works</title>
      <link>http://www.mapleprimes.com/questions/143530-Double-Summation-Of-A-Functionwhich-Is-Recursive?ref=Feed:MaplePrimes:Double summation of a function(which is recursive) with a recursion error:Comments#answer143622</link>
      <itunes:summary>&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;form name="worksheet_form"&gt;
&lt;table style="width: 576px;" align="center"&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/618333cbf532ace179cb4f869a6e507b.gif" alt="restart" width="58" height="23"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/c363eed69340b873bd1016e46e4f5a4e.gif" alt="``" width="11" height="23"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -77;" src="/view.aspx?sf=143622/454162/8aa9c01179a069404e1e0fefb64b6bfc.gif" alt="f := proc (h::nonnegint) option remember; if h = 2 then 3 else factorial(h)-add(3*f(2*k)*k, k = 1 .. (1/2)*h-1) end if end proc:" width="576" height="94" align="middle"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/3b31bd45caaf7919fe95f15c66fbbfec.gif" alt="f(6)" width="33" height="23"&gt;&lt;/p&gt;
&lt;table&gt;
&lt;tbody&gt;
&lt;tr valign="baseline"&gt;
&lt;td&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="center"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/a91c45ebc71e24c30266aae24403c335.gif" alt="621" width="28" height="23"&gt;&lt;/p&gt;
&lt;/td&gt;
&lt;td style="color: #000000; font-family: Times, serif; font-weight: bold; font-style: normal;" align="right"&gt;(1)&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/f25777ba6cd944bd1a707e65348abb48.gif" alt="g := proc (n) options operator, arrow; 3+2*n-add('add(f(2*a), a = 1 .. floor((1/2)*m))', m = 1 .. n) end proc:" width="489" height="23"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/e74d2da45e49850dbfaa13e6961ef70e.gif" alt="g(31)" width="42" height="23"&gt;&lt;/p&gt;
&lt;table&gt;
&lt;tbody&gt;
&lt;tr valign="baseline"&gt;
&lt;td&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="center"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/442d3fa91eb16fd63251dedd33ccbc44.gif" alt="-507281179225124992452984287450527" width="263" height="23"&gt;&lt;/p&gt;
&lt;/td&gt;
&lt;td style="color: #000000; font-family: Times, serif; font-weight: bold; font-style: normal;" align="right"&gt;(2)&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/ec8c0be2582e06fbb197c58009ed7acd.gif" alt="``" width="11" height="23"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/16983bcd25fe9b9c3b5c80f47a563f41.gif" alt="``" width="11" height="23"&gt;&lt;/p&gt;
&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;input type="hidden" name="sequence" value="1"&gt; &lt;input type="hidden" name="cmd" value="none"&gt;&lt;/form&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;p&gt;&lt;a href="/view.aspx?sf=143622/454162/double_sum.mw"&gt;Download double_sum.mw&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Comments:&lt;/p&gt;
&lt;p&gt;1. Up to &lt;a href="http://www.mapleprimes.com/questions/121489-Recursive-Function-Definition-Does-Not"&gt;http://www.mapleprimes.com/questions/121489-Recursive-Function-Definition-Does-Not&lt;/a&gt;, f is written as a recursive procedure.&lt;/p&gt;
&lt;p&gt;2. The add command&amp;nbsp; instead of the sum command in g.&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;form name="worksheet_form"&gt;
&lt;table style="width: 576px;" align="center"&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/618333cbf532ace179cb4f869a6e507b.gif" alt="restart" width="58" height="23"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/c363eed69340b873bd1016e46e4f5a4e.gif" alt="``" width="11" height="23"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -77;" src="/view.aspx?sf=143622/454162/8aa9c01179a069404e1e0fefb64b6bfc.gif" alt="f := proc (h::nonnegint) option remember; if h = 2 then 3 else factorial(h)-add(3*f(2*k)*k, k = 1 .. (1/2)*h-1) end if end proc:" width="576" height="94" align="middle"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/3b31bd45caaf7919fe95f15c66fbbfec.gif" alt="f(6)" width="33" height="23"&gt;&lt;/p&gt;
&lt;table&gt;
&lt;tbody&gt;
&lt;tr valign="baseline"&gt;
&lt;td&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="center"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/a91c45ebc71e24c30266aae24403c335.gif" alt="621" width="28" height="23"&gt;&lt;/p&gt;
&lt;/td&gt;
&lt;td style="color: #000000; font-family: Times, serif; font-weight: bold; font-style: normal;" align="right"&gt;(1)&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/f25777ba6cd944bd1a707e65348abb48.gif" alt="g := proc (n) options operator, arrow; 3+2*n-add('add(f(2*a), a = 1 .. floor((1/2)*m))', m = 1 .. n) end proc:" width="489" height="23"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/e74d2da45e49850dbfaa13e6961ef70e.gif" alt="g(31)" width="42" height="23"&gt;&lt;/p&gt;
&lt;table&gt;
&lt;tbody&gt;
&lt;tr valign="baseline"&gt;
&lt;td&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="center"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/442d3fa91eb16fd63251dedd33ccbc44.gif" alt="-507281179225124992452984287450527" width="263" height="23"&gt;&lt;/p&gt;
&lt;/td&gt;
&lt;td style="color: #000000; font-family: Times, serif; font-weight: bold; font-style: normal;" align="right"&gt;(2)&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/ec8c0be2582e06fbb197c58009ed7acd.gif" alt="``" width="11" height="23"&gt;&lt;/p&gt;
&lt;p style="margin: 0 0 0 0; padding-top: 0px; padding-bottom: 0px;" align="left"&gt;&lt;img style="vertical-align: -6;" src="/view.aspx?sf=143622/454162/16983bcd25fe9b9c3b5c80f47a563f41.gif" alt="``" width="11" height="23"&gt;&lt;/p&gt;
&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;input type="hidden" name="sequence" value="1"&gt; &lt;input type="hidden" name="cmd" value="none"&gt;&lt;/form&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;p&gt;&lt;a href="/view.aspx?sf=143622/454162/double_sum.mw"&gt;Download double_sum.mw&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Comments:&lt;/p&gt;
&lt;p&gt;1. Up to &lt;a href="http://www.mapleprimes.com/questions/121489-Recursive-Function-Definition-Does-Not"&gt;http://www.mapleprimes.com/questions/121489-Recursive-Function-Definition-Does-Not&lt;/a&gt;, f is written as a recursive procedure.&lt;/p&gt;
&lt;p&gt;2. The add command&amp;nbsp; instead of the sum command in g.&lt;/p&gt;</description>
      <guid>143622</guid>
      <pubDate>Tue, 19 Feb 2013 00:21:45 Z</pubDate>
      <itunes:author>Markiyan Hirnyk</itunes:author>
      <author>Markiyan Hirnyk</author>
    </item>
  </channel>
</rss>