Nine tokens are black on one side and white on the other. Initially, four tokens have the black side up. In each turn you have to flip three tokens. What is the least number of turns you need to have all tokens showing the same color?

2 movements

Step-by-step explanation:

In this case what we will do is name the white chips "W" and the black ones "B". If there are 9 tiles and 4 are in black then the rest, that is 5, in white, like this:

B-B-B-B-W-W-W-W-W

First movement, in turn we can flip 3 tiles, in this case we flip two blacks and one white, it would look like this:

W-W-B-B-B-W-W-W-W

The second movement is to turn the 3 black ones and thus they would all be blank

W-W-W-W-W-W-W-W-W

In other words, the smallest number of movements is 2.

answer: -0.5 would be the most likley outcome

step-by-step explanation:

region b will make the inequalities y < 2x + 1 and y > -x - 2 true ⇒ answer a

step-by-step explanation:

* lets study the graph and the inequality to solve the question

- the inequality y > -x - 2

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = -2 that means the line intersect the y-axis at point (0 , -2)

∵ the sign of the inequality is >

∴ we shad the part over the line

  region a and b

- the inequality y < 2x + 1

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = 1 that means the line intersect the y-axis at point (0 , 1)

∵ the sign of the inequality is <

∴ we shad the part under the line

  region b and c

∵ the common region between the two lines is region b

∴ region b will make the inequalities y < 2x + 1 and y > -x - 2 true