Answer:
2n+2 ways to win
Step-by-step explanation:
You generalize by observing patterns in the way you solve the smaller problems.
The number of winning moves is 2n+2: the total of the number of diagonals, columns, and rows.
For an n×n board, there are 2 full-length diagonals, n columns, and n rows, hence 2+n+n = 2n+2 ways to win.
What is the question?
x= -1/2 = -0.500
x=4
2x^2-7x-4=0
2x^2-8x+1x-4=0
2x(x-4)+1(x-4)=0
(2x+1)(x-4)=0
2x+1=0...2x= -1.. x= -1/2 x-4=0 .. x=4
checking the solution
2(-1/2)^2-7(-1/2)=4..... 4=4
2(4)^2-7(4)=4....... 4=4
Answer:Can somebody please help
