2
$\begingroup$

More precisely, if anyone has found it, could they provide links, please? I have been trying to find such a solution and have not seen one.

For context, when I try to solve the strict partition function for n = 10 billion, but only for triplets, my understanding is that the brute-force method would have me find all the distinct sets of triplets that sum to 10 billion. This becomes ever increasingly expensive as n gets bigger. This is why I am curious if anyone has a solution. To get the complete strict partition value of n, I would need to also calculate all the pairs, quadruplets, etc, right?Thank you!

$\endgroup$
2
  • 1
    $\begingroup$ Have you searched online for articles about the problem? If you have the answers for several small number cases, oeis.org might help. $\endgroup$
    – aschepler
    Commented Mar 19 at 3:56
  • $\begingroup$ related: math.stackexchange.com/questions/48075/… $\endgroup$
    – IV_
    Commented Mar 19 at 16:35

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .