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.

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

bpo-37295: More direct computation of power-of-two factor in math.comb #30313

Merged
merged 5 commits into from
Dec 31, 2021

Conversation

mdickinson
Copy link
Member

@mdickinson mdickinson commented Dec 31, 2021

This PR replaces the current popcount-based code for computing the largest power of two dividing math.comb(n, k) (for small n) with a more direct method based on counting trailing zeros of the factorials involved. See the issue for further discussion.

https://bugs.python.org/issue37295

Copy link
Member

@serhiy-storchaka serhiy-storchaka left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Can it be used in count_set_bits()?

@mdickinson
Copy link
Member Author

Can it be used in count_set_bits()?

I'm not sure how. Can you elaborate?

We could use a lookup table for small values in the popcount implementation, but I'm not sure it's worth changing.

@serhiy-storchaka
Copy link
Member

We could use the same lookup table in the popcount implementation for factorial() and comb()/perm(). But it may be a separate issue.

For #30305 I will need to extend the table to 127.

Copy link
Member

@serhiy-storchaka serhiy-storchaka left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM besides few comments.

mdickinson and others added 3 commits December 31, 2021 19:23
@mdickinson mdickinson merged commit 0b58bac into python:main Dec 31, 2021
@mdickinson mdickinson deleted the math-comb-zero-counts branch December 31, 2021 19:52
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants