let-n-be-a-fixed-positive-integer-How-many-ways-are-there-to-write-n-as-a-sum-of-positive-integers-n-a-1-a-2-a-k-with-k-arbitary-positive-integer-and-a-1-a-2-a-k-a-1-1-for-example-wi

Question Number 26513 by gunawan last updated on 26/Dec/17

let n be a fixed positive integer . How many ways are there to write n as a sum of

positive integers,

n = a_{1} + a_{2} + \dots + a_{k}

with k arbitary positive integer and a_{1} ⩽ a_{2} \dots ⩽ a_{k} ⩽ a_{1} + 1 . for example

with n = 4, there are four ways : 4, 2 + 2, 1 + 1 + 2, 1 + 1 + 1 + 1

Commented by mrW1 last updated on 26/Dec/17

Partitions of interger n see: https://www.whitman.edu/mathematics/cgt_online/book/section03.03.html

Commented by gunawan last updated on 26/Dec/17

thank you very much

Facebook Tweet Pin