1. There are infinite black and white dots on a plane. Prove that the distance between one black dot and one white dot is one unit. 2. How can you drop two eggs the fewest amount of times, without them breaking?

If you click on the link you find a picture which has black dots on a white background. This suggests that we color every point on the plane either white or black, making sure to use infinitely many of each color. With these constraints it is indeed the case that there must be a black point and a white point at unit distance. (In fact, "infinite" can be weakened to nonempty.)

Step-by-step explanation:

Hint: starting with a black point, we're done unless the entire unit circle around that point is black. Now repeat that argument for each point on that unit circle: we've already generated a sizable swathe of the plane colored totally black...

the system of inequity is

step-by-step explanation:

from the given graph it is noticed that we have two related lines. one is solid and another is dashed.

if a line passing through two points, then the equation of line is

the solid line passing through the points (0,4) and (4,0).

the related equation of solid line is .

similarly, find the related equation of dashed line. the dashed liune passing through the points (0,0) and (3,1).

the related equation of dashed line is

from the given graph it is noticed that the point (0,1) lies on the shaded region, therefore the point (0,1) must be satisfied by the related equations.

check the related equations by the point (0,1).

this statement is true if the sign of inequality is < instead of equality. since it is an solid line therefore the sign of inequality will be . the required inequality is

similarly, check the second related equation.

it is a dashed line, so this statement is true if the sign of inequality is > . the required inequality is

b. x + 1

step-by-step explanation:

i'am smart