answer these questions 15 18 22 19 (15 is in previous question i posted) rest are here plz answer fast it's urgent
Answers
Answer:
18) k = 8 / 3
19) (i) 5 / 12 (ii) 1 / 2
22) see below
Hello. Hope this helps!!!
Step-by-step explanation:
18) We need to know the factorization:
- x^n - a^n = ( x - a ) ( x^{n-1} + x^{n-2} a + x^{n-3} a² + ... + a^{n-1} )
In the special cases here, this means we'll use:
- x⁴ - 1 = ( x - 1 ) ( x³ + x² + x + 1 )
- x³ - k³ = ( x - k ) ( x² + xk + k² )
- x² - k² = ( x - k ) ( x + k )
First
Next
So for these two limits to be equal, we must have
3k / 2 = 4 => k = 8 / 3
---------------------------------------------------
19) # ways of choosing 5 bulbs from 10
( I prefer to keep it in small factors rather than put "252" since this is just going to be a denominator in our probabilities and I expect (hope?) there'll be some cancellation.)
(i) # ways of choosing 5 bulbs with 2 of them being bad
= ( # ways of choosing 2 bad bulbs from 3 ) × ( # ways of choosing 3 good bulbs from 7 )
So
P( getting exactly 2 bad bulbs )
= ( # ways of choosing 5 bulbs with 2 of them being bad ) / ( # ways of choosing 5 bulbs )
= ( 3 × 5 × 7 ) / ( 2² × 3² × 7 )
= 5 / 12
(ii) As before:
# ways of choosing 5 bulbs with no bad ones
= # ways of choosing 5 good bulbs from 7
# ways of choosing 5 bulbs with 1 bad bulb
= ( # ways of choosing 1 bad bulbs from 3 ) × ( # ways of choosing 4 good bulbs from 7 )
So
# ways of choosing at most 1 bad bulb
= ( # ways of choosing 0 bad bulbs ) + ( # ways of choosing 1 bad bulb )
= 21 + 5 × 21 = 6 × 21
Finally
P( getting at most 1 bad bulb )
= ( # ways of choosing at most 1 bad bulb ) / ( # ways of choosing 5 bulbs )
= ( 6 × 21 ) / ( 2² × 3² × 7 )
= 1 / 2
---------------------------------------------------------
22) Not sure what is being expected from you here. It depends what you've been learning.
Perhaps you're expected to use the binomial expansion:
and the recurrence relation for binomial coefficients:
( this is the property that you use to write down Pascal's Triangle ).
The middle term of ( 1 + x )^{2n} is then
while the two middle terms of ( 1 + x )^{2n-1} are and .
Substituting "n" for "k" in the recurrence relation, and "2n" for "n", the recurrence relation tells us that
The terms in this sum though are precisely the coefficients of the terms that we identified above in the expansions of ( 1 + x )^{2n} and ( 1 + x )^{2n-1}.
So the coefficient of the middle term of ( 1 + x )^{2n} is the sum of the coefficients of the two middle terms of ( 1 + x )^{2n-1}.
----------
If you're actually expected to do it more directly, then perhaps this is more what you want.
Let the middle coefficient of ( 1 + x )^{2n} be A and the middle two coefficients of ( 1 + x )^{2n-1} be B and C.
So
( 1 + x )^{2n} = 1 + ..... + A x^n + ..... + x^{2n} (**)
and
( 1 + x )^{2n-1} = 1 + ..... + B x^{n-1} + C x^n + .... + x^{2n-1}
Multiplying the second of these by 1+x give
( 1 + x )^{2n} = ( 1 + x ) ( 1 + .... + B x^{n-1} + C x^n + .... + x^{2n-1} )
= 1 + ... + B x^{n-1} + C x^n + .... + x^{2n-1}
+ x + .... + B x^n + C x^{n+1} + .... + x^{2n}
= 1 + ..... + ( B + C ) x^n + .... + x^{2n}
Comparing this with (**), we conclude that A = B + C.
That is, the coefficient of the middle term of ( 1 + x )^{2n} is the sum of the coefficients of the two middle terms of ( 1 + x )^{2n-1}.
Here, when we put x = 1 into (x^4 - 1)/(x-1) we get 0/0.... nonsense. So we use the factorisation of x^4 - 1, then cancel the x-1 factors. This leaves us with x^3+x^2+x+1. Now when we put x = 1, it's works out fine... 1+1+1+1=4.
Does this clarify things?