(a) there are 8C2 = 28 ways of picking 2 girls from 8
And there are 21C4 = 5985 ways of picking 4 boys
Required number of ways for 2g / 4b = 28 * 5985 = 167,580
(b) at least 2 girls means combinations of 2g/4b , 3g,3b , 4g/2b , 5g 1b or
6 girls.
2g/4b = 167,580 ways
3g/3b = 8C3 * 21C3 = 56 * 1330 = 74,480
4g/2b = 8C4* 21C2 = 70 * 210 = 14,700
5g 1b = 8C5* 21 = 56*21 = 1176
6 girls = 8C6 = 28
adding these up we get the answer to (b) which is 257,964
1. You would do 45 × 3 = 135 miles
2. 630 ÷ 2 = 315. 630 + 315 = 945 miles
3. 54 × 11 = 594 miles
1. Time is distance ÷ speed, so 4760 ÷ 560 = 8 1/2hours
2. 27 ÷ 54 = 0.5 hours, or 30 minutes
3. 1748 ÷ 437 = 4 hours
I hope this helps!
The true statement about why the Fibonacci sequence is recursively defined is (c) The Fibonacci sequence is recursively-defined because you must know the values of the two previous terms in order to find the value of the next term
<h3>How to determine the true statement</h3>
With an exception to the first two terms, each term of the Fibonacci sequence is the sum of the two previous terms
This means that,
The Fibonacci sequence cannot be defined explicitly, because the two previous terms can not be determined by a direct formula
Hence, the true statement about why the Fibonacci sequence is recursively defined is (c)
Read more about the Fibonacci sequence at:
brainly.com/question/16934596
Answer:
I’m pretty sure it’s 6 but I’m not 100% sure
Step-by-step explanation:
Answer:
g(n) = 
Step-by-step explanation:
Given
3m - 5n = 11
Rearrange making m the subject
Add 5n to both sides
3m = 11 + 5n ( divide both sides by 3 )
m = , thus
m = g(n) =
