Integers Extra 2021
Integers Extra 2021
• The basics properties of integers and Euclid's method on how to find gcd(a;b) and to use
such to write the gcd(a;b) as a linear combination of a and b: this is needed for the last
part of coding theory.
[pg: 35 - 38]
• Properties when we have a prime factor.
The refinement using lcm(a;b) when finding IA U Bl= IAI + IBI - I An Bl
[Pg: 38 - 40]
• Coding theory :
The division theorem [Th 32] is crucial.
Note how to find the unique p and r so that: a= b(p) + r with O � r < b
Find p first for then just make r the subject of the formula.
To find p : divide "b" into "a" [using calculator if need be] and if goes exactly [ie integer
value] then such is p, if not exactly : then for p take the first integer to the LEFT of the
answer.
Note that with coding theory we will expect you to be able to find what sent if you know
what received and vice versa.
NB: We shall not be so concerned with finding the general inverse function although this
is worthwhile reading.
FIRST read through the work, then return and see how the next worked out example is
done in a way that might be easier as a particular example.
Coding example: