Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Recursion Problem
Replies: 11   Last Post: Nov 22, 2011 9:44 PM

 Messages: [ Previous | Next ]
 MTBrenneman@gmail.com Posts: 983 Registered: 8/21/06
Re: Recursion Problem
Posted: Nov 17, 2011 11:27 AM

On Nov 17, 4:13 am, William Elliot <ma...@rdrop.com> wrote:
> On Wed, 16 Nov 2011, junoexpress wrote:

> > The question is this:
> > "If I know the influxes for each year and start out with no deficit
> > what is the maximum fixed amount of M&Ms (i.e. the maximum value for
> > B) I can take out so at the end of n years, I will have no deficit?"

>
> min{ a1, a2,.. a_n }
>

> > Not an easy problem, and I don't think it probably has a "nice"
> > solution, but just thought I would see if anyone had a better thought.

>
> It's made messy by the results depending not only
> on the values of the a's but also on their order.

Your mention of the minimum of the inputs got to me thinking about
what the solution must be like.
One complicating aspect of this problem is that significant portions
of the data may be unimportant (as in the toy problem). Some key
facts, I believe however are that:
1) B is a solution when it causes us to break even the last year
2) The window of data points relevant to our analysis must go from the
minimum of the {A_i} to the last data point.

Date Subject Author
11/17/11 MTBrenneman@gmail.com
11/17/11 MTBrenneman@gmail.com
11/17/11 MTBrenneman@gmail.com
11/17/11 William Elliot
11/17/11 MTBrenneman@gmail.com
11/22/11 Tim Little
11/17/11 MTBrenneman@gmail.com
11/17/11 Dan Heyman
11/17/11 MTBrenneman@gmail.com
11/18/11 Dan Heyman
11/18/11 MTBrenneman@gmail.com
11/22/11 Tim Little