Integers and Division

CS/APMA 202
Rosen section 2.4
Aaron Bloomfield
1

Rosen, chapter 2
We are only doing 2 or 3 of the sections in
chapter 2

2.4: integers and division

2.6: applications of number theory
And only parts of that section

2.7: matrices (maybe)

Quick survey

a)
b)
c)
d)

Have you seen matrices before?

Lots and lots and lots
A fair amount
Just a little
Is that kinda like the movie?

Why prime numbers?

Prime numbers are not well understood

Basis for todays cryptography

Unless otherwise indicated, we are only

talking about positive integers for this
chapter
4

The divides operator

New notation: 3 | 12

To specify when an integer evenly divides

another integer
Read as 3 divides 12

The not-divides operator: 5 | 12

To specify when an integer does not evenly

divide another integer
Read as 5 does not divide 12
5

Theorem on the divides operator

If a | b and a | c, then a | (b+c)

Example: if 5 | 25 and 5 | 30, then 5 | (25+30)

If a | b, then a | bc for all integers c

Example: if 5 | 25, then 5 | 25*c for all ints c

If a | b and b | c, then a | c

Example: if 5 | 25 and 25 | 100, then 5 | 100

The book calls this Theorem 1

6

Prime numbers
A positive integer p is prime if the only
positive factors of p are 1 and p

If there are other factors, it is composite

Note that 1 is not prime!
Its not composite either its in its own class

An integer n is composite if and only if

there exists an integer a such that a | n
and 1 < a < n
7

Fundamental theorem of arithmetic

Every positive integer greater than 1 can be
uniquely written as a prime or as the product of
two or more primes where the prime factors are
written in order of non-decreasing size
Examples

100 = 2 * 2 * 5 * 5
182 = 2 * 7 * 13
29820 = 2 * 2 * 3 * 5 * 7 * 71

The book calls this Theorem 2

8

Composite factors
If n is a composite integer, then n has a prime divisor less
than or equal to the square root of n
Direct proof

Since n is composite, it has a factor a such that 1<a<n

Thus, n = ab, where a and b are positive integers greater than 1
Either an or bn (Otherwise, ab > n*n > n)
Thus, n has a divisor not exceeding n
This divisor is either prime or a composite
If the latter, then it has a prime factor

In either case, n has a prime factor less than n

The book calls this Theorem 3

Showing a number is prime

Show that 113 is prime (Rosen, question
8c, 2.4)
Solution

The only prime factors less than 113 = 10.63

are 2, 3, 5, and 7
Neither of these divide 113 evenly
Thus, by the fundamental theorem of
arithmetic, 113 must be prime
10

Showing a number is composite

Show that 899 is prime (Rosen, question 8c,
2.4)
Solution

Divide 899 by successively larger primes, starting with

2
We find that 29 and 31 divide 899

On a unix system, enter factor 899

aaron@orion:~.16> factor 899
899: 29 31

11

Primes are infinite

Theorem (by Euclid): There are infinitely many prime
numbers

The book calls this Theorem 4

Proof by contradiction
Assume there are a finite number of primes
List them as follows: p1, p2 , pn.
Consider the number q = p1p2 pn + 1

This number is not divisible by any of the listed primes

If we divided pi into q, there would result a remainder of 1

We must conclude that q is a prime number, not among the primes

listed above
This contradicts our assumption that all primes are in the list
p1, p2 , pn.
12

Mersenne numbers
Mersenne nubmer: any number of the form 2n-1
Mersenne prime: any prime of the form 2p-1, where p is
also a prime

Example: 25-1 = 31 is a Mersenne prime

Example: 211-1 = 2047 is not a prime (23*89)

Largest Mersenne prime: 224,036,583-1, which has

7,235,733 digits
If M is a Mersenne prime, then M(M+1)/2 is a perfect
number

A perfect number equals the sum of its divisors

Example: 23-1 = 7 is a Mersenne prime, thus 7*8/2 = 28 is a
perfect number
28 = 1+2+4+7+14

Example: 25-1 = 31 is a Merenne prime, thus 31*32/2 = 496 is a

perfect number
14

Merenne primes
Reference for Mersenne primes:
http://
mathworld.wolfram.com/MersennePrime.html
Finding Mersenne primes

GIMPS Great Internet Mersenne Prime Search

http://www.mersenne.org/prime.htm

A new one was just discovered (last week):

http://mathworld.wolfram.com/news/2005-02-18
/mersenne/

This is only the 42nd such prime discovered

15

The prime number theorem

The radio of the number of primes not exceeding x and x/ln(x)
approaches 1 as x grows without bound

Rephrased: the number of prime numbers less than x is approximately

x/ln(x)
Rephrased: the chance of an number x being a prime number is
1 / ln(x)

Consider 200 digit prime numbers

ln (10200) 460

The chance of a 200 digit number being prime is 1/460

If we only choose odd numbers, the chance is 2/460 = 1/230

This result will be used in the next lecture!

The book calls this Theorem 5

16

Showing a number is prime or not

Consider showing that 2650-1 is prime

That number has about 200 digits

There are approximately 10193 prime numbers less than

2650-1

By theorem 5 (x/ln(x), where x = 2650-1)

How long would that take to test each of those prime

numbers?

Assume a computer can do 1 billion (109) per second

It would take 10193/109 = 10184 seconds
Thats 3.2 * 10176 years!
There are quicker methods to show a number is prime, but not to
find the factors if the number is found to be composite
We will use this in the next lecture
17

The division algorithm

Let a be an integer and d be a positive
integer. Then there are unique integers q
and r, with 0 r < d, such that a = dq+r
We then define two operators:

q = a div d
r = a mod d

The book calls this Theorem 6

18

Greatest common divisor

The greatest common divisor of two
integers a and b is the largest integer d
such that d | a and d | b

Denoted by gcd(a,b)

Examples

gcd (24, 36) = 12

gcd (17, 22) = 1
gcd (100, 17) = 1
19

Relative primes
Two numbers are relatively prime if they
dont have any common factors (other
than 1)

Rephrased: a and b are relatively prime if

gcd (a,b) = 1

gcd (25, 39) = 1, so 25 and 39 are

relatively prime
20

Pairwise relative prime

A set of integers a1, a2, an are pairwise
relatively prime if, for all pairs of numbers, they
are relatively prime

Formally: The integers a1, a2, an are pairwise

relatively prime if gcd(ai, aj) = 1 whenever 1 i < j n.

Example: are 10, 17, and 21 pairwise relatively

prime?

gcd(10,17) = 1, gcd (17, 21) = 1, and gcd (21, 10) = 1

Thus, they are pairwise relatively prime

Example: are 10, 19, and 24 pairwise relatively

prime?

Since gcd(10,24) 1, they are not

21

More on gcds
Given two numbers a and b, rewrite them
a
b
a
a
b
b
a

p
p
...
p
,
b

p
p
...
p
as:
1
2
n
1
2
n
1

Example: gcd (120, 500)

120 = 23*3*5 = 23*31*51
500 = 22*53 = 22*30*53

Then compute the gcd by the following

formula: gcd(a, b) p1min( a ,b ) p2min( a ,b ) ... pnmin( a ,b )
1

Example: gcd(120,500) = 2min(3,2)3min(1,0)5min(1,3) =

223051 = 20
22

Least common multiple

The least common multiple of the positive
integers a and b is the smallest positive
integer that is divisible by both a and b.

Denoted by lcm (a, b)

lcm(a, b) p1max( a1 ,b1 ) p2max( a2 ,b2 ) ... pnmax( an ,bn )

Example: lcm(10, 25) = 50

What is lcm (95256, 432)?

95256 = 233572, 432=2433

lcm (233572, 2433) = 2max(3,4)3max(5,3)7max(2,0) =
243572 = 190512
23

lcm and gcd theorem

Let a and b be positive integers.
a*b = gcd(a,b) * lcm (a, b)

Then

Example: gcd (10,25) = 5, lcm (10,25) = 50

10*25 = 5*50

Example: gcd (95256, 432) = 216, lcm (95256,

432) = 190512

95256*432 = 216*190512

The book calls this Theorem 7

24

Modular arithmetic
If a and b are integers and m is a positive integer, then a is
congruent to b modulo m if m divides a-b

Notation: a b (mod m)

Rephrased: m | a-b

Rephrased: a mod m = b

If they are not congruent: a b (mod m)

Example: Is 17 congruent to 5 modulo 6?

Rephrased: 17 5 (mod 6)

As 6 divides 17-5, they are congruent

Example: Is 24 congruent to 14 modulo 6?

Rephrased: 24 14 (mod 6)
As 6 does not divide 24-14 = 10, they are not congruent
25

More on congruence
Let a and b be integers, and let m be a positive
integer. Then a b (mod m) if and only if a mod
m = b mod m

The book calls this Theorem 8

Example: Is 17 congruent to 5 modulo 6?

Rephrased: does 17 5 (mod 6)?

17 mod 6 = 5 mod 6

Example: Is 24 congruent to 14 modulo 6?

Rephrased: 24 14 (mod 6)
24 mod 6 14 mod 6
26

Even more on congruence

Let m be a positive integer. The integers a
and b are congruent modulo m if and only if
there is an integer k such that a = b + km

The book calls this Theorem 9

Example: 17 and 5 are congruent modulo 6

17 = 5 + 2*6
5 = 17 -2*6
27

Even even more on congruence

Let m be a positive integer. If a b (mod m) and
c d (mod m), then a+c (b+d) (mod m) and
ac bd (mod m)

The book calls this Theorem 10

Example

We know that 7 2 (mod 5) and 11 1 (mod 5)

Thus, 7+11 (2+1) (mod 5), or 18 3 (mod 5)
Thus, 7*11 2*1 (mod 5), or 77 2 (mod 5)
28

Uses of congruences
Hashing functions
aaron@orion:~/ISOs/dvd.39> md5sum debian-31-i386-binary.iso
96c8bba5a784c2f48137c22e99cd5491 debian-31-i386-binary.iso

md5 (file) = <file> mod 2128

Not really this is a simplification

29

Todays demotivators

30

Pseudorandom numbers
Computers
numbers!

cannot

generate

truly

random

Algorithm for random numbers: choose 4

integers

Seed x0: starting value

Modulus m: maximum possible value
Multiplier a: such that 2 a < m
Increment c: between 0 and m

Formula: xn+1 = (axn + c) mod m

31

Pseudorandom numbers
Formula: xn+1 = (axn + c) mod m
Let x0 = 3, m = 9, a = 7, and c = 4
x1 = 7x0+4 = 7*3+4 = 25 mod 9 = 7
x2 = 7x1+4 = 7*7+4 = 53 mod 9 = 8
x3 = 7x2+4 = 7*8+4 = 60 mod 9 = 6
x4 = 7x3+4 = 7*6+4 = 46 mod 9 = 1
x5 = 7x4+4 = 7*1+4 = 46 mod 9 = 2
x6 = 7x5+4 = 7*2+4 = 46 mod 9 = 0
x7 = 7x6+4 = 7*0+4 = 46 mod 9 = 4
x8 = 7x7+4 = 7*4+4 = 46 mod 9 = 5

32

Pseudorandom numbers
Formula: xn+1 = (axn + c) mod m
Let x0 = 3, m = 9, a = 7, and c = 4
This sequence generates:
3, 7, 8, 6, 1, 2, 0, 4, 5, 3 , 7, 8, 6, 1, 2, 0, 4, 5, 3

Note that it repeats!

But it selects all the possible numbers before doing so

The common algorithms today use m = 232-1

You have to choose 4 billion numbers before it repeats

33

The Caesar cipher

Julius Caesar used this to encrypt messages
A function f to encrypt a letter is defined as:
f(p) = (p+3) mod 26

Where p is a letter (0 is A, 1 is B, 25 is Z, etc.)

Decryption: f-1(p) = (p-3) mod 26

This is called a substitution cipher

You are substituting one letter with another

34

The Caesar cipher

Encrypt go cavaliers

Translate to numbers: g = 6, o = 14, etc.

Full sequence: 6, 14, 2, 0, 21, 0, 11, 8, 4, 17, 18

Apply the cipher to each number: f(6) = 9, f(14) = 17, etc.

Full sequence: 9, 17, 5, 3, 24, 3, 14, 11, 7, 20, 21

Convert the numbers back to letters 9 = j, 17 = r, etc.

Full sequence: jr wfdydolhuv

Decrypt jr wfdydolhuv

Translate to numbers: j = 9, r = 17, etc.

Full sequence: 9, 17, 5, 3, 24, 3, 14, 11, 7, 20, 21

Apply the cipher to each number: f-1(9) = 6, f-1(17) = 14, etc.

Full sequence: 6, 14, 2, 0, 21, 0, 11, 8, 4, 17, 18

Convert the numbers back to letters 6 = g, 14 = 0, etc.

Full sequence: go cavaliers
35

Rot13 encoding
A Caesar cipher, but translates letters by 13
instead of 3

Then, apply the same function to decrypt it, as

13+13=26

Rot13 stands for rotate by 13

Example:
aaron@orion:~.4> echo Hello World | rot13
Uryyb Jbeyq
aaron@orion:~.5> echo Uryyb Jbeyq | rot13
Hello World
aaron@orion:~.6>
36

Quick survey

a)
b)
c)
d)

I felt I understood the material in this

slide set
Very well
With some review, Ill be good
Not really
Not at all

37

Quick survey

a)
b)
c)
d)

The pace of the lecture for this

slide set was
Fast
About right
A little slow
Too slow

38

Quick survey

a)
b)
c)
d)

How interesting was the material in

this slide set? Be honest!
Wow! That was SOOOOOO cool!
Somewhat interesting
Rather borting
Zzzzzzzzzzz

39