Hostname: page-component-cb9f654ff-h4f6x Total loading time: 0 Render date: 2025-08-11T13:07:12.971Z Has data issue: false hasContentIssue false
  • English
  • Français

On Binomial Coefficient Residues

Published online by Cambridge University Press:  20 November 2018

J . B. Roberts
J . B. Roberts*
Affiliation:
Wesleyan University, Middletown, Conn.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The number of binomial coefficients , which are congruent to j , 0 ≤ j ≤ p − 1, modulo the prime number p is denoted by θj(n). In this paper we give systems of simultaneous linear difference equations with constant coefficients whose solutions would yield the quantities θj(n) explicitly.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 9 , 1957 , pp. 363 - 370
Copyright
Copyright © Canadian Mathematical Society 1957

References

1. Dickson, L. E., History of the Theory of Numbers, vol.1 (Chelsea, New York, 1952).Google Scholar
2. Glaisher, J. W. L., On the residue of a binomial theorem coeffcient with respect to a prime modulus, Quart. J. Math., 30 (1899), 150–156.Google Scholar
3. Vinogradoff, I. M., An Introduction to the Theory of Numbers, (London and New York, Pergamon Press, 1955).Google Scholar