French flag Arrows English flag
Sun Arrows Moon
Current
Arrows
Other
Return Index

The Bézout's theorem and its corollary

The Bézout's theorem

Bézout's theorem tells us that:

é

Corollary of the Bézout's theorem

Bézout's theorem corollary tells us that::

é



As well, for a simple product:


And it is possible to generalize it for any product of integers:


Demonstration

The Bézout's theorem

Let be two integers.


  1. From left to right implication

  2. Let us assume that and are coprime.

    In other words,

    We know from the Bézout's identity that:

    Since we have assumed that , as a result we get:


  3. Reciprocal

  4. Conversely, let now assume that:

    Let consider , a common divisor of and .

    We know from the properties of divisibility that:

    being a common divisor of and , it divides , as well as all the linear combinations of and .

    Well, , so .

    The only number which divides is itself, then .

    It is the only common divisor of and , so .

    Thus,


  5. Equivalence

  6. And as a result of both implications,

    é

Corollary of the Bézout's theorem

Let be three integers.


  1. From left to right implication

  2. If , then with the Bézout's theorem, we do have this:

    As a result we do notice that:

    And finally,

  3. Reciprocal

  4. If we do have this:

    Then, still with the Bézout's theorem,

    Performing the product , we do have this:

    Thus,


  5. Equivalence

  6. And as a result of both implications, we do obtain the following equivalence:

    é


  7. Product of two numbers

    1. From left to right implication
    2. If we now take the hypothesis where , then again with the Bézout's theorem, we do have:

      Now, we can apply the theorem four times from this equivalence and:

      As a result we obtain,


    3. Reciprocal
    4. If we retrieve the previous ipplication and we try to verify its reciprocal, we do startfrom this hypothesis:

      By applying the Bézout's theorem, we do have this:

      Indeed, by performing the product of these four expressions, we do obtain:

      Now, when distributing all this, we do obtain a kind of tree, when each term will contain either , nor :

      such as, after having gathered all these terms according to or :


    5. Equivalence
    6. And as a result of both implications, we do obtain the following equivalence:


  8. Generalization for any product

  9. By applying the previous reasoning, but for any product of integers, we can generalize this corollary by claiming that:

Scroll top Go to the top of the page