Modulo a Prime Number

We have seen that modular arithmetic can both be easier than normal arithmetic (in
how powers behave), and more difficult (in that we cant always divide).

But when n is a prime number, then modular arithmetic keeps many of the nice
properties we are used to with whole numbers.

(Recall that a prime number is a whole number, greater than or equal to 2, whose
only factors are 1 and itself. So 2, 3, 5, 7, 11 are prime numbers whilst, 6 = 2 3 and
35 = 5 7 arent.)
Inverses, Modulo a Prime

Theorem 1 When n is a prime number then it is valid to divide by any non-zero

number that is, for each a {1, 2, ..., n 1} there is one, and only one, number
u {1, 2, ..., n 1} such that
au = 1 (mod n).
Then, dividing by a is the same as mulitplying by u, i.e. division by a is given by the
rule
b
= bu (mod n).
a

For example, in mod 7, we have

1 1 1 1 1 1
= 1, = 4, = 5, = 2, = 3, = 6.
1 2 3 4 5 6
Roots of a Polynomial

Theorem 2 When n is prime number, then a polynomial of degree k, say

a0 + a1x + a2x2 + + ak xk = 0 (mod n) with ai {0, 1, 2, . . . , n 1},
has at most k solutions.

So it is impossible, when n is a prime, for a quadratic like x2 1 to have more than

2 roots, as we saw it having in mod 8 arithmetic.
Note that a quadratic, like x2 + x + 1 in mod 2 arithmetic, can have fewer than two
roots; but this type of behaviour we have seen before as x2 + 1 = 0 has no solutions
amongst the real numbers.
Fermats Little Theorem

Theorem 3 When n is a prime number, then

an = a (mod n).
for any a.

This, in fact, tells us more than Theorem 1; this tells us that when a 6= 0, then
dividing by a is the same as multiplying by an2, as
1
= an2 (mod n).
a
We now have an explicit expression for as multiplicative inverse.
Problems

1. Find 11 , 12 , 13 , 1
4 in mod 5 arithmetic.
2. Check, with n = 7 that Fermats Little Theorem holds for each value of a =
0, 1, 2, 3, 4, 5, 6 mod 7.
3. Which numbers is it valid to divide by in mod 9 arithmetic? For these numbers
find their inverses.
4. How many solutions has x2 + x = 0 in mod 6 arithmetic? (Try out each of the
numbers 0, 1, 2, 3, 4, 5 mod 6.)
5. Find two different ways to factorise x2 + x in mod 6 arithmetic.
Answers

1. In mod 5 arithmetic, the reciprocals are given by

1/1 = 1, 1/2 = 3, 1/3 = 2, 1/4 = 4 (mod 5).
2. Verifying Fermats Little Theorem, mod 7, we see:
07 = 0 (mod 7); (1)7 = 1 (mod 7);
(2)7 = 27 = 24 23 = 16 8 = 2 1 = 2 (mod 7);
(3)7 = 37 = 34 33 = 81 27 = 4 6 = 24 = 3 (mod 7).
3. It is valid to divide by 1, 2, 4, 5, 7, 8 (mod 9). The reciprocals are:
1/1 = 1, 1/2 = 5, 1/4 = 7, 1/5 = 2, 1/7 = 4, 1/8 = 8.
4. In mod 6 arithmetic, x2 + x takes values 0, 2, 0, 0, 2, 0 (mod 6) when
x = 0, 1, 2, 3, 4, 5 (mod 6). So x2 + x = 0 (mod 6) has four roots 0, 2, 3, 5.

5. x2 + x factorises in mod 6 arithmetic as:

x2 + x = x(x + 1) = (x + 4)(x + 3) (mod 6).
Appendix: Modular Arithmetic is Well-defined.

In our earlier definition of addition, subtraction, multiplication and powers in modular

arithmetic a subtle check was omitted. Modular arithmetic is about the addition (etc.)
of remainders. When we write 11 = 1 (mod 2), we are saying that multiplying any
two odd numbers results in an odd number. But we havent proven this anywhere
yet; its very important that it doesnt matter which odd numbers we choose.
Lets prove this first: the odd numbers are precisely those that can be put in the
form 2k + 1 where k is a whole number. So if we have two of these, 2k1 + 1 and
2k2 + 1 say, their product is
(2k1 + 1)(2k2 + 1) = 4k1k2 + 2k1 + 2k2 + 1
= 2(2k1k2 + k1 + k2) + 1
which we can see is another odd number; we finally see a product of odd numbers is
odd, irrespective of the odd numbers chosen.
And more generally, we defined the operations of modular arithmetic as
a (mod n) + b (mod n) = remainder when a + b is divided by n;
a (mod n) b (mod n) = remainder when a b is divided by n;
a (mod n) b (mod n) = remainder when a + b is divided by n;
(a (mod n))k = remainder when ak is divided by n.
It is important to check that it does not matter which numbers we are choosing from
the classes of numbers, a (mod n) and b (mod n).

Specifically, we really need to check that if

a = A (mod n)) and b = B (mod n)
then in mod n arithmetic, we must also have
a + b = A + B; a b = A B; ab = AB; ak = A k .
The first two lines are easy checks and the third, multiplication, is very similar to the
previous calculation with odd numbers.
To prove that powers are well-defined in modular arithmetic, suppose that a = A
(mod n). As a and A leave the same remainder, then they must be a multiple of n
apart, i.e.
a = A + cn
for some whole number c. So, factorizing first, we have

ak Ak = (a A) ak1 + Aak2 + A2ak3 + + Ak1
k1 k2 2 k3 k1

= cn a + Aa +A a + + A
= 0 (mod n),
because it is a multiple of n. Hence ak = Ak (mod n), and powers are well-defined
in modular arithmetic as well.
Codes

A code is a way of representing words and messages as numbers or symbols. One

of the best known examples of a code is the Morse code which represents letters as
short sequences of dots and dashes (see below). Note how the code aims to use short
codings for commonly used letters like E.

A G M S Y 4
B H N T Z 5
C I O U 1 6
D J P V 2 7
E K Q W 3 8
F L R X 4 9

Another well-known codeis the ASCII code used in computing which assigns a number
between 0 and 255 to a wide array of symbols (upper and lower case alphabets,
punctuation marks, mathematical symbols etc.)
ISBN codes

The ISBN code (which stands fo International Standard Book Number is a 10-digit
number which appears on the back of every book published. For example, the ISBN
code of David Achesons 1089 and All That is

0198516231

It contains information about the language, publisher and title. The last digit of
the code is a check digit, which helps combat the problem that the code might be
miscommunicated.
A ISBN code abcdefghij is set up in such a way that
10a + 9b + 8c + 7d + 6e + 5f + 4g + 3h + 2i + j
is divisible by 11. The check digit j can be chosen in the range 0 6 j 6 10 so that
this is possible in the event that j = 10 then the letter X is used instead.
Turning Words into Numbers

The reason we need a code is that the RSA encryption, which we will meet later,
is based on clockwork arithmetic; we need to be able to convert any message into
numbers first, before we can apply modular arithmetic.
The following important features will be considered in creating any code:

each coded message can be decoded uniquely;

the code has limited redundancy i.e the coded message has optimal length;
the original message can be recovered in the event of limited transmission errors.

There is a standard way in mathematics, called a Huffman code, for turning a message
into numbers, in a systematic and efficient way.
Example of a Huffman Code
Suppose we wish to send a message to a Martian Rover, which understands five
commands

Stop, Go North, Go West, Go East, Go South.

Say that these commands are given with respective probabilities

1 1 1 1 1
, , , , .
3 6 6 6 6
Then a Huffman code for this might be of the form

Command Code Probability Length

Stop 00 1/3 2
Go North 010 1/6 3
Go West 011 1/6 3
Go East 10 1/6 2
Go South 11 1/6 2
2
Average code length = 3 + 12 + 12 + 13 + 31 = 2 13 digits per command.
Creating a Huffman Code
1 1 1
Stop 3 3 3 &0 00
1 2
Go North 6 &0 1 1 3 &0 010
1 %1
Go West 6 %1 3 3 1 011
1 1
Go East 6 6 &0 1 1 10
1 1 %1
Go South 6 6 %1 3 3 11

Group the two least likely commands together.

Consider these now a single command, with the two probability combined.
We have one fewer command now. Repeat this until one command remains.
Assign a code to each command, working backwards. Call the last two subsets
grouped the 0-group and the other the 1-group.
The first code letter of the 0-group will be 0 and the first letter of the 1-group
will be 1.
Assign to each command a list of 0s and 1s, depending on whether, at various
stages, they came from a 0-group or a 1-group.
Theorem 4 (Huffman 1952) Huffman codes are:

uniquely decipherable. In fact, Huffman codes are more than this: they are
instantaneous. Not only can a coded message be uniquely deciphered, it can be
done so by reading the coded message number by number, without knowledge
of the whole code.
compact. This means that the average length of a Huffman-coded message is
the best possible using the numbers 0 and 1.

More general Huffman codes, using more than just the numbers 0 and 1, can be
easily made.
The Huffman code has no built in redundancy to deal with transmission errors.
Problems
1. Check that the ISBN code 0198516231 is a valid one.
2. I mistakenly wrote down the ISBN code of Codes and Cryptography as 0198532773,
but with one of the digits out by one. Show that this is an incorrect ISBN code.
Which numbers may have been wrong and what should they have been?
3. The following coded messages have all been made using the previous Huffman
code. Decode their command sequence.
010011101100, 011011101100, 01001100111100.
4. Write down a sequence of 0s and 1s which the Martian Rover couldnt interpret
as meaningful commands.
5. By grouping the Rovers commands differently, create a different Huffman code.
6. What is this average code length per command for your new code?
7. Find different decodings of the following Morse Code (with the gaps removed)
which do you think is the right one?

Answers
1. The ISBN code 0198516231 gives 0 + 9 + 72 + 56 + 30 + 5 + 24 + 6 + 6 + 1 =
209 = 19 11.
2. The ISBN code 0198532773 gives 0 + 9 + 72 + 56 + 30 + 15 + 8 + 21 + 14 + 3 =
228 = 8 (mod 11). So either the first 7 should have been an 8 (increasing this
sum by 3), or the 9 should have been an 8 (decreasing this sum by 8).
3. 010011101100 = North + West + East + South + Stop;
011011101100 = West + West + East + South + Stop;
01001100111100 = North + West + Stop + South + South + Stop.
4. Any odd length string of 0s would be meaningless to the rover.
5. Grouping first N & W, then E & S, then N+W & E+S, then all together, we
could get the Huffman code:
Stop = 0, North = 100, West = 101, East = 110, South = 111.
6. The new codes average length is 1/3 + 3/6 + 3/6 + 3/6 + 3/6 = 7/3 as before.
7. The piece of Morse code could be translated as HEEDRJ, SSBDO, or more
likely HELLO.