Involve: A Journal of Mathematics
- Volume 9, Number 3 (2016), 361-366.
A combinatorial proof of a decomposition property of reduced residue systems
In this paper, we look at three common theorems in number theory: the Chinese remainder theorem, the multiplicative property of the Euler totient function, and a decomposition property of reduced residue systems. We use a grid of squares to give simple transparent visual proofs.
Involve, Volume 9, Number 3 (2016), 361-366.
Received: 16 October 2011
Revised: 21 December 2014
Accepted: 23 June 2015
First available in Project Euclid: 22 November 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 11A07: Congruences; primitive roots; residue systems
Meemark, Yotsanan; Prinyasart, Thanakorn. A combinatorial proof of a decomposition property of reduced residue systems. Involve 9 (2016), no. 3, 361--366. doi:10.2140/involve.2016.9.361. https://projecteuclid.org/euclid.involve/1511371017