Scribd
Upload
36 views

Some Remainder Problems

The document discusses several remainder problems involving dividing various numbers and expressions by other numbers. It then introduces modular arithmetic, explaining that two numbers are congruent modulo n if they differ by a multiple of n. It states that arithmetic operations still work under modulo, with examples. It asks the reader to write out powers of various numbers modulo other numbers. Finally, it provides some challenge problems involving remainders, prime numbers, and perfect cubes.

Uploaded by

Latha Manimaran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

Some Remainder Problems

The document discusses several remainder problems involving dividing various numbers and expressions by other numbers. It then introduces modular arithmetic, explaining that two numbers are congruent modulo n if they differ by a multiple of n. It states that arithmetic operations still work under modulo, with examples. It asks the reader to write out powers of various numbers modulo other numbers. Finally, it provides some challenge problems involving remainders, prime numbers, and perfect cubes.

Uploaded by

Latha Manimaran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Some Remainder Problems

What is the remainder when ...


1. ... 12345 is divided by 11?
2. ... 10 + 11 + 12 is divided by 6?
3. ... 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 is divided by 5?
4. ... 20092 + 2010 + 2011 is divided by 11?
5. ... 1002 + 1012 is divided by 8?
6. ... the sum of the numbers from 1 to 100 is divided by 5?
7. ... the sum of all odd numbers between 1000 and 2000 is divided by 10?
8. ... 81000 is divided by 7?
9. ... 51001 is divided by 6?
10. ... 212035981234808093146372789686129386749 is divided by 3?
11. ... 38675309 is divided by 5?
2009

12. ... 20092009

is divided by 3?

13. ... n3 + 2n + 1 is divided by 3 (for any number n)?

Modular Arithmetic
We say that
a b mod n
(a is congruent to b mod n)
if a and b differ by a multiple of n, or in other words n | (b a). For example,
15 4

mod 11,

22 7

mod 5,

34 8

mod 7.

because 15 4 = 11 = 1 11, 22 7 = 15 = 3 5, 34 (8) = 42 = 6 7.


Here are some different statements that all mean the same thing:
a b mod n
n | (b a)
b a is a multiple of n
a and b differ by a multiple of n
a and b have the same remainder when divided by n
If a = qa n + ra and b = qb n + rb , where 0 ra < n and 0 rb < n, then ra = rb .

What is amazing is that arithmetic still works, in much the usual way. That is:
a b mod n
c d mod n

a + c b + d mod n
ac bd mod n.

How to think of this? A few ways:


Were computing sums and products but instead of the answer all we care about is the
remainder when the answer is divided by n.
Were defining a new sort of number system, which only has the numbers 0, 1, 2, ...,
n 1, with special rules addition and multiplication defined.
Were identifying all numbers which differ by a multiple of n. Thus we have

0 n 2n
1 (n + 1) (2n + 1) ,
and so forth (along with negative integers too), and were talking about what happens
when you add/multiply representatives of any two equivalence classes.
2

Powers Mod n
1. For each a and n, write the powers of a modulo n, i.e. what is a, a2 , a3 , ?
(a) a = 2, n = 5
(b) a = 3, n = 5
(c) a = 2, n = 12
(d) a = 12, n = 15
(e) a = 10, n = 3
(f) a = 10, n = 7
(g) a = 10, n = 9
(h) a = 10, n = 11
2. Make a table that keeps track of the following question: How many powers of a are
there modulo n? Each row should be a value of n and each column a value of a from
0 to n.

Some Challenge Problems


1. Find the last digit of 12 + 22 + 32 + + 992 .
2. What are the possible values of p if:
p and p2 + 2 are prime numbers.
p, p + 10, p + 14 are prime numbers.
3. There are seven natural numbers such that the sum of any six of them is divisible by
5. Prove that each of the numbers is divisible by 5.
4. Prove that a3 + b3 + 4 is never a perfect cube for any natural numbers a and b.

You might also like