-
Notifications
You must be signed in to change notification settings - Fork 245
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
Minor doc fixes (one requires verification) #2051
Conversation
Related (remarks/questions also directed to @albinahlback since you were the one touching this part of flint recently): does (Let me know if I should rather open an issue for this.) |
Yes, that is correct. Thanks for spotting this! |
Yes, so I believe the algorithm is Granlund-Möller's division algorithm. As such, it assumes a normalized divisor. To make it work in a more general case, simply shift both numerator and denominator so that divisor is normalized. And yes, it looks like I screwed up the docstrings when I touched them. |
As you say, we should say something about normalization in |
Ah, right, thanks. I have added a word about the normalization requirement in the doc (similar to that for |
When you are happy, please merge! |
Alright, and thanks for your help! (Related small changes coming, concerning |
I opened #2052 , feel free to add other things you had in mind regarding this point. |
These are minor doc fixes.
One of these fixes needs verification (@albinahlback ?). The current doc says that for udiv_qrnnd, the input should satisfy
d < n_1
, but after seeing several use cases of this function, including its test file, it seems that this is a typo: should it rather ben_1 < d
? I have not checked this carefully, but conjectured the answer is yes and modified the doc in this direction.