Scribd Logo
Upload

Welcome to Scribd!

  • 19 views

    NUMBER THEORY Handout

    Uploaded by

    zanderhero30

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    NUMBER THEORY Handout

    Uploaded by

    zanderhero30
    19 views3 pages

    Original Title

    NUMBER-THEORY-handout

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    19 views3 pages

    NUMBER THEORY Handout

    Uploaded by

    zanderhero30

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    MAJORSHIP MENTORSHIP

    - MATHEMATICS –
    Prepared by: tcsantos

    Number Theory
    Topics:

    A. Prime and Composite


    B. Congruence
    C. Wilson’s and Fermat’s Theorem
    D. Euler’s Phi Function

    Prime Number
    is a positive integer greater than 1 and the only 2 factors are 1 and itself.

    Composite Number
    is a positive integer with more than two factors.

    CONGRUENCE

    Congruence relation is introduced and developed by the German mathematician Karl


    Friedrich Gauss

    The congruence relation shares many interesting properties with the equality relation.
    The congruence symbol ≡ , invented by Gauss around 1800, parallels the equality
    symbol =. The congruence symbol facilitates the study of divisibility theory.

    Congruence Modulo m

    o Let m be a positive integer. Then an integer a is congruent to an integer b


    modulo m if m|(a − b). For example, 5|(23 − 3) .

    o In symbols, we then write a ≡ b (mod m); m is the modulus of the congruence


    relation.
    For example, 23 ≡ 3 (mod 5)
    *This also means that when 23 is divided by 5 the remainder is 3.

    o If a is not congruent to b modulo m, then a is incongruent to b modulo m;


    we then write a ≢ b (mod m).

    For example: Since 4 ∤ (20 − 3), then 20 ≢ 3 (mod 4).


    Theorem on congruence

    a ≡ b (mod m) if and only if a = b + km for some integer k.

    Example:
    23 ≡ 3 (mod 5) and 23 = 3 + 4 · 5;
    on the other hand, 49 = −5 +9 · 6, so 49 ≡ −5 (mod 6).

    Properties of Congruence

    • a ≡ a (mod m). (Reflexive property)


    • If a ≡ b (mod m), then b ≡ a (mod m). (Symmetric property)
    • If a ≡ b (mod m) and b ≡ c (mod m), then a ≡ c (mod m). (Transitive property)

    If a ≡ b (mod m) and c is any integer, then

    • a + c ≡ b + c (mod m)
    • a − c ≡ b − c (mod m)
    • ac ≡ bc (mod m)

    an ≡ bn (mod m), n is any positive integer

    Relatively Prime
    Two integers are relatively prime if they share no common positive factors except 1.
    Example: 4 and 9

    Try these!
    1. Identify if prime or composite. What is 12 mod 4?
    a. 2 Ans: 0 , because 12 ÷3 = 4 remainder
    b. 7 0
    c. 95
    d. 33 What is 12 mod 7?
    Ans: 5 , because 12 ÷7 = 1
    2. Which of the following pair/pairs are remainder 5
    relatively prime?
    a. 6 and 8
    b. 9 and 13 *look forTry
    thethese!
    remainder
    c. 3 and 8
    3. What is 10 mod 5?
    d. 2 and 7
    4. What is 9 mod 3?
    Wilson’s Theorem
    If p is a prime, then (p-1) ! ≡ -1 (mod p)
    Example:
    (148) ! ≡ -1 (mod 149)

    Fermat’ s Little Theorem

    Type equation
    • If p here.
    is a prime and p ∤ 𝑎, then 𝑎𝑝−1 ≡ 1 (𝑚𝑜𝑑 𝑝)
    Example:
    210 ≡ 1 (𝑚𝑜𝑑 11)
    *This also means that when 210 is divided by 11 the remainder is 1.

    Fermat’ s Second Theorem

    • If p is a prime and a is any positive integer, then 𝑎𝑝 ≡ 𝑎 (𝑚𝑜𝑑 𝑝)

    Example:
    17
    5 ≡ 5 (𝑚𝑜𝑑 17)
    *This also means that when 517 is divided by 17 the remainder is 5.

    Euler’s Phi- Function


    Denoted by 𝚽(𝐧)
    The Euler’s phi function of n is the number of positive integers ≤ 𝑛 that are
    relatively prime to n, where n is a positive integer.
    If n is prime, then 𝚽(𝐧) = 𝐧 − 𝟏

    Example:

    Φ(2) = 1
    Φ (4 ) = 2

    Try these!
    1. What is the remainder when 36 is divided by 7?
    2. What is the remainder when 511 is divided by 11?
    3. What is Φ(6)?

    “Numbers rule the universe”


    - Pythagoras

    You might also like