-
-
Notifications
You must be signed in to change notification settings - Fork 211
New issue
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
Added docs for Euclidean Algorithm #1721
Added docs for Euclidean Algorithm #1721
Conversation
Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊 |
⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
update your code based on suggestions
### Example 1: GCD of 56 and 98 | ||
1. $$ 98 \mod 56 = 42 $$ | ||
2. $$ 56 \mod 42 = 14 $$ | ||
3. $$ 42 \mod 14 = 0 $$ | ||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
write in good format because
$
is used for inline and $$
is used for block and content in center so, follow best practices rule.
|
||
$$ a = b \times q + r $$ | ||
|
||
where $$ q $$ is the quotient and $$ r $$ is the remainder. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
replace $$
with $
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I've made the changes as requested. Please check it @ajay-dhangar
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Done
🎉🎉 Thank you for your contribution! Your PR #1721 has been merged! 🎉🎉 |
📥 Pull Request
Description
I've added Euclidean Algorithm in number theory which is famous for finding gcd between two numbers
Fixes #1711
Type of change
Checklist: