Answer:1) c. 5,9,13,17,21
2) a. a1=8, an=an-1 -2
Step-by-step explanation: 1) an=4n+1
⇒ a1=4×1+1=5
a2=4×2+1=9
a3=4×3+1=13
a4=4×4+1=17
a5=4×5+1=21
2) clearly a1=8 and then the terms of series are decreasing by 2
so, an=an-1 -2
Answer:
- 2006 = 9 million users ( 3×3') = 3²
Step-by-step explanation:
Answer:
0.3431
Step-by-step explanation:
Here, it can work well to consider the seeds from the group of 18 that are NOT selected to be part of the group of 15 that are planted.
There are 18C3 = 816 ways to choose 3 seeds from 18 NOT to plant.
We are interested in the number of ways exactly one of the 10 parsley seeds can be chosen NOT to plant. For each of the 10C1 = 10 ways we can ignore exactly 1 parsley seed, there are also 8C2 = 28 ways to ignore two non-parsley seeds from the 8 that are non-parsley seeds.
That is, there are 10×28 = 280 ways to choose to ignore 1 parsley seed and 2 non-parsley seeds.
So, the probability of interest is 280/816 ≈ 0.3431.
___
The notation nCk is used to represent the expression n!/(k!(n-k)!), the number of ways k objects can be chosen from a group of n. It can be pronounced "n choose k".
The sum of 3/5 and 1/10 is 7/10.
Let x represent the side length of the square end, and let d represent the dimension that is the sum of length and girth. Then the volume V is given by
V = x²(d -4x)
Volume will be maximized when the derivative of V is zero.
dV/dx = 0 = -12x² +2dx
0 = -2x(6x -d)
This has solutions
x = 0, x = d/6
a) The largest possible volume is
(d/6)²(d -4d/6) = 2(d/6)³
= 2(108 in/6)³ = 11,664 in³
b) The dimensions of the package with largest volume are
d/6 = 18 inches square by
d -4d/6 = d/3 = 36 inches long