Welcome to EverybodyWiki 😃 ! Nuvola apps kgpg.png Log in or ➕👤 create an account to improve, watchlist or create an article like a 🏭 company page or a 👨👩 bio (yours ?)...

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[edit]

Consider an equation of degree n :


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:


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.


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


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:


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

Application to the resolution of cubic equations[edit]

We will expose the method on the following example:




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


We will search for the roots in the form:


We will eliminate j between the last two equations.

The last two equations are in the form:


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:


A second member-to-member product gives us:


A third member-to-member product gives us:


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


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


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


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


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


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


The two roots of this equation are:


The three pairs ( b , c ) checking:


thereby are :



By reporting in '"`UNIQ--postMath-0000001A-QINU`"' the values ​​of '"`UNIQ--postMath-0000001B-QINU`"' found, we get


which, after simplification, gives


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

External link[edit]

Some use of "" in your query was not closed by a matching "".Some use of "" in your query was not closed by a matching "".

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.