The answer would be 0 solutions.
Here, we see <em>|</em><em />x+6<em>|</em><em /> = 2.
Oh wow! A foreign object!
|x+6|... two lines... what is that?
That is called absolute value. Whatever is inside the two lines, must have a positive answer!
Let's pretend we have a machine that has this absolute value function activated.
What we put in, we must get a positive answer out.
Let's put in -6.
-6 ==> BEEP BEEP ==> 6
Let's try 3.
3 ==> BEEP BEEP ==>3
Whatever we put in, if it is negative or positive, what comes out is always positive.
So, for how many values <em>x</em> is |x+6|=-2 true?
None, because the answer <em>must</em><em /> be positive!
-2 is not positive, <em>2</em><em /> is.
I would answer but i can not see what it says.... Sorry
A bag contains 10 tiles with the letters A, B, C, D, E, F, G, H, I, and J. Five tiles are chosen, one at a time, and placed in a
lora16 [44]
I assume in this item, we are to find at which step is the mistake done for the calculation of the unknown probability.
For the possible number of arrangement of letter, n(S), the basic principles of counting should be used.
= 10 x 9 x 8 x 7 x 6 = 30,240
This is similar as to what was done in Meghan's work.
For the five tiles to spell out FACED, there is only one (1) possibility.
Therefore, the probability should be equal to 1/30,240 instead of the 1/252 which was presented in the steps above.
That would be : 6fg^3 + 5f^2g^2 + f^3g - 7....because there are no like terms
