Unformatted text preview:

Integers and prime numbers Basic notation Let IN denote the set of natural numbers 1 2 3 and let ZZ denote the set of all integers 2 1 0 1 2 Definitions For two integers a b it is said that a divides b and denoted by a b if b ac for some integer c Then a is a divisor or factor of b A natural number p 1 is prime if 1 and p are its only positive divisors A natural number n 1 that is not prime is said to be composite Theorem Euclid There are infinitely many prime numbers Further definitions If a and b are integers that are not both zero their greatest common divisor denoted by a b is the largest natural number that divides both a and b If a b 1 then a and b are said to be relatively prime The least common multiple of a and b denoted by LCM a b is the smallest natural number that is divisible by both a and b The notions of the greatest common divisor and the least common multiple generalize to finite collections of integers Euclidean algorithm If a b a b IN and a b yields the quotient q and remainder r a r q b b 0 r b then a b b r Corollary Let a and b be integers not both zero Then xa yb x y ZZ is the set of all integral multiples of a b Euclid s lemma If a bc and a b 1 then a c Fundamental theorem of arithmetic Every natural number exceeding 1 can be written uniquely up to the order of factors as the product of primes Legendre s theorem The exponent ep n of a prime p in the prime factorization of n is ep n X r 1 b n c pr where bxc denotes the biggest integer not exceeding x Euler s totient function theorem For a natural number n k IN k n k n 1 n n Y p prime p n 1 1 1 p Prime number theorem Chebyshev improved by Hadamard and de la Valle e Poussin Let x denote the number of primes not exceeding x Then there exist positive constants A and B such that x x x B A ln x ln x Examples 1 Find all primes p such that 17p 1 is a perfect square 2 For any two natural numbers a and b prove that 2a 1 2b 1 2 a b 1 3 Find a six digit number that is increased by a factor of 6 if one exchanges as a block its first and last three digits 4 Find the number of terminal zeros in the decimal expansion of 1000 5 Prove that 2n n divides LCM 1 2 2n Here as usual n n k k n k 6 Prove that the product of any n consecutive integers is divisible by n 7 Prove that for n 1 the nth harmonic number Hn 1 1 1 1 2 3 n is not an integer 2


View Full Document

Berkeley COMPSCI C191 - Integers and prime numbers

Documents in this Course
Oracles

Oracles

12 pages

Load more
Loading Unlocking...
Login

Join to view Integers and prime numbers and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Integers and prime numbers and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?