For this example, we must combine not permutate; this because a salad in which you first use apple then tomato is the same as the one in which you use first tomato then apple, so order does not matter.
Me must do "10 combine 7" which is written by the binomial coefficient

; in general a binomial coefficient is written by:

In which

and

are positive integers, such that

.
So, for this problem:
Hence, there are 120 different ways to make the fruit salad.
Answer:
40951
Step-by-step explanation:
Using the principles of inclusion - Exclusion
Where C(n,r)=n!/(n-r)!r!
Total elements in the five sets including number repetition is given as (10000)×C(5, 1) =10000× 5!/(5-1)!1!=10000×5=50000
Total Number of elements in each pair including number repetition of sets is given as
=(1000) × C(5, 2) =10000
Number of elements in each triple of sets is given as
=(100) × C(5, 3) =1000
Number of elements in every four sets
=(10) × C(5, 4)=50
Number of elements in every one set
(1) × C(5, 5)=1
Therefore total number of unique elements=50000-10000+1000-50+1
=40951
Answer:
Sebastian cold have 10 dimes and 11 quarters.
Step-by-step explanation:
11 quarters = $2.75
10 dimes = $1.00
Answer:
y = -
x-
Step-by-step explanation: