Scribd Logo
Upload

Welcome to Scribd!

  • M226 Factorization

    Uploaded by

    Jade Bong Natuil
    12 views6 pages
    The document discusses shortest routes in a rectangular grid. It defines a lattice point as a point with integer coordinates in the x-y plane. It describes a rectangular grid with (m+1)×(n+1) lattice points and finds the shortest route from the point (0,0) to the point (m,n), where m and n are natural numbers. It also includes an example and theorem about associates in rings.

    Original Description:

    report

    Original Title

    M226_Factorization

    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
    The document discusses shortest routes in a rectangular grid. It defines a lattice point as a point with integer coordinates in the x-y plane. It describes a rectangular grid with (m+1)×(n+1) lattice points and finds the shortest route from the point (0,0) to the point (m,n), where m and n are natural numbers. It also includes an example and theorem about associates in rings.

    Copyright:

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

    M226 Factorization

    Uploaded by

    Jade Bong Natuil
    The document discusses shortest routes in a rectangular grid. It defines a lattice point as a point with integer coordinates in the x-y plane. It describes a rectangular grid with (m+1)×(n+1) lattice points and finds the shortest route from the point (0,0) to the point (m,n), where m and n are natural numbers. It also includes an example and theorem about associates in rings.

    Copyright:

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

    Combinatorics

    Jade Bong M. Natuil

    January 29, 2021

    Jade Bong M. Natuil January 29, 2021 1 / 2


    Shortest Routes in Rectangular Grid

    A point (a, b) in the x − y plane is called a lattice point if both a and b


    are integers.The figure below shows a rectangular grid in the z − y
    plane consisting of (m + 1)x(n + 1) lattice points, and a shortest route
    from the lattice point (0, 0) to the lattice point (m, n), where m, n ∈ N

    Jade Bong M. Natuil January 29, 2021 2 / 2


    Shortest Routes in Rectangular Grid

    A point (a, b) in the x − y plane is called a lattice point if both a and b


    are integers.The figure below shows a rectangular grid in the z − y
    plane consisting of (m + 1)x(n + 1) lattice points, and a shortest route
    from the lattice point (0, 0) to the lattice point (m, n), where m, n ∈ N

    Jade Bong M. Natuil January 29, 2021 2 / 2


    Shortest Routes in Rectangular Grid

    A point (a, b) in the x − y plane is called a lattice point if both a and b


    are integers.The figure below shows a rectangular grid in the z − y
    plane consisting of (m + 1)x(n + 1) lattice points, and a shortest route
    from the lattice point (0, 0) to the lattice point (m, n), where m, n ∈ N

    Example: 2 and −2 are associates in Z.


    Theorem 3.2
    Let a, b and u be elements of a commutative ring R with identity.

    Jade Bong M. Natuil January 29, 2021 2 / 2


    Shortest Routes in Rectangular Grid

    A point (a, b) in the x − y plane is called a lattice point if both a and b


    are integers.The figure below shows a rectangular grid in the z − y
    plane consisting of (m + 1)x(n + 1) lattice points, and a shortest route
    from the lattice point (0, 0) to the lattice point (m, n), where m, n ∈ N

    Example: 2 and −2 are associates in Z.


    Theorem 3.2
    Let a, b and u be elements of a commutative ring R with identity.
    (1) a|b ⇔ hbi ⊆ hai

    Jade Bong M. Natuil January 29, 2021 2 / 2


    Shortest Routes in Rectangular Grid

    A point (a, b) in the x − y plane is called a lattice point if both a and b


    are integers.The figure below shows a rectangular grid in the z − y
    plane consisting of (m + 1)x(n + 1) lattice points, and a shortest route
    from the lattice point (0, 0) to the lattice point (m, n), where m, n ∈ N

    Example: 2 and −2 are associates in Z.


    Theorem 3.2
    Let a, b and u be elements of a commutative ring R with identity.
    (1) a|b ⇔ hbi ⊆ hai
    (2) a and b are associates ⇔ hbi = hai

    Jade Bong M. Natuil January 29, 2021 2 / 2

    You might also like