We will use demonstration of recurrences<span>1) for n=1, 10= 5*1(1+1)=5*2=10, it is just
2) assume that the equation </span>10 + 30 + 60 + ... + 10n = 5n(n + 1) is true, <span>for all positive integers n>=1
</span>3) let's show that the equation<span> is also true for n+1, n>=1
</span><span>10 + 30 + 60 + ... + 10(n+1) = 5(n+1)(n + 2)
</span>let be N=n+1, N is integer because of n+1, so we have
<span>10 + 30 + 60 + ... + 10N = 5N(N+1), it is true according 2)
</span>so the equation<span> is also true for n+1,
</span>finally, 10 + 30 + 60 + ... + 10n = 5n(n + 1) is always true for all positive integers n.
<span>
</span>
Answer:
468 ways
Step-by-step explanation:
Given: A catering service offers 5 appetizers, 4 main courses, and 8 desserts
To find: number of ways a customer is to select 4 appetizers, 2 main courses,and 3 desserts.
Solution:
A permutation is an arrangement of elements such that order of elements matters and repetition is not allowed.
Number of appetizers = 5
Number of main courses = 4
Number of desserts = 8
Number of ways of choosing k terms from n terms = 
Number of ways a customer is to select 4 appetizers, 2 main courses,and 3 desserts = 

So, this can be done in 468 ways.
Answer:
Look below at the image I have provided for you <3
Step-by-step explanation:
I hope this helps!
Answer:
Softballs = (48/b)
Step-by-step explanation:
Given that,
Total number of softballs = 48
She wants to divide them evenly among b softball bags.
We need to find an expression that represents how many softballs she should put into each bag.
As it is dividing among b softball, it means we divide 48 and b. So,

Hence, the required expression is (48/b).