Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Find smallest number under given conditions by CRT #161

Open
mayank-kumarr opened this issue Dec 17, 2019 · 1 comment
Open

Find smallest number under given conditions by CRT #161

mayank-kumarr opened this issue Dec 17, 2019 · 1 comment
Assignees
@mayank-kumarr
Labels
easy

Comments

@mayank-kumarr
Copy link
Contributor

mayank-kumarr commented Dec 17, 2019 •
edited
Loading

Making use of modular multiplicative inverse to find the smallest number by Chinese Remainder Theorem, for which sets of some numbers and their remainders are given. Add the code in C++ and JAVA.
@mayank-kumarr
Copy link
Contributor Author

I would like to address this issue.

@mayank-kumarr mayank-kumarr mentioned this issue Dec 19, 2019
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@mayank-kumarr mayank-kumarr

Labels
easy
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@rishabhgarg25699 @mayank-kumarr