A Coloring Proof of a Generalisation of Fermat's Little Theorem
From MaRDI portal
Publication:3737489
DOI10.2307/2323475zbMATH Open0602.10006OpenAlexW4230806901MaRDI QIDQ3737489FDOQ3737489
Authors: Chris 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
Recommendations
Congruences; primitive roots; residue systems (11A07) Arithmetic functions; related numbers; inversion formulas (11A25) Other combinatorial number theory (11B75)
Cited In (17)
- A String of Pearls: Proofs of Fermat's Little Theorem
- Coloring the \(n\)-smooth numbers with \(n\) colors
- Short proofs of the Kneser-Lovász coloring principle
- Title not available (Why is that?)
- Binomial coefficients, Catalan numbers and Lucas quotients
- Fermat's little theorem and Gauss congruence: matrix versions and cyclic permutations
- An extension of a result of Gauss to finite groups: a linear algebraic approach
- A short list color proof of Grötzsch's theorem
- On congruences for the traces of powers of some matrices
- On some number-theoretic conjectures of V. Arnold
- On the matricial version of Fermat-Euler congruences
- Title not available (Why is that?)
- Dold sequences, periodic points, and dynamics
- Linear recurrence sequences satisfying congruence conditions
- Cycles, Eulerian digraphs and the Schönemann-Gauss theorem
- Arithmetic and combinatorics of recurrent sequences
- On matrix analogs of Fermat's little theorem
This page was built for publication: A Coloring Proof of a Generalisation of Fermat's Little Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737489)