• MODULO ELEVEN: NUMBER THEORY (11A07; 11A41)
Abstract
The following paper provides a technique, with the help of which, one can easily and efficiently find remainders when a two or three-digit number is divided by 11. The paper provides logical and simple proofs to the formulae as well as verifies them with the help of examples.
Keywords
Number theory, modular arithmetic, congruence modulo, modulo 11, division algorithm.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |