Scribd Logo
Upload

Welcome to Scribd!

  • Solution mth202 2fall

    Uploaded by

    faseelhaiderbajwa
    6 views3 pages
    The document is an assignment for a discrete mathematics course. It contains two questions, the first asking to prove an equation using mathematical induction and the second asking to find the greatest common divisor (GCD) of 2740 and 1760 using the Euclidean algorithm. The summary provides step-by-step working to find the GCD is 20.

    Original Description:

    Original Title

    solution mth202 2fall

    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 is an assignment for a discrete mathematics course. It contains two questions, the first asking to prove an equation using mathematical induction and the second asking to find the greatest common divisor (GCD) of 2740 and 1760 using the Euclidean algorithm. The summary provides step-by-step working to find the GCD is 20.

    Copyright:

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

    Solution mth202 2fall

    Uploaded by

    faseelhaiderbajwa
    The document is an assignment for a discrete mathematics course. It contains two questions, the first asking to prove an equation using mathematical induction and the second asking to find the greatest common divisor (GCD) of 2740 and 1760 using the Euclidean algorithm. The summary provides step-by-step working to find the GCD is 20.

    Copyright:

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

    VuID: Bc210405511

    Fall 2023
    Discrete Mathematics
    Assignment No. 2
    Section Incharge: Muhammad Nadeem
    Due date: 12th January, 2024

    Question 2: Marks=05

    What is the GCD of 2740 and 1760 using the Euclidean algorithm?

    Answer:

    20 is the GCD of (2740,1760)

    Step-by-step explanation:

    Euclidean algorithm for GCD

    GCD (a , b) ; a ≥ b > 0

    a = 2740

    b = 1760

    Euclid's formula;

    A = b(q) + r ; [q = quotient and r = remainder]

    2740 = 1760 (1) + 980

    again by taking a = 1760 and b = 980

    1760 = 980 (1) + 780

    similarly, we have to continue till we get r as 0

    980 = 780(1) + 200

    780 = 200 (3) + 180

    200 = 180(1) + 20

    180 = 20 (9) + 0

    Now as the r = 0 ,
    ∴ 20 is the GCD of (2740,1760)

    Question 1:
    Marks=05
    Show that 𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + 𝑎𝑟 3 + ⋯ + 𝑎𝑟 𝑛−1 = 𝑎 ,𝑟 ≠ 1 by using
    Principle of Mathematical Induction.
    Answer:

    You might also like