Comme un jeu

\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)

Courses About

According to Bézout's Theorem, \(\gcd(a, b) = 1\) if and only if:

There exist integers \(u\) and \(v\) such that \(au + bv = 1\).
\(a\) and \(b\) are both prime numbers.
\(a\) and \(b\) have the same parity.