> I think Tom just meant the above as a hint to answer the question
> "where would we begin looking to see if this algorithm is known already?"
> Sloane's tables of integer sequences:
> http://www.research.att.com/~njas/sequences/
> contain a _lot_ of references to the literature and research.
On Jan 24, 2008 3:32 PM, Brian Granger <[EMAIL PROTECTED]> wrote:
>
> > > Question: where would we begin looking to see if this algorithm is
> > > known already?
> >
> >
> > Let a(m,n) be the number of multiplicative partitions of integers into m
> > parts.
> >
> > For m fixed, compute a(m,n) fo
> > Question: where would we begin looking to see if this algorithm is
> > known already?
>
>
> Let a(m,n) be the number of multiplicative partitions of integers into m
> parts.
>
> For m fixed, compute a(m,n) for n = 3,4,5... and search for this sequence in
> Sloane's encyclopedia.
>
> And, le
On Thu, 24 Jan 2008, Brian Granger wrote:
>
> Hi,
>
> This is a follow on to yesterdays thread about computing
> multiplicative partitions of integers...
>
> Question: where would we begin looking to see if this algorithm is
> known already?
Let a(m,n) be the number of multiplicative partit
