Lecture_21 - MA1100 Lecture 21 Number Theory Fundamental...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 MA1100 Lecture 21 Number Theory Fundamental Theorem of Arithmetic Number of divisors Infinitude of primes Different types of p rimes Diophantine equations
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
MA1100 Lecture 21 2 How many primes? Proposition There are infinitely many prime numbers. Proof By contradiction Suppose there are only finitely many primes. Let p 1 , p 2 , p 3 , . .., p m be all the primes. Consider the integer M = p 1 p 2 p 3 ...p m + 1 By FTA, M has a prime factorization Also M – 1 = p 1 p 2 p 3 ...p m
Background image of page 2
MA1100 Lecture 21 3 How many primes? • How many prime numbers are there that are congruent to 3 modulo 4 ? • How many prime numbers are there that are congruent to 3 modulo 15 ? If a and b are _____________ , then there are infinitely many prime numbers that are congruent to a modulo b . 3, 7, 11, 19, 23, 31, 43, 47, 59, 67, …
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
MA1100 Lecture 21 4 What is the largest prime?
Background image of page 4
MA1100 Lecture 21 5 Mersenne prime 2 n -1 Marin Mersenne (1588-1648) If a Mersenne number 2 n -1 is a prime, we call it a Mersenne prime . Mersenne stated that, among the numbers 2 n -1 for n < 258, only the following are primes: n = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127 and 257 If 2 n -1 is a prime, then n has to be a prime. Proposition
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 21 6 Fermat prime Pierre de Fermat (1601-1665) What about primes of the form 2 n +1 ? Fermat observed that, 2 2 n + 1 are primes for n = 0 ,1 ,2, 3, 4. If 2 n + 1 is a prime, then n has to be a power of 2. Proposition
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/19/2012 for the course SCIENCE MA1100 taught by Professor Forgot during the Fall '08 term at National University of Singapore.

Page1 / 22

Lecture_21 - MA1100 Lecture 21 Number Theory Fundamental...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online