Open Access
2016 A combinatorial proof of a decomposition property of reduced residue systems
Yotsanan Meemark, Thanakorn Prinyasart
Involve 9(3): 361-366 (2016). DOI: 10.2140/involve.2016.9.361

Abstract

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.

Citation

Download Citation

Yotsanan Meemark. Thanakorn Prinyasart. "A combinatorial proof of a decomposition property of reduced residue systems." Involve 9 (3) 361 - 366, 2016. https://doi.org/10.2140/involve.2016.9.361

Information

Received: 16 October 2011; Revised: 21 December 2014; Accepted: 23 June 2015; Published: 2016
First available in Project Euclid: 22 November 2017

zbMATH: 1342.11005
MathSciNet: MR3509330
Digital Object Identifier: 10.2140/involve.2016.9.361

Subjects:
Primary: 11A07

Keywords: Chinese remainder theorem , reduced residue system

Rights: Copyright © 2016 Mathematical Sciences Publishers

Vol.9 • No. 3 • 2016
MSP
Back to Top