Applications of a Simple Counting Technique

DOI10.2307/2975816zbMATH Open0509.10003OpenAlexW4231530272MaRDI QIDQ4748201FDOQ4748201

Authors: Melvin Hausner 

Publication date: 1983

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

Full work available at URL: https://doi.org/10.2307/2975816

zbMATH Keywords

congruencecounting techniques

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Congruences; primitive roots; residue systems (11A07)

Cited In (4)

• Two \(p^ 3\) variations of Lucas' theorem
• An isolic generalization of Cauchy's theorem for finite groups
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• On binomial coefficients modulo squares of primes

This page was built for publication: Applications of a Simple Counting Technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4748201)