A Coloring Proof of a Generalisation of Fermat's Little Theorem

DOI10.2307/2323475zbMath0602.10006OpenAlexW4230806901MaRDI QIDQ3737489

Christopher J. Smyth

Publication date: 1986

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

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

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Congruences; primitive roots; residue systems (11A07) Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items

Cycles, Eulerian digraphs and the Schönemann-Gauss theorem ⋮ Fermat's Little Theorem and Gauss Congruence: Matrix Versions and Cyclic Permutations ⋮ Binomial coefficients, Catalan numbers and Lucas quotients ⋮ Unnamed Item ⋮ An extension of a result of Gauss to finite groups: a linear algebraic approach ⋮ On matrix analogs of Fermat's little theorem ⋮ Linear recurrence sequences satisfying congruence conditions ⋮ On the matricial version of Fermat-Euler congruences ⋮ On some number-theoretic conjectures of V. Arnold ⋮ On congruences for the traces of powers of some matrices ⋮ A String of Pearls: Proofs of Fermat's Little Theorem ⋮ Dold sequences, periodic points, and dynamics