Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
55 views10 pages

Number Theory Class Notes

The document provides comprehensive class notes on Number Theory, covering definitions, types of numbers, divisibility, prime factorization, GCD, LCM, modular arithmetic, congruences, Diophantine equations, and key theorems. It also discusses special functions, perfect numbers, and applications of number theory in fields like cryptography and computer science. The notes are suitable for high school or early college-level mathematics students.

Uploaded by

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

Number Theory Class Notes

The document provides comprehensive class notes on Number Theory, covering definitions, types of numbers, divisibility, prime factorization, GCD, LCM, modular arithmetic, congruences, Diophantine equations, and key theorems. It also discusses special functions, perfect numbers, and applications of number theory in fields like cryptography and computer science. The notes are suitable for high school or early college-level mathematics students.

Uploaded by

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

Sure!

Here's a well-organized set of class notes on Number Theory, suitable for high school or early college-level mathematics:

Number Theory - Class Notes

1. Introduction to Number Theory


Definition:
Number Theory is a branch of mathematics that deals with the properties and relationships of integers.

2. Types of Numbers

Natural Numbers ( ):1, 2, 3, 4, ...

Whole Numbers: 0, 1, 2, 3, ...


Integers ( ):..., -3, -2, -1, 0, 1, 2, 3, ...

Rational Numbers ( ):Numbers that can be expressed as a fraction a/b

Irrational Numbers: Cannot be expressed as a fraction (e.g., √2, π)

Prime Numbers: Natural numbers greater than 1 with only two factors: 1 and itself (e.g., 2, 3, 5, 7, 11)

Composite Numbers: Natural numbers greater than 1 that are not prime (e.g., 4, 6, 8, 9)

3. Divisibility

Divides: a divides b (written as a | b) if b = a × k for some integer k.


Properties:

If a | b and a | c, then a | (b ± c)

If a | b and b | c, then a | c

4. Prime Factorization

Every integer greater than 1 is either a prime or can be factored into primes uniquely (Fundamental Theorem of Arithmetic).

Example: 60 = 2² × 3 × 5

5. Greatest Common Divisor (GCD)


GCD(a, b): Largest number that divides both a and b.

Euclidean Algorithm:

1.
If b = 0, GCD(a, b) = a

2.
Else, GCD(a, b) = GCD(b, a mod b)

6. Least Common Multiple (LCM)

LCM(a, b): Smallest positive number divisible by both a and b.

Relationship:
LCM(a, b) × GCD(a, b) = a × b
7. Modular Arithmetic

Definition: a b (mod n) means n divides (a − b)

Properties:

If a b (mod n) and c d (mod n), then:

a + c b + d (mod n)

a − c b − d (mod n)

a × c b × d (mod n)
8. Congruences

Linear Congruence: ax b (mod n)

Has a solution if and only if gcd(a, n) divides b.

Solution: Use the Extended Euclidean Algorithm.

9. Diophantine Equations

Equations of the form ax + by = c


Solutions exist if and only if gcd(a, b) divides c

10. Fermat’s Little Theorem

If p is a prime and a is not divisible by p:

a^(p−1) 1 (mod p)

11. Euler’s Theorem

If a and n are coprime:


a^φ(n) 1 (mod n)

φ(n) = Euler’s totient function (number of integers ≤ n that are coprime to n)

12. Special Functions

Euler’s Totient Function φ(n):

If n = p ^e × p ^e × ... × p_k^e_k, then


φ(n) = n × (1 − 1/p )× (1 − 1/p )× ... × (1 − 1/p_k)

13. Perfect, Amicable, and Deficient Numbers


Perfect Number: Equal to the sum of its proper divisors (e.g., 6 = 1 + 2 + 3)

Amicable Numbers: Pair of numbers where each is the sum of the other’s proper divisors (e.g., 220 & 284)

Deficient Number: Sum of proper divisors < number

14. Chinese Remainder Theorem

If n n
, , ...,n_k are pairwise coprime, and
x a (mod n ), ...,x a_k (mod n_k),
then there exists a unique solution mod N = n n ...n_k

15. Applications of Number Theory


Cryptography (e.g., RSA algorithm)

Computer science (hashing, algorithms)

Digital security

Solving puzzles and patterns

Would you like these notes in PDF format or with practice problems and solutions included?

You might also like