We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://oi-wiki.org/math/number-theory/bezouts/
对于通解部分,页面里只给了 a, b 互素的情况,但其实有更加普遍的结论,即:
$$ \begin{cases} x = x_0 + k\frac{b}{d} \\ y = y_0 - k\frac{a}{d} \end{cases} $$
其中 $d = \gcd(a, b)$ 。
参考Bézout's identity。
The text was updated successfully, but these errors were encountered:
这篇文章开头确实没写……所以确实可以选择在合适的位置补上。
Sorry, something went wrong.
No branches or pull requests
请选择:
我正在访问这个页面
https://oi-wiki.org/math/number-theory/bezouts/
我发现页面有这样的问题
对于通解部分,页面里只给了 a, b 互素的情况,但其实有更加普遍的结论,即:
其中$d = \gcd(a, b)$ 。
参考Bézout's identity。
The text was updated successfully, but these errors were encountered: