Remainder or modular Arithmetic
There are many rules for recognizing when whole numbers are multiples of
2, 3, 4, 5, 6, 7, 8, 9,10 and 11. Those rules are consequences of modulo
or remainder arithmetic. Introduction of the phrase remainder
arithmetic may be a site invention or not, but the phrase points to
the use we will make of modular arithmetic.
Long division implies for any pair of natural numbers d > 0 and n
> 0, there are naturals numbers q > 0 and r such
that
0 < r < d and n = qd +r
Here the quotient q = the number of whole times that the
divisor d goes into the dividend n, and r = the remainder.
Two natural numbers n and m are said to be equivalent or equal modulo d,
when there remainders on division by d are equal. In this case, we write
n = m, modulo d.
Equality modulo a whole number or divisor d is
-
reflexive, that is, each number n = itself, modulo d, or
equivalent n = n, modulo d, for each natural number n.
-
symmetric, that is, n = m modulo d when and only when m =
n modulo d, and
-
transitive, that is, if n = m modulo d, and m = t modulo
d then n = t modulo d.
A whole number n is divisible by the divisor d when and only when
n = qd for some whole number q. That is when and only when n = 0, modulo
d and when and only when n is a whole or natural number multiple of the
divisor d. The number 0 is a multiple of all divisors d. Observe, if n
> m then n = m, modulo d when and only when n - m is a
multiple of d while if n < m then n = m, modulo d when and
only when m -n is a multiple of d.
Remainder Calculations are based on the following properties or
theorems.
Theorem: Suppose m, n, u and v are natural numbers. Suppose d
> 0 is a whole number. If m = n, modolo d and u = v, modulo d
then (i) m + u = n +v modulo d, and (ii) mu= nv, modulo d.
Proof: First, m = n, modulo d, implies m = a d +r and n = b d
+r for some whole numbers a, b and a common remainder r with 0
< r < d. Likewise, u = v, modulo d, implies u = A d + s
and v = B d +s for some natural numbers A, B and a common remainder r
with 0 < s < d.
Arguments for (i): Suppose (m+ u) > (n+v) then
(m+ u) - (n+v)
= (ad +r + Ad+s) - (bd+r + Bd+s)
= (a+A)d + (r+s) - [(b+B)d + (r+s)]
= (a+A)d-(b+B)d
= [(a+A)-(b+b)]d
is a multiple of d, and hence (i) m + u = n +v modulo d holds when
(m+ u) > (n+v). The case where (n+v) > (m+u)
follows similarly.
Arguments for (ii): Suppose m u > nv then
mu - nv
= (ad +r)(Ad+s) - (bd+r)(Bd+s)
= aAd2 + asd+ Ard+ rs - [bBd2 + bsd+ Brd+
rs]
= [{(aA)-(bB)}d + (as-bs)]d
is a multiple of d, and hence (i) m u = n v modulo d holds when m u
> nv. The case where nv > mu follows similarly.
Remainder Calculations for Negative Numbers
Observe if m > 0 is a whole number with m = r, modulo d, then - m =
-r = n-r, modulo d,
For example 18 = 3 modulo 5. Therefore,
modulo 5: -18 = - 3 = 0 - 3 = 5 -3 = 2.
Observe 18 = 3 × 5 + 3 while -18 = - 20 + 2 = (-4)x5 + 2.
Calculator Usage: For every divisor d > 0 and every number N,
there is a unique integer q such that qd < N < (q+1)d so
that r = N-qd satisfies 0 < r < d. With the aid of a
calculator, if N is positive, the whole number part of the decimal
representation of the computed value of N/d gives q > 0. But if N
is negative, the whole number part of the decimal representation of the
computed value of N/d gives q+1 < 0, and q is one less than
the whole number part of N/d.
Recognizing Whole Number Multiples of 2, 3, 5, 9 & 11 via their
Decimals Form
As a student, you need to be proficient and quick with exact arithmetic
with whole numbers less than 100 and their ratios. Some of the
remainder calculation and divisibility rules below can be used quickly.
The rest are curiosities.
Decimal Based Rules for remainders for whole numbers, modulo 2, 3, 5, 9
& 11, follow.
-
Remainder on division by 2 is 0 if last digit is even, that is, a 0,
2, 4, 6 or 8.
-
Remainder on division by 2 is 1 if last digit is odd, that is, a 1,
3, 5, 7 or 9.
-
Remainder on division by 5 is 0 if last digit is 0 or 5.
-
Remainder on division by 5 is 1 if last digit is 1 or 6.
-
Remainder on division by 5 is 2 if last digit is 2 or 7.
-
Remainder on division by 5 is 3 if last digit is 3 or 8.
-
Remainder on division by 5 is 4 if last digit is 4 or 9.
-
Remainder on division by 10 is given by the last digit.
-
Remainder on division by 100 is given by the last two digit.
-
Remainder on division by 1000 is given by the last two digit.
-
Remainder on division by 3 is given by the sum of digits, modulo 3,
as 10k = 1, modulo 3, for all natural numbers k..
-
Remainder on division by 9 is given by the sum of digits, modulo 9,as
10k = 1, modulo 9, for all natural numbers k..
-
Remainder on division by 11 is given by the alternating sum of
digits, modulo 11, ,as 10k = (-1)k, modulo 11,
for all natural numbers k.. Knowledge of remainder arithmetic for
integers required here.
Reasons to explain the above rules and further ones follow.
Remainders Modulo 2
Observe 10k = 5k2k = 0, modulo 2, for
all whole numbers k > 0. Therefore
-
243 = 2 × 102+ 4 × 10 + 3 = 0 + 0 + 3 = 3 = 3 =1,
modulo 2.
-
6825 = 6 × 103 + 8 × 102+ 2 × 10 + 5 = 0 + 5 =
1, modulo 2.
-
52300 = 5230 × 10 = 0, modulo 2
In general, the remainder, modulo 10, of a n-digit decimal whole number
equals the remainder modulo 2 of the last digit. For example,
479 = 47 × 10 + 9 = 0+ 9 = 1, modulo 2
Remainders, Modulo 3
Now we calculate a few remainders modulo 3. For that, observe
10 =1 , modulo 3
100 = 102 = 12 = 1, modulo 3.
1000 = 103 = 13 = 1, modulo 3.
Repeated calculations (mathematical induction) implies
10k = 1, modulo 3. for all natural numbers k.
Again, do the calculations for k = 0, 1, 2, 3, 4 and 5, or apply
mathematical induction.
Therefore with equalities modulo 3
243 = 2 × 102+ 4 × 10 + 3 = 2 × 1+ 4 × 1 + 3 = 2+ 4 + 0 = 6
= 0, modulo 3.
Therefore with equalities modulo 3,
modulo 3: 6821 = 6 × 103 + 8 × 102+ 2 × 10 + 1 =
6 + 8 + 2 + 1 = 0+ 8 + 3 = 8 = 2
The foregoing implies 6819 = 6821 -2 = 0 modulo 3.
Note: Putting modulo 3 before the sequence of
equalities provides an immediate context for them while putting them
after delays the justification. We may use both. Putting them before
may be site re-invention.
Computational short cuts may be possible.
For instance, remainder on division by 3 is given by the
sum of digits, modulo 3, as 10k = 1, modulo 3, for all
natural numbers k.. But in the sum of those digits, we may replace 0,
3, 6 and 9 by zero, 2, 5 and 8 by 2 and 1, 4 and 7 by 1.
Remainders, Modulo 4
The remainder, modulo 4, of a n-digit decimal whole number equals the
remainder modulo 4 of the last 2 digits. For example
6821 = 68 × 102+ 21 = 68 × 0 + 21 = 0 + 5 × 4 + 1 = 1 modulo
4.
Remainders Modulo 5
Observe 10k = 5k2k = 0, modulo 5, for
all whole numbers k > 0. Therefore
-
243 = 2 × 102+ 4 × 10 + 3 = 0 + 0 + 3 = 3 = 3 modulo
5.
-
6821 = 6 × 103 + 8 × 102+ 2 × 10 + 8 = 0 + 3 =
3, modulo 5.
-
475 = 47 × 10 + 5 = 0, modulo 5
-
52300 = 5230 × 10 = 0, modulo 5
In general, the remainder, modulo 5, of a n-digit decimal whole number
equals the remainder modulo 5 of the last digit. For example,
479 = 47 × 10 + 9 = 0+ 9 = 1, modulo 5
Remainders Modulo 6
A curiosity
The remainder modulo 6 of a n digit whole number N is 0 if N is a
multiple of both 2 and 3. The decimal representation of N implies N =
q10 + r. Then q = a3+b where b is 0, 1 or 2. Therefore
modulo 6, N = q10 + r = (a3+b)10 + r = 30a + b 10 +r = b10 +r,.
where b is 0, 1 or 2 and r is a single digit number 0 to 9.
Example 1: For the number 6835, we have
modulo 3, 683 = 6 + 8 + 3 = 8 = 2
Therefore b = 2, and
modulo 6, 6825 = 682 × 10 + 5 = 2 × 10+ 5 = 25 = 1.
Example 2: For the number 23558 we have
modulo 3, 23455 = 2 + 3 + 5 + 5 = 15 = 0
Hence with b = 0, we have
modulo 6, 23558 = 2355 × 10 + 7 = 0+ 7 = 2
Remainders, Modulo 7
A curiosity
The first 7 multiples of 7 are 7, 14, 21, 28, 35, 42 and 49. Therefore
50 = 1 modulo 7 and 100 = 2 modulo 7. We may use the foregoing to a form
and simplify a sequence of equalities, modulo 7, to compute the remainder
after division by 7.
For a first example
modulo 7: 34569 = 345x100 + 50 + 19
= 345x2 + 1+ 5
= 696
= 6 × 100 +50 + 46
= 6 × 2+ 1 + 4
= 17
= 3
Therefore 34569 = 3, modulo 7.
For a second example,
modulo 7: 654321 = 6543 × 100 + 21
= 6543 × 2 + 0
= 13086
= 130 × 100 + 50 + 36
= 260+ 1 + 1
= 262
= 2 × 100 +50 + 12
= 4 + 1 + 5
= 10
= 3.
Therefore 654321 = 3, modulo 7.
Remainders, Modulo 8
The remainder, modulo 8, of a n-digit decimal whole number equals the
remainder modulo 8 of the last 3 digits. For example
76827 = 76 × 103 + 827 = 6 × 0 + 827 = 0 + 206 × 4 + 3 = 3
modulo 4.
Remainders, Modulo 9
Now we calculate a few remainders modulo 9. For that, observe
10 =1 , modulo 9
100 = 102 = 12 = 1, modulo 9.
1000 = 103 = 13 = 1, modulo 9.
Repeated calculations (mathematical induction) implies
10k = 1, modulo 9. for all natural numbers k.
Do the calculations for k = 0, 1, 2, 3, 4 and 5, or apply mathematical
induction.
Therefore with equalities modulo 9
243 = 2 × 102+ 4 × 10 + 3 = 2 × 1+ 4 × 1 + 3 = 2+ 4 + 3 = 9
= 0, modulo 9.
Therefore with equalities modulo 9,
modulo 9, 6821 = 6 × 103 + 8 × 102+ 2 × 10 + 1 =
6 + 8 + 2 + 1 = 17 = 10 + 7 = 1+ 7 = 8
The forgoing implies modulo 9, 6822 = 6821 + 1 = 8+ 1 = 0.
Computational short cuts may be possible.
For instance, Remainder on division by 9 is given by the
sum of digits, modulo 3, as 10k = 1, modulo 3, for all
natural numbers k.. But in the sum of those digits, we may replace 9 by
zero
If you are a student, use only those shortcuts sanctioned by or
understandable to your teachers.
Remainders, Modulo 10
The remainder, modulo 10, of a n-digit decimal whole number equals the
remainder modulo 8 of the last digit. For example
76827 = 7682 × 10 + 7 = 7682 × 0 + 7 = 7, modulo 10.
Remainders, Modulo 11
Now we calculate a few remainders modulo 11. For that, observe
10 = -1 , modulo 11
100 = 102 = (-1)2 = 1, modulo 11.
1000 = 103 = (-1)3 = 1, modulo 11.
Repeated calculations (mathematical induction) implies
10k = (-1)k, modulo 9. for all natural numbers
k.
Do the calculations for k = 0, 1, 2, 3, 4 and 5, or apply mathematical
induction.
Therefore
modulo 11: 243 = 2 x 102+ 4 × 10 + 3 = -2+ 4 -
3 = -1 = 10
modulo 11, 6821 = 6 × 103 + 8 × 102+ 2 × 10 + 1 =
-6 + 8 - 2 + 1 = 1
Note 10k = (-1)k ,modulo 11, implies the ones
column (k=0) makes a positive contribution, the tens column (k=1) makes a
negative contribution, and the sign of the columns alternates. So
instead of writing
modulo 11: 6821 = -6 + 8 - 2 + 1 = 1
starting from the left, we can may write the alternating sum
modulo 11: 6821 = 1 - 2 + 8 - 6 = 1
starting at the right with the one's digit.
That brings us to the last example for remainders, modulo 11 in which we
start the alternating sum with the one's or unit digit.
Modulo 11: 76823 = 3 - 2 + 8 - 6 + 7 = 10
Remainder Calculations for Negative Numbers
Observe if m > 0 is a whole number with m = r, modulo d, then - m =
-r = n-r, modulo d,
For example 18 = 3 modulo 5. Therefore,
modulo 5: -18 = - 3 = 0 - 3 = 5 -3 = 2.
Observe 18 = 3 × 5 + 3 while -18 = - 20 + 2 = (-4)x5 + 2.
Remark: For every divisor d > 0 and every number N, there is
a unique integer q such that qd < N < (q+1)d so that r =
N-qd satisfies 0 < r < d. With the aid of a calculator,
if N is positive, the whole number part of the decimal representation
of the computed value of N/d gives q > 0. But if N is negative, the
whole number part of the decimal representation of the computed value
of N/d gives q+1 < 0, and q is one less than the whole
number part of N/d.
Connections to the Integer Part Function
When a real number x can be written in the form n + r where 0 <
r < 1, we say the [greatest] integer part of x
[x]=n.
Here are some examples:
When x is an integer multiple of a divisor d, d nonzero, we have x = n d
for some integer n. So the integer part of
[x ÷ d] = n
In general, for d nonzero, x = d n + r where 0 < r < d. In
this case too, integer part of
[x ÷ d] = n
Connections to logarithms
In the study of logarithms to tbe base 10, the logarithm x=log (M) of a
positive number M satisfies
x = [x] + r = characteristic + mantiss
where n = [x] is an integer and where 0 < r < 1. In
handling logarithms to base 10, the integer part of log (M) would be called
the characteristic> of the logarithmic, and the proper decimal fraction r
would be called the mantissa. In the days before calculators, products and
quotients of real numbers would be done with the aid of base-10 logarithmic
tables, tables given for numbers between 1 and 10. The tables would be used
forward and backwards find products and quotients.
Now each positive M has a decimal expansion, and from that, we may
express M in scientific notation in the form
M = R × 10n
where n is an integer and where 1 < R < 10. So by the
properties of logarithms in general and to base 10,
log(M) = log(R) + n = r + n
where 0 < r = log(R) < 1. In the application of logarithms
to base 10 tabulated for values between 1 and 10, for question of what
the quotient should be for division of real numbers x by 1 is given by the
integer part of n= log(M) for practical convenience, and no theoretical reason.
|
|
Teachers & Tutors: Site pages offer better or best practices for providing skills -
simpler than expected & comprehensive but for exercises. For your charges, your duty is to study them alone or in
groups and develop skill building exercises & activities to share. Start now. The effort here is the best I can do.
Others are welcome to refine or exceed it. Please do.
Secondary
Mathematics for Ages 11+, A Practical Approach for home-tutoring or -schooling, or for schools & colleges
with local curriculum control. Study how to include site content - its skill development how-TOs and innovations
into present or future lesson plans - some reading required.
Road
Safety Messages and Questions: When and why should you face
traffic when walking along a road or cycle path? Is it a good
idea to hang limbs outside of cars etc? What gives more
protection in a crash: a car, motorbike or bicycle?
See too, the BBC-Belgium story Texting and
Driving - texting & the impossible test - the article links to a gruesome utube video on the subject
The Logic of Injustice:
How Texas sent
an innocent man to his death - The wrong Carlos. Some judgments are irreversible. Procescution: Where and when prosectors play to win rather than for
justice, guilt beyond a reasonable doubt goes unrespected due to prosecutors who putting winning
first, those innocence before the law may be convicted. Some procescutors offices in continuing to accuse after a pardon
due to reasonable doubt or innocent being shown, may sucessfully oppose compensaton for false convictions
by asserting a pardon individual is still under suspicion. Then the pardoned individual or the latter's estate
is not compensation for years or decade
of improper or false imprisonment, or for execution. Site chapters on Logic
and some in Pattern
Based Reason may slowly lead to greater precision in reading, applying and
writing laws.
May 2012, Composition Starting:
Pre-School and Primary Mathematics - Quantitative Skills, An
Intellectual View, Feedback Welcome:
The 8 Most Popular Site Inlinks
Parent Center: Help your child or teen
learn:
Parent-friendly
Work Booklets for ages 3+ to 13 Use these or others to check
or build skills. Other booklets are available but these booklets
allow parents unsure of themselves in mathematics to help their
children. The selection acquired in Canada is published in the
USA. So it has a US orientation. In retrospect, the selection
shows parents what to check with the booklets or by other ways,
the choice is theirs. But in retrospect, the selection does not
cover integral and fractions liquid weights and measures - ask
the publishers to correct that! For ages 9 to 12 say, parents may
compensate by showing boys and girls how to use weights or mass,
and further measures in food preparation. Beyond that children
may be shown how to measure and calculate angles, lengths and
areas [proportional amounts too] directly or by using maps and
plans drawns to scale. Learning how to gather and measure all the
ingredients, pots and pans for a dish or a meal, along with
cleaning up sets the stage for like activities or experiments in
science courses, and in developing organizational skills,
gives boys and girls a head start. Good luck. At the other
extreme, more comprehensive than light, if your motto is
McCainian: drill, drill, drill then Toronto
mathematician and actor John Mighton's jump math organization has jump math
workbooks for at least grades 3 to 8 for at-home and in-school
use - training sessions for teachers available. Jump math has
been expanding to cover older students. Jump Math Samples: plus
Fractions for
Grades 3-4 & Grades 5-6 [Read] Free Resources grades 1 to 8
[unread - likely to be good]. and
Mathematics
Skills For Ages 3 to 14 - technical!
Skills with take
home value - A few ideas
Basic skills include
time-date-calendar Matters; money matters; map, plan and
scale diagram matters;counting, measuring and figuring;
decision making with logic and likelyhood; being careful and
being aware of the domino effect of mistakes; reading and
writing with precision.
Is your child able to add, subtract and multiply amounts
of money, work with fractions, work with clocks and calendars,
work with maps and plans, and measure length, weight-mass and
volume? Schools may promote your son or daughter without
providing basic skills in reading, writing and
arithmetic.
Arithmetic
and Number Theory Skills
Algebra
Starter Lessons
Geometry
- maps plans trigonometry vectors
More
Algebra
70
Calculus Starter Lessons
Calculus Lessons Elsewhere:
-
How to Ace Calculus: Street Wise Guide - Mostly
Text.
-
Flash
Video for Calculus Phobics
They cover basic topics in ways likely to complement your
notes, your textbooks and site material. When Goldilocks
trespassed in the house of the three bears, she found three bowls
of porridge, two not to her liking, and one just right. Different
bears have different tastes. As invited guest here and elsewhere,
if one or more explanations is not to liking, try another. It may
be better or just right.
Unsolicited Advice
Learning to do and high marks if it comes to easy is often
deceptive - light rather than deep. For that reason, students
with learning difficulties determined not to let it get in their
way may go deeper and farther than those with none. High marks,
if the come easy, may be deceptive - provide a too light and not
a deep mastery. That could have been your problem in secondary
school, one that leads to comprehension shock or difficulties in
calculus and more generally in the first year of college. Bon
Appetite.
|
|