×

Efficient remainder rule. (English) Zbl 1397.97005

Summary: Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the given conditions, one may need to understand the concept of modulo arithmetic in number theory. The Chinese Remainder Theorem is a known method to solve these types of problems using modulo arithmetic. In this paper, an efficient remainder rule has been proposed based on basic mathematical concepts. These core concepts are as follows: basic remainder rules of divisions, linear equation in slope intercept form, arithmetic progression and the use of a graphing calculator. These are easily understood by students who have taken prealgebra or intermediate algebra.

MSC:

97F60 Number theory (educational aspects)
11A07 Congruences; primitive roots; residue systems
Full Text: DOI

References:

[1] Richman F. Number theory: an introduction to algebra. Pacific Grove (CA): Brooks/Cole Publishing Co;1971. · Zbl 0279.12001
[2] Sen MK, Chakraborty BC. Introduction to discrete mathematics. Calcutta: Books and Allied (P) Ltd; 2000.
[3] Beiler AH. Recreations in the theory of numbers. New York (NY): Dover Publications, Inc; 1964. · Zbl 0125.29203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.