Skip to main content
\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)
Mathematics LibreTexts

4.E: Exercises

  • Page ID
    7558
  •  

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    Exercise \(\PageIndex{1}\):

    Find the GCD of:

    1. 10 and 75
    2. 48 and 360

    Find the LCM of:

    1. 24 and 35
    2. 56 and 72

    Exercise \(\PageIndex{2}\):

    Using GCD determine how many packages of hotdogs and hotdog buns are needed to have an equal amount if the hotdog package contains 10 hotdogs, and the hotdog bun package contains 12 buns.

    Exercise \(\PageIndex{3}\):

    Using Euclidean Algorithm, find the gcd of 1716 and 1260, and the LCM of 1716 and 1260.

    Exercise \(\PageIndex{4}\):

    1.  Use the Euclidean algorithm to find \(\gcd (270, 504).\).  Find integers \(x\) and \(y\) such that $$\gcd (270, 504) =270 x+504 y.$$
    2.  Use the Euclidean algorithm to find \(\gcd (-270, 504).\), Find integers \(x\) and \(y\) such that $$\gcd (-270, 504) =-270 x+504 y.$$

    Exercise \(\PageIndex{5}\):

    Suppose \(a\) and \(b\) are relatively prime integers and \(c\) is an integer such that \(a|c\) and \(b|c.\)  Prove that \(ab|c.\)

    Exercise \(\PageIndex{6}\):

    Suppose \(a\) and \(b\) are relatively prime integers and \(c\) is an integer such that \(a|bc\).  Prove that \(a|c.\)

    Exercise \(\PageIndex{7}\):

    1.   Let \(a\) and \(b\) be non-zero integers with least common multiple \(l\).  Let \(m\) be any common multiple of \(a\) and \(b\).  Prove that \(l|m.\)
    2.   Prove that if \(a, b\) and \(c\) are natural numbers,  \(\gcd(a, c)=1\)and  \(b \mid c\), then \(\gcd(a, b)=1\).
    3.   Suppose \(a\) and \(c\) are relatively prime integers and \(b\) is an integer such that  \(b|c.\)  Prove that \(gcd(a, b)=1.\)

    Exercise \(\PageIndex{8}\):

    Prove that for any positive integer \(k\), \(7k+5\) and \(4k+3\) are relatively prime.