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:
Let
Let us assume that
In other words,
Since we have assumed that
Conversely, let now assume that:
Let consider
Well,
The only number which divides
It is the only common divisor of
Thus,
And as a result of both implications,
Let
If
As a result we do notice that:
And finally,
If we do have this:
Then, still with the Bézout's theorem,
Performing the product
Thus,
And as a result of both implications, we do obtain the following equivalence:
If we now take the hypothesis where
Now, we can apply the theorem four times from this equivalence and:
As a result we obtain,
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
such as, after having gathered all these terms according to
And as a result of both implications, we do obtain the following equivalence:
By applying the previous reasoning, but for any product of integers, we can generalize this corollary by claiming that: