Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 114 views

    Notes For Abstract Algebra

    Uploaded by

    Sankalp Chauhan
    1) The well ordering principle states that any non-empty set of positive integers contains a smallest element. 2) A number t is a divisor of s if t divides s evenly, with no remainder. This is written as t|s. 3) The division algorithm states that for any integers a and b, where b is not 0, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. 4) A number is prime if it is greater than 1 and its only divisors are 1 and itself. The greatest common divisor (GCD) of two numbers is the largest integer that divides both numbers.

    Copyright:

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

    Notes For Abstract Algebra

    Uploaded by

    Sankalp Chauhan
    114 views2 pages
    1) The well ordering principle states that any non-empty set of positive integers contains a smallest element. 2) A number t is a divisor of s if t divides s evenly, with no remainder. This is written as t|s. 3) The division algorithm states that for any integers a and b, where b is not 0, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. 4) A number is prime if it is greater than 1 and its only divisors are 1 and itself. The greatest common divisor (GCD) of two numbers is the largest integer that divides both numbers.

    Original Description:

    These notes describe a first week abstract algebra course

    Original Title

    Notes for abstract algebra

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The well ordering principle states that any non-empty set of positive integers contains a smallest element. 2) A number t is a divisor of s if t divides s evenly, with no remainder. This is written as t|s. 3) The division algorithm states that for any integers a and b, where b is not 0, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. 4) A number is prime if it is greater than 1 and its only divisors are 1 and itself. The greatest common divisor (GCD) of two numbers is the largest integer that divides both numbers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    114 views2 pages

    Notes For Abstract Algebra

    Uploaded by

    Sankalp Chauhan
    1) The well ordering principle states that any non-empty set of positive integers contains a smallest element. 2) A number t is a divisor of s if t divides s evenly, with no remainder. This is written as t|s. 3) The division algorithm states that for any integers a and b, where b is not 0, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. 4) A number is prime if it is greater than 1 and its only divisors are 1 and itself. The greatest common divisor (GCD) of two numbers is the largest integer that divides both numbers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    Sonny Chauhan

    RPI

    Abstract Algebra notes (week 1):

    Well ordering Principle:

    Every nonempty set of positive integers contains a smallest number, member.

    Divisor:

    is when a number is divisible by another number. When we divide the numbers we get remainder 0. For
    example a nonzero integer t is a divisor of the integer s if t is divisible by s. That means there exists an
    integer u such that s=tu. We write t|s also known as (“t divides s”).

    Division Algorithm:

    Let b>0 and a and b be integers. There has to exist integers q and r where r is greater than or equal to 0
    and less than b such that a=bq+r. In this case a is the dividend, b is the divisor, q is the quotient and R is
    the remainder.

    For example: 345/8= 43 remainder 1. Thus by the division algorithm I get 345= 8 * 43 + 1.

    In order to write x is not divisible by y, I write: x y ( also known as x does not divide y)

    If x is divisible by y, I write: x | y.

    An integer is prime if it is greater than 1 and its only divisors are 1 and itself.

    Example: 13 is prime since its only divisors are 13 and 1.

    The only even number that is prime is 2.

    Two numbers are relatively prime if the gcd of them equals 1. For example a and b are relatively prime if
    gcd(a,b) = 1.

    The greatest common divisor (gcd) or greatest common factor (gcf) of two numbers like a and b, is the
    greatest number that is divisible by both a and b.

    Let a and b as integers, then the gcd(a,b) can be written as as+bt. Moreover gcd(a,b) is the smallest
    positive integer of the form as+bt.

    For example: Find integers s and t such that gcd(662,414)= 662s+414t.

    By the Euclidean algorithm, I can find the gcd of 662 and 414. First I divide 662 by 414 and I get 1
    remainder 248.

    Thus: 662 = 414(1) + 248


    Then I divide the other number by the remainder. In this case I divide 414 by 248 and get 1 remainder
    166

    414 = 248(1) + 166

    And the process continues, I divide 248 by 166 to get:

    248 = 166(1) + 82

    I divide 166 by 82 to get:

    166 = 82(2) + 2

    I divide 82 by 2 to get:

    82 = 2(41) + 0

    When we get remainder of 0 our gcd is the second to last remainder before the 0 in this case 2. Thus
    gcd(662,414) = 2.

    In order to get the values of s and t, I have to work backwards,

    I get:

    2 = 166 – 82(2)

    82 = 248- 166(1)

    166 = 414 – 248(1)

    248 = 662- 414(1)

    Thus:

    2 = (166-82(2))= (166- (248-166)(2)) = (166-2(248-166)) = (3(166) -2(248)) = (3(414-248(1))-2(248)) =


    3(414) -3(248)-2(248)= 3(414)-2(248) = 3(414) -2(662-414(1)) = 3(414) + 2(414) -2(662) = 5(414) -2(662)

    Thus s=-2 and t=5.

    You might also like