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 with n=4, there are four ways : 4, 2+2, 1+1+2,1+1+1+1


Question and Answers Forum

All Questions Topic List
Others Questions
Previous in All Question Next in All Question
Previous in Others Next in Others
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} + . . . + a_{k}$ $with k arbitary positive integer and a_{1} ⩽ a_{2} . . . ⩽ 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$
Terms of Service
Privacy Policy
Contact: info@tinkutara.com

Question and Answers Forum