Because it does not specify that she has to choose one or two from each category all pieces of jewelry can be treated as choices in a combination set.
the formula for a combination is
where n is a total number of choices ( 11 )
and r is number chosen out of those choices (4)
so
C(11,4)= \frac{11!}{4!(11-4)!}
She has 330 possible choices to come home with 4 pieces of jewelry
Prove:
Using mathemetical induction:
P(n) = 
for n=1
P(n) = 
= 6
It is divisible by 2 and 3
Now, for n=k, 
P(k) = 
Assuming P(k) is divisible by 2 and 3:
Now, for n=k+1:
P(k+1) = 
P(k+1) = 
P(k+1) = 
Since, we assumed that P(k) is divisible by 2 and 3, therefore, P(k+1) is also
divisible by 2 and 3.
Hence, by mathematical induction, P(n) = is divisible by 2 and 3 for all positive integer n.
Answer:
0.750714286
Step-by-step explanation:
Try this solution (analytic method):
1. if new line is parallel to the given one (y=3x+2) it means the new line has a form y=3x+b, where b - number.
2. In order to calculate 'b', it need to substitute the coordinates of point (6;1) into the equation of the new line:
1=3*6+b, ⇒ b=-17.
3. If to make up the equation of the new line:
y=3x-17
Answer: A
Answer: I'm not 100% sure what your asking but I believe the answer is 12321.
Step-by-step explanation:
