At at least one die come up a 3?We can do this two ways:) The straightforward way is as follows. To get at least one 3, would be consistent with the following three mutually exclusive outcomes:the 1st die is a 3 and the 2nd is not: prob = (1/6)x(5/6)=5/36the 1st die is not a 3 and the 2nd is: prob = (5/6)x((1/6)=5/36both the 1st and 2nd come up 3: prob = (1/6)x(1/6)=1/36sum of the above three cases is prob for at least one 3, p = 11/36ii) A faster way is as follows: prob at least one 3 = 1 - (prob no 3's)The probability to get no 3's is (5/6)x(5/6) = 25/36.So the probability to get at least one 3 is, p = 1 - (25/36) = 11/362) What is the probability that a card drawn at random from an ordinary 52 deck of playing cards is a queen or a heart?There are 4 queens and 13 hearts, so the probability to draw a queen is4/52 and the probability to draw a heart is 13/52. But the probability to draw a queen or a heart is NOT the sum 4/52 + 13/52. This is because drawing a queen and drawing a heart are not mutually exclusive outcomes - the queen of hearts can meet both criteria! The number of cards which meet the criteria of being either a queen or a heart is only 16 - the 4 queens and the 12 remaining hearts which are not a queen. So the probability to draw a queen or a heart is 16/52 = 4/13.3) Five coins are tossed. What is the probability that the number of heads exceeds the number of tails?We can divide
Answer: -5+8 because the difference (-) of -5 and 8 is 8 - (- 5) which can also be expressed as -5+8. All that matters is that 5 stays negative and 8 stays positive.
To factor quadratic equations of the form ax^2+bx+c=y, you must find two values, j and k, which satisfy two conditions.
jk=ac and j+k=b
The you replace the single linear term bx with jx and kx. Finally then you factor the first pair of terms and the second pair of terms. In this problem...
2k^2-5k-18=0
2k^2+4k-9k-18=0
2k(k+2)-9(k+2)=0
(2k-9)(k+2)=0
so k=-2 and 9/2
k=(-2, 4.5)
Adrian can put a total of 1716 combinations in the player.
The formula to be used is as follows:
total combinations = n!/[r! *(n-r)!]
n = number of disks available = 13
r = number of disks that be held = 6
= 13! = (13• 12•11•10•9•8•7•6•5•4•3•2•1)/(6! <span>• 7!)
</span>=1716
Thank you for posting your question. Feel free to ask me more.
It does not matter which he does first. Either way, zero pairs will be created on both sides, which will isolate the variable to determine x<span>. Adding the </span>x<span>-tiles and then the unit tile, or visa versa, will give the same solution.</span>
