From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: integer solutions for x_1+x_2+...+x_n = k
Date: Tue, 4 Nov 2008 21:19:02 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 20
Message-ID: <geqe85$chp$>
References: <geku21$eku$> <gel0b6$3li$>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: 1225833542 12857 (4 Nov 2008 21:19:02 GMT)
NNTP-Posting-Date: Tue, 4 Nov 2008 21:19:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1582760
Xref: comp.soft-sys.matlab:498952

"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <gel0b6$3li$>...

> Have you check the number of solutions for large n? It might be not possible to compute.
> Here is code in FEX  that can accomplish that, but again, try to look at the feasibility before solving:
> Bruno

Hi, Bruno,

Thank you for the help. Your subfunction v=allVL1eq(n, L1, head) works fine for my problem. But I have some difficulty in understanding the recursive algorithm.  I know it does the job, and more or less how it works, but still feel confused about it.  What is the basic idea of this recursive algorithm? would you like to explain a litle bit for me...  Lots of thanks