You can edit almost every page by Creating an account and confirming your email.

Bézout method

From EverybodyWiki Bios & Wiki

The Bézout Method is a general method of solving algebraic equations. It was initiated and developed by Étienne Bézout in 1762.

This method tries to reduce the equation that we want to solve to other equations of lower degree. This tedious method certainly fails for equations of degree greater than or equal to five that have an unresolved Galois group. It has a concrete interest only for equations of degree 3.

Principle of the method

Consider an equation of degree n :

anxn+an1xn1++a1x+a0=0

Let r be an n -th primitive root of unity.

We know that the n roots n -ths of unity 1, r , r 2 , ..., r n − 1 verify the relation:

1+r+r2++rn1=0

Bézout's method is looking for the roots of the studied equation in the form of linear combinations of the roots n-ths of the unit.

x=b0+b1r+b2r2++bn1rn1

For this, we start by eliminating r between the two relations:

1+r+r2++rn1=0
x=b0+b1r+b2r2++bn1rn1

This gives us an equation of degree n in x whose coefficients are expressions depending on b0, b1, b2,...,bn−1. By identifying the coefficients of this equation with the corresponding coefficients of the equation to be solved, we obtain a system of equations of unknowns b0, b1, b2,...,bn−1 which after solving and reporting the different solutions in:

x=b0+b1r+b2r2++bn1rn1

will give us the solutions of the equation that we had set ourselves to solve.

Application to the resolution of cubic equations

We will expose the method on the following example:

6x36x2+12x+7=0

Let

j=e2iπ3

j is one of the cube roots of the unit and therefore satisfies:

j3=1

We will search for the roots in the form:

x=a+bj+cj2

We will eliminate j between the last two equations.

The last two equations are in the form:

{j3=1xabj=cj2

By making successive member-to-member products and each time replacing those of the two equations whose degree with respect to j is the highest by the result, we will gradually lower the degree of the equations with respect to j until j disappears from one of the equations.

A first member-to-member product gives us:

{bj2=jxajcxabj=cj2

A second member-to-member product gives us:

{cjxacj+b2j=bx+c2abxabj=cj2

A third member-to-member product gives us:

{cjxacj+b2j=bx+c2abab2a2cb2x+2acxcx2=2abcjb3jc3j2bcjx

A last member-to-member product eliminates j and gives us the equation:

x33ax2+(3a23bc)x+3abca3b3c3=0

By identifying the coefficients of this equation with the coefficients of the equation we need to solve, we obtain:

{3a=13a23bc=23abca3b3c3=76

From the first equation we deduce from this the value of a that we report in the other equations, we obtain:

{a=13bc=59bcb3c3=6554

Let's memorize the value of a and bring the product bc in the third equation, we get:

{bc=59b3+c3=9554

By cubing the two members of the first equation, we obtain:

{b3c3=125729b3+c3=9554

b 3 and c 3 are therefore the roots of the equation:

X2+9554X125729=0

The two roots of this equation are:

b3=554,c3=5027

The three pairs ( b , c ) checking:

bc=59

thereby are :

b1=13523andc1=13503;
b2=j3523andc2=j23503;

b3=j23523andc3=j3503.

By reporting in x=a+bj+cj2 the values ​​of a,b,c found, we get

x1=13+13523j13503j2,
x2=13+j3523jj23503j2
x3=13+j23523jj3503j2,

which, after simplification, gives

x1=13(1+j523j2503),
x2=13(1+j2523j503)
x3=13(1+523503),

which are the three roots of the equation that we had to solve.

External link


This article "Bézout method" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Bézout method. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.