Generating list of(?) for given number

Asked Apr 25 '22 at 16:44

Active Apr 25 '22 at 17:02

Viewed 42 times

I don't know how to call it: I want to generate lists for given number. Examples for three numbers:

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

Looks simple, but somehow my brain stuck with doing these in recursion or list/array.

edited Apr 25 '22 at 17:02

asked Apr 25 '22 at 16:44

WalterSobczak

4

You need to get all integers that sumed together give the asked number, right? – Floh Apr 25 '22 at 16:46
2

is order important for the output? – osbm Apr 25 '22 at 16:47
2

But what are the rules? In the example with `5` can you have `[2, 3]`? – quamrana Apr 25 '22 at 16:47
2

You are looking to get the partition of a given number. (https://en.wikipedia.org/wiki/Partition_(number_theory)) – yannvm Apr 25 '22 at 16:54
Yes, partitions. I knewed this and forgot. – WalterSobczak Apr 25 '22 at 16:59
Yes, for 5, also [2,3]. Missed it. – WalterSobczak Apr 25 '22 at 17:01

0 Answers0