Scribd Logo
Upload

Welcome to Scribd!

  • 1.1 Division Algorithm

    Uploaded by

    grayna
    10 views5 pages
    Number theory is the study of numbers and their properties. The division algorithm allows any integer to be divided into a quotient and remainder. The greatest common divisor (GCD) of two integers is the largest positive integer that divides both integers.

    Original Description:

    Discrete mathematics notes

    Original Title

    1.1 division algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Number theory is the study of numbers and their properties. The division algorithm allows any integer to be divided into a quotient and remainder. The greatest common divisor (GCD) of two integers is the largest positive integer that divides both integers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views5 pages

    1.1 Division Algorithm

    Uploaded by

    grayna
    Number theory is the study of numbers and their properties. The division algorithm allows any integer to be divided into a quotient and remainder. The greatest common divisor (GCD) of two integers is the largest positive integer that divides both integers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    1.

    Number theory

    1.1 The division algorithm and greatest common divisors

    Notations

    You might also like