• Corpus ID: 153463685

Third and Fourth Binomial Coefficients

@inproceedings{Benjamin2011ThirdAF,
  title={Third and Fourth Binomial Coefficients},
  author={Arthur T. Benjamin and Jacob N. Scott},
  year={2011}
}
This Article is brought to you for free and open access by the HMC Faculty Scholarship at Scholarship @ Claremont. It has been accepted for inclusionin All HMC Faculty Publications and Research by an authorized administrator of Scholarship @ Claremont. For more information, please contactscholarship@cuc.claremont.edu. 
Improvements on the Cantor-Zassenhaus
  • M. Elia
  • Computer Science, Mathematics
  • 2013
TLDR
The key point is to use linear test polynomials, which not only reduce the computational burden, but also enable us to derive good estimates and deterministic bounds on the number of attempts needed to factor a given polynomial.
Improvements on the Cantor-Zassenhaus Factorization Algorithm
TLDR
A new simplified version of this algorithm is described, which entails a lower computational cost and uses linear test polynomials, which not only reduces the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed for factoring.
Mathematica Bohemica
TLDR
A new simplified version of this algorithm is described, which entails a lower computational cost and uses linear test polynomials, which not only reduces the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed for factoring.

References

SHOWING 1-2 OF 2 REFERENCES
Sums of Evenly Spaced Binomial Coefficients
Summary We provide a combinatorial proof of a formula for the sum of evenly spaced binomial coefficients, . This identity, along with a generalization, are proved by counting weighted walks on a
Sums of Selected Binomial Coefficients
Now adding or subtracting (2) and (3) implies that each sum is 2n~1. It is natural to think of replacing the modulus 2 by some other integer, yet I had never done so, nor had I seen such sums until I