In how many ways can we write 20 as a sum of 3 non-negative integer?
Answers
Answer:
Step-by-step explanation:
This is a question on permutation.
With permutation the order of the arrangements is necessary.
The formula for permutation is as follows :
Given n objects from which you need to choose r objects at a time the formula for the permutation is as follows :
p =
From the question above we have :
n = 20
r = 3
We need to get the numbers that when picked three at a time can sum up to 20.
We do the substitution as follows :
P = 20!/(20-3)!
This equals to :
20!/17! = 6840
The answer is 6840 ways.
Answer:
Step-by-step explanation:
Let x, y, and z be 3 non negative integer.
To find: No ways such that 20 = x + y + z
we find this using combination of numbers for total of n+r-1 items out of which n would be same (of 1 type) and the other r - 1 would be same as well (of another type)
i.e.,we use,
here n = 20 & r = 3
So, the no. of ways is given by
Therefore, No. of ways in which 20 can be writtenas sum of 3 non negative interger is 231.