Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
29 views

Analytic Number Theory: DR Mohib Ali

This document summarizes key concepts from a lecture on analytic number theory: 1) It reviewed divisibility, the greatest common divisor (GCD) and its properties, the division algorithm, and the relation between GCD and the least common multiple (LCM) of two numbers. 2) It defined prime numbers and composite numbers, proved properties of primes, and presented the Fundamental Theorem of Arithmetic stating that every integer can be written as a unique product of prime factors. 3) It proved that there are infinitely many prime numbers, and provided exercises for students to practice the concepts from the lecture.

Uploaded by

edieali
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views

Analytic Number Theory: DR Mohib Ali

This document summarizes key concepts from a lecture on analytic number theory: 1) It reviewed divisibility, the greatest common divisor (GCD) and its properties, the division algorithm, and the relation between GCD and the least common multiple (LCM) of two numbers. 2) It defined prime numbers and composite numbers, proved properties of primes, and presented the Fundamental Theorem of Arithmetic stating that every integer can be written as a unique product of prime factors. 3) It proved that there are infinitely many prime numbers, and provided exercises for students to practice the concepts from the lecture.

Uploaded by

edieali
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Analytic Number Theory

MTH 435

Dr Mohib Ali
Review of Lecture 1

 Divisibility

 Properties of Divisibility

 Division Algorithm

 G.C.D and its properties

 G.C.D and Linear Combination


Least Common Multiple

•Definition(l.c.m):
  The smallest positive integer which is multiple of two
numbers and is called the lease common multiple of and and is denoted by .

Example:

Now we will discuss a relation between g.c.d and l.c.m.


G.C.D and L.C.M

•Theorem
  : For any two positive numbers and .

Proof:
G.C.D and L.C.M
G.C.D and L.C.M

With the help of the equation in previous result we can find l.cm if we can
calculate the g.c.d of two given numbers.

Example:
Prime Numbers

•Defintion:
  A prime number is an integer that has no positive divisors other that
and itself. An integer which is not prime is called a composite number.

Examples:
Characterization of Prime numbers

•Theorem:
  If is prime and , then either or .

Proof:
Fundamental Theorem of Arithmetic

•Examples:
  Write down the decomposition of .
Fundamental Theorem of Arithmetics

•Theorem:
  Every integer is product of primes. The representation in to product
of primes is unique up to order of factors.

Proof:
Fundamental Theorem of Arithmetics
Fundamental Theorem of Arithmetics
How many primes exists ?

The following proof is given by Euclid.

Theorem: There exist infinitely many primes.

Proof:
Excercises
Excercises
Review of Lecture 2

 L.C.M and G.C.D relation

 Prime Numbers

 Fundamental Theorem of Arithmetic

 Exercises

You might also like