> > 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, let b(n) = sum([a(m,n) for m = [1..n]]); also search for this sequence. > Often, even relatively recent research is known to Sloane's tables.
Isn't this (the question of how many such partitions exist) really a separate question from how you actually calculate exactly what those partitions are? In our case, knowing how many exist is not enough, we actually need all of them. Am I missing something? Brian > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
