Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems

DOI10.2307/30037444zbMath1117.11008OpenAlexW4252872454MaRDI QIDQ5703717

Arthur T. Benjamin, Jeremy Rouse, Peter G. Anderson

Publication date: 8 November 2005

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/520

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Power residues, reciprocity (11A15)

Related Items (4)

Binomial Coefficients Modulo Primes ⋮ On binomial coefficients modulo squares of primes ⋮ FIXED AND PERIODIC POINTS OF POLYNOMIALS GENERATED BY MINIMAL POLYNOMIALS OF 2cos(2π/n) ⋮ A String of Pearls: Proofs of Fermat's Little Theorem

This page was built for publication: Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems