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
Binomial coefficient from previous related coefficient #1015
Comments
Useful in what sense? I don't see any immediate usage over e.g. precomputed factorials? |
Perhaps useful for some math problems, but I don't know any specific uses. |
It might make sense to notice the first formula. But the second formula ist just the same formula as the first one (by replacing i-> i+1). |
Also should "Freshman's Dream" be mentioned for binomial coefficients? https://en.wikipedia.org/wiki/Freshman%27s_dream due to divisibility of |
Are the following useful enough for loops? This is what I did for project euler problems when asked to compute (n choose i) mod large prime over loop index i before I noticed factorials could be precomputed. This is most similar to the "factoring in" rule.
etc.
The text was updated successfully, but these errors were encountered: