What is the third term of the sequence defined by the recursive rule f(1)=3 f(n)=f(n-1)+4
Need f(2):
f(2)=f(2-1)+4
f(2)=f(1)+4
f(2)=(3)+4=7
FIND f(3):
f(3)=f(3-1)+4
f(3)=f(2)+4
f(3)=(7)+4
f(3)=11
Answer:
The total number of different arrangements is 560.
Step-by-step explanation:
A multiset is a collection of objects, just like a set, but can contain an object more than once.
The multiplicity of a particular type of object is the number of times objects of that type appear in a multiset.
Permutations of Multisets Theorem.
The number of ordered n-tuples (or permutations with repetition) on a collection or multiset of
objects, where there are
kinds of objects and object kind 1 occurs with multiplicity
, object kind 2 occurs with multiplicity
, ... , and object kind
occurs with multiplicity
is:

We know that a boy has 3 red, 2 yellow and 3 green marbles. In this case we have n = 8.
If marbles of the same color are indistinguishable, then the total number of different arrangements is

Answer:
g = 4
Step-by-step explanation:
6(−2g−1)=−(13g+2)
Distribute
-12g -6 = -13g -2
Add 13g to each side
-12g + 13g -6 = -13g+13g -2
-6+g =-2
Add 6 to each side
-6+g+6 = -2+6
g = 4