Menu Close

in-how-many-ways-can-the-number-n-be-written-as-a-sum-of-three-positive-integers-if-representations-differing-in-the-order-of-the-terms-are-considered-to-be-different-




Question Number 153220 by talminator2856791 last updated on 05/Sep/21
    in how many ways can the number     n be written as a sum of three positive     integers if representations differing     in the order of the terms are considered     to be different?
inhowmanywayscanthenumbernbewrittenasasumofthreepositiveintegersifrepresentationsdifferingintheorderofthetermsareconsideredtobedifferent?
Answered by mr W last updated on 05/Sep/21
a+b+c=n  a≥1,b≥1,c≥1  (x+x^2 +x^3 +...)^3 =(x^3 /((1−x)^3 ))=Σ_(k=0) ^∞ C_2 ^(k+2) x^(k+3)   k+3=n ⇒k+1=n−1  coef. of x^n  is C_2 ^(n−1) , that means there  are C_2 ^(n−1)  ways.  example n=5:  C_2 ^4 =6 ways  5=1+1+4=1+4+1=1+2+2=2+1+2  =2+2+1=4+1+1
a+b+c=na1,b1,c1(x+x2+x3+)3=x3(1x)3=k=0C2k+2xk+3k+3=nk+1=n1coef.ofxnisC2n1,thatmeansthereareC2n1ways.examplen=5:C24=6ways5=1+1+4=1+4+1=1+2+2=2+1+2=2+2+1=4+1+1
Commented by Tawa11 last updated on 06/Sep/21
great sir.
greatsir.
Commented by mr W last updated on 06/Sep/21
can you confirm this answer with an  other method you know?
canyouconfirmthisanswerwithanothermethodyouknow?

Leave a Reply

Your email address will not be published. Required fields are marked *