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

division algorithm quotient size #2

Open
make-github-pseudonymous-again opened this issue Nov 13, 2015 · 1 comment
Open

division algorithm quotient size #2

make-github-pseudonymous-again opened this issue Nov 13, 2015 · 1 comment
Assignees
@make-github-pseudonymous-again
Labels
enhancement

Comments

@make-github-pseudonymous-again
Copy link
Member

Find an elegant way to allow truncated quotients (i.e. |C| < |A|), currently all algorithms require that |A| = |C| where A is the dividend/remainder and C is the quotient. This would allow to avoid a lot of memory allocation and back and fort copying.
@make-github-pseudonymous-again
Copy link
Member Author

One can efficiently compute a / b mod c when gcd(b,c) = 1 by simply computing u such that bu = 1 mod c and then computing au mod c.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@make-github-pseudonymous-again make-github-pseudonymous-again

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@make-github-pseudonymous-again