Prove Part (3) of Theorem 3.28 from Section 3.4. Let n є N and let a and b be integers. For each m є N, if a b (mod n), then a^m-b^m (mod n).

it would more likely be bald eagle because its has more in the box so about 75%.

step-by-step explanation:

5050

hope this !

more detail

step-by-step explanation:

answer:

given the linear inequality :

add 2y to both sides we get;

simplify:

add 12 to both sides of an equation;

simplify:

divide both sides by 2 we get;

or

the related equation for the inequality equation [1] is;

y-intercepts defined as the graph crosses the y-axis.

substitute x =0 in [2] to solve for y;

y = 6

x-intercepts defined as the graph crosses the x-axis.

substitute value y = 0 to solve for x;

subtract 6 from both sides we get

multiply both sides by 2 we get;

or

x = -12

now, plot these point (0, 6) and (-12, 0) on graph as shown below and shade the graph below the solid line.