linear-diophantine: add Bézout's lemma and slightly reformat mathjax #1358
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Visit the preview URL for this PR (for commit 5617b11): https://cp-algorithms--preview-1358-3yqwsj7x.web.app (expires 2024-10-21T01:39:23.711509923Z) |
adamant-pwn
reviewed
Oct 14, 2024
|
@adamant-pwn I also added a little bit of explanation for the all solutions part. |
|
Preview the changes for PR #1358 (b1ba599) here: https://cp-algorithms.github.io/cp-algorithms/1358/ |
|
Thanks! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
I'm not sure if the lemma is extraneous, but it gives an overarching way of understanding linear combinations of integers. The existence of modular inverses mod p can also be proved.