Advanced Search

Question: partitions of n into parts >=2

Question:partitions of n into parts >=2

jasser 80 Maple
integer partition
April 03 2025
2

Hello

I am looking for an efficient code that calculates all partitions of a positive integer n into parts >1. Example:

for n=8 the program should return

[2,6],[3,5],[4,4],[2,2,4],[2,3,3],[[2,2,2,2].

The program should be able to calculate these partitions for n=1..10000 in reasonable time

Who can help me?

Thanks.
Please Wait...