AngouriMath
PrimeDividesItsBinomial(AngouriMath.Entity,AngouriMath.Entity)
Method (no overloads)
Summary
Whether p divides binomial(p, k) follows from the facts in scope: p is
prime andk is a whole number with 0 < k < p . Then p divides
p! = binomial(p, k) k! (p - k)! and none of the factors of k! (p - k)! ,
each of which is below the primep . Sullivan and Mackey's Prob 8.9.24.
prime and
each of which is below the prime
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online