Scribd
Upload
4 views10 pages

Number Theory

The document introduces number theory, focusing on integers and their properties, including divisibility, greatest common divisors, least common multiples, and modular arithmetic. It explains key concepts such as prime and composite numbers, the fundamental theorem of arithmetic, and the division algorithm with examples. The document serves as a foundational overview for understanding basic number theory principles.

Uploaded by

asranisaira
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views10 pages

Number Theory

The document introduces number theory, focusing on integers and their properties, including divisibility, greatest common divisors, least common multiples, and modular arithmetic. It explains key concepts such as prime and composite numbers, the fundamental theorem of arithmetic, and the division algorithm with examples. The document serves as a foundational overview for understanding basic number theory principles.

Uploaded by

asranisaira
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Holdiay homework :

Number Theory

By Saira Asrani 9th C

Fall 2002 1
Introduction to Number Theory

Number theory is about integers and their


properties.

We will start with the basic principles of


• divisibility,
• greatest common divisors,
• least common multiples, and
• modular arithmetic

and look at some relevant algorithms.


Fall 2002 2
Division
If a and b are integers with a  0, we say that
a divides b if there is an integer c so that b =
ac.

When a divides b we say that a is a factor of b


and that b is a multiple of a.

The notation a | b means that a divides b.

We write a X b when a does not divide b


(see book for correct symbol).
Fall 2002 3
Divisibility Theorems
For integers a, b, and c it is true that

• if a | b and a | c, then a | (b + c)
Example: 3 | 6 and 3 | 9, so 3 | 15.

• if a | b, then a | bc for all integers c


Example: 5 | 10, so 5 | 20, 5 | 30, 5 | 40, …

• if a | b and b | c, then a | c
Example: 4 | 8 and 8 | 24, so 4 | 24.

Fall 2002 4
Primes
A positive integer p greater than 1 is called
prime if the only positive factors of p are 1 and
p.

A positive integer that is greater than 1 and is


not prime is called composite.

The fundamental theorem of arithmetic:


Every positive integer can be written uniquely
as the product of primes, where the prime
factors are written in order of increasing size.
Fall 2002 5
Primes
Examples:
15 = 3·5
48 = 2·2·2·2·3 = 24·3
17 = 17
100 2·2·5·5 = 22·52
=
512 2·2·2·2·2·2·2·2·2 = 29
=
515 5·103
=
28 = 2·2·7
Fall 2002 6
Primes

If n is a composite integer, then n has a prime


divisor less than or equal n .

This is easy to see: if n is a composite integer,


it must have two prime divisors p1 and p2
such that p1p2 = n.

p1 and p2 cannot both be greater than


n
, because then p1p2 > n.

Fall 2002 7
The Division Algorithm
Let a be an integer and d a positive integer.
Then there are unique integers q and r, with
0  r < d, such that a = dq + r.

In the above equation,


• d is called the divisor,
• a is called the dividend,
• q is called the quotient, and
• r is called the remainder.

Fall 2002 8
The Division Algorithm
Example:

When we divide 17 by 5, we have

17 = 53 + 2.

• 17 is the dividend,
• 5 is the divisor,
• 3 is called the quotient, and
• 2 is called the remainder.

Fall 2002 9
The Division Algorithm
Another example:
What happens when we divide -11 by 3 ?
Note that the remainder cannot be negative.
-11 = 3(-4) + 1.

• -11 is the dividend,


• 3 is the divisor,
• -4 is called the quotient, and
• 1 is called the remainder.

Fall 2002 10

You might also like