Help ASAP please!! For a proof by induction of the math statement below,
identify the correct step for proving the theorem is true
for n=k+1

2+4+6+...+2n=n(n+1)

2+4+6+...+2k+2(k+1) = k(k+1) + (k+1)(k+1)

Step-by-step explanation:

Proved case for n

2+4+6+...+2n = n(n+1) (1)

for n = k + 1, we replace n by k and add n = k+1 on both sides (

2+4+6+...+2k+2(k+1) = k(k+1) + 2(k+1))

rearrange by factoring the right-hand-side

2+4+6+...+2k+2(k+1) = (k+1)(k+2)

which if we substitute n=k+1, we get back

2+4+6+...+2(n-1) + 2(n) = n(n+1)  (2)

This means that equation (1) is applicable to case n+1, and the proof by induction is completed.

option 2 is correct.

step-by-step explanation:

we are given two inequality equation

x+y> 5 and -3x+2y< -2

first we draw the graph of both function using t-table method

equation: x+y> 5

for x=0, y=5

for x=-5, y=0

table:

x   :   0     5

y   :   5     0

test point (0,0) , 0> 5

false

equation: -3x+2y< -2

for x=0, y=-1

for x=2, y=4

table:

x   :   0     2

y   : -1       4

test point (0,0) , 0< -2

true

now we draw the graph. see the attachment for graph.

common region would be solution set.

option 2 is correct.

i think the answer is true

step-by-step explanation: