%0 Journal Article
%T Solving Some Problems and Elimination in Systems of Polynomial Equations
%A Moumouni Djassibo Woba
%J American Journal of Computational Mathematics
%P 333-345
%@ 2161-1211
%D 2024
%I Scientific Research Publishing
%R 10.4236/ajcm.2024.143016
%X In a factorial ring, we can define the <i>p.g.c.d</i><i>.</i> of two elements (defined to the nearest unit) and the notion of prime elements between them. More generally, Bezout&#8217;s identity characterizes two prime elements in a main ring. A ring that satisfies the property of the theorem is called a Bezout ring. We have given some geometry theorems that can be proved algebraically, although the methods of geometry and, in particular, of projective geometry are by far the most beautiful. Most geometric problems actually involve polynomial equations and can be translated into the language of polynomial ideals. We have given a few examples of a different nature without pretending to make a general theory.
%K Identity of Bezout
%K Ring of Bezout
%K Ideals
%K Polynomials
%K Common
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=136113