lecture-Number theory

NUMBER THEORY
Chapter no 4
1
Number theory
0.Numer system
1.Divisors
2.Prime Factorization
3.Congruence
4.Modular Arithmetic
2
Numbers
Complex
no.
Real no.
Rational
Irrationals
p/q
3
Numbers
Rational
Non-
Integers
Integers
Z+ 0 Z-
4
Rational no.
 r is rational iff there exist a and b s.t
 r= a/b , b is not 0
 What about next no.s….?
 0.281 Rational
 1 Rational
 -1 Rational
 0 Rational
 2 Rational
 2/0 Not Defined
 22/7 Irrational
 10/3 Rational
 0.121212…? (Recurrent decimal)
5
Proof of 0.121212…is rational
 Let x= 0.121212…
 Then 100 x = 12.121212…
 Thus 100x –x =
 12.121212…-0.121212…=12
 Also 100x –x =99x =12
 x =12/99
 Exc.4.2 solve 0.373737….?
6
Rational no.
 Every integer is a rational no.

 The sum of two rational numbers is rational
 r+r
 The double of a rational numbers is rational
 2r =r+r
 The sum of any rational and irrational no. is
irrational and true for *,/

 Sqrt (2) is irrational
7
Even and Odd numbers
 n is Even iff there exist integer k s.t. n = 2k
 n isOdd iff there exist integer k s.t. n = 2k
+1
 What about next no.s…..?
 0 Even
 2 Even
 1 odd
 -301 odd
 6ab even
 10a+8b+1 odd
8
Even and Odd numbers
 Every integer is either even or odd
 The sum of two even integers is even
 IF n2 is even then n is even
 Parity of an integer is even or odd

 Two consecutive no.s have opposite parity
 1,2,3,4,5,6,7……..
9
Prime no.
 Any integer p >1 is called prime no. if
+1,-1 and +p,-p are its only divisors
 E.g. 2,3,5,11,……
 An integer which is not prime is called a
 Composite Number
 4,6,9……
 1 is neither prime nor composite
 2 is the only even prime no.
10
4.3.
Divisors
 If n and d are integers and d not= 0 then

 n is divisible by d iff n equals d times
some integer n = d .k ( k is an integer)

 Or we can say
 d I n=k
 d divides n
 n is a multiple of d
 d is a factor of n
 d is a divisor of n
11
Divisors
 6 is divisible by 3
 6 = 3.2 ( k is an integer)
 Or we can say
 3 I 6 =2
 3 divides 6
 6 is a multiple of 3
 3 is a factor of 6
 3 is a divisor of 6
12
4.3.Divisors
 Any no. k divides 0 (k not = 0)
 0=k.0
 If a/b then a<=b
 If a/b then a/-b
 If a/b and a/c then a/b+c
 Let a=3 ,b=6, c=9
 And verify…?
13
Examples.
 Divisors of 1 are +1.-1
 Is 21 divisible by 3…?
 Does 5 divides 40 ?
 Does 7/42 ?
 Is 32 a multiple of -16 ?
 Is 6 a factor of 36 ?
 Is 7 a factor of -7?
 Yes to all above
14
4.4.Divisors
Quotient Remainder Theorem 4.1.1.
Let n and d  1 be integers. There exist uniquely
determined integers q and r such that
n = qd + r and 0  r < d.
n div d = quotient=q
n mod d = remainder =r
2\7 ?
7 div 2 =3
7 mod 2 =1
7= 3.2+1
15
1.Divisors
Reflexivity
(i) n|n for every n.(every no. divides itself)
Anti-Symmetric
(iii) If d|n and n|d, then d = ±n.
Transitivity
(ii) If d|m and m|n, then d|n.
 If a\b and b\c then a\c

 e.g. if 2\4, 4\8 then 2\8
16
Greatest common divisor
Common divisor
Given positive integers m and n, an integer d is called a
common divisor of m and n if d|m and d|n.
If m and n are integers, not both zero, we say that d is the
Greatest common divisor of m and n, and write
d = gcd(m, n),
if the following three conditions are satisfied:
(i) d  1. (ii) d|m and d|n.
(iii) If k|m and k|n, then k|d. and k<=d
17
 Examples:-
 gcd(72,63) ?
 72= 9.8 =3.3.2.2.2
 63 = 9.7 =3.3.7
 Common divisor =3
 gcd(72,63) =3.3= 9
 No integer larger than 9 divides both 72 and
63.
18
Relatively prime
Two integers m and n are called relatively
prime if gcd(m, n) = 1.
Hence 12 and 35 are relatively prime (no common factor),
But gcd(12, 15) = 3 are not.
Note that 1 is relatively prime to every integer m.
Recall that an integer p is called a prime if:

 (i) p  2.
 (ii) The only positive divisors of p are 1 and p.
19
2.Prime Factorization
 Theorem 2. 1. Euclid’s Lemma. Let p denote a
prime.
(i) If p|mn where m, n ∈ Z, then either p|m or p|n.
(ii) If p|m1m2 · · ·mr where each mi ∈ Z, then p|mi for
some i.
2/6
Where 6=3*2*1
So actually 2/2
20
2.Prime Factorization
 Theorem 2.3. Prime Factorization Theorem. Every
integer n  2 can be written as a product of (one or more)
primes. Moreover, this factorization is unique except for
the order of the factors. Or
 Any integer n>=1 is divisible by a prime no.
 e.g.
 2=2*1
 3=3*1
 4=2*2*1
 5=5*1
 6=3*2*1
21
Unique factorization of
primes
 It follows that every integer n  2 can be written in the form
 n = p1n1 p2n2 · · · prnr ,
 where p1, p2, . . . , pr are distinct primes, ni  1 for each i, and
the pi and ni are determined uniquely by n.
 Example
 3,300 =100. 33
 =4.25.3.11
 =2.2.5.5.3.11
2 1 2 1

2 3 5 11
 =
22
3.Congruences
 Definition 3.1.. If m  0 is fixed, then integers a and b
are congruent modulo m, denoted by
 a  b (mod m)
if m  (a – b ). i.e.(m divides a-b)

Usually, one assumes that the modulus
m >1
23
3.Congruences
 Congruence is an equivalence relation.
 If m > 0 is a fixed integer, then for all integers a, b, c,
(i) a  a (mod m);

(ii) if a  b (mod m), then b  a (mod m);
(iii) if a  b (mod m) and b  c (mod m),
then a  c (mod m).
Prove it…?
24
3.Congruences
 Proposition Let m > 0 be a fixed integer.
(i) If a = qm + r , then a  r (mod m).
 Proof:-
 If a = qm + r
 then a - r = mq
 or m \ a - r = q
 so a  r (mod m).
25
3.Congruences
 Let m > 0 be a fixed integer.
 The following statements are all equivalent
 a  b (mod m).
 a = b + km
 m / a –b
 a (mod m).= b (mod m).
 a and b have same remainder (non-negative) after dividing
by m
 let 26  2 (mod 4) anprove
26
Modular Arithmetic
 If m >1 is a fixed integer, then for all integers a, b, c,d,
 if a  c (mod m) and b  d (mod m) then
(i) a+b  c+d (mod m);

(ii) a -b  c-d (mod m)
(iii) a*b  c*d (mod m)
(iv)
n n

a  c (mod
Prove by examples
m )
27
Prove by examples (P #483)
 if 55  3 (mod 4) and 26  2 (mod 4) then

Prove ?
(i) a+b  c+d (mod m);
(ii) a -b  c-d (mod m)
(iii) a*b  c*d (mod m)
Let n=2 and prove
n n
a c (mod m)
28

lecture-Number theory

Uploaded by

Copyright:

Available Formats

lecture-Number theory

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

lecture-Number theory

Uploaded by

Copyright:

Available Formats

NUMBER THEORY

 Every integer is a rational no.

irrational and true for *,/

 Parity of an integer is even or odd

 If n and d are integers and d not= 0 then

some integer n = d .k ( k is an integer)

 If a\b and b\c then a\c

Note that 1 is relatively prime to every integer m.

Recall that an integer p is called a prime if:

if m  (a – b ). i.e.(m divides a-b)

(i) a  a (mod m);

(i) a+b  c+d (mod m);

 if 55  3 (mod 4) and 26  2 (mod 4) then

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.