Scribd Logo
Upload

Welcome to Scribd!

  • BC180202805 - MTH202 - Assignment 2

    Uploaded by

    zeeshan shoukat
    38 views1 page
    This document contains two math questions from an assignment. Question 1 asks to prove an equation using mathematical induction. Question 2 asks to use the Euclidean algorithm to find the greatest common divisor (GCD) of 1701 and 3768. The answer provided divides the larger number by the smaller repeatedly until getting a remainder of 0, determining the GCD is 3.

    Original Description:

    Original Title

    BC180202805 _ MTH202 _ Assignment 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains two math questions from an assignment. Question 1 asks to prove an equation using mathematical induction. Question 2 asks to use the Euclidean algorithm to find the greatest common divisor (GCD) of 1701 and 3768. The answer provided divides the larger number by the smaller repeatedly until getting a remainder of 0, determining the GCD is 3.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    38 views1 page

    BC180202805 - MTH202 - Assignment 2

    Uploaded by

    zeeshan shoukat
    This document contains two math questions from an assignment. Question 1 asks to prove an equation using mathematical induction. Question 2 asks to use the Euclidean algorithm to find the greatest common divisor (GCD) of 1701 and 3768. The answer provided divides the larger number by the smaller repeatedly until getting a remainder of 0, determining the GCD is 3.

    Copyright:

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

    MTH202 _ Assignment 2

    BC180202805

    Question No 1:

    Prove the following by using the principal of mathematical induction: 111 1 .............................. 1 3 3 5 5
    7 (2 n 1)(2 n 1) 2 n 1 n +++ = ××× − + + , for all integers n ≥1

    Question No 2:

    Use the Euclidean algorithm to find GCD (1701, 3768)

    Answer:

    Dividing 3768 by 1701: 3768 = 1701 * 2 + 366


    Dividing 1701 by 366: 3768 = 366 * 4 + 237
    Dividing 366 by 237: 3768 = 237 * 1 + 129
    Dividing 237 by 129: 3768 = 129 * 1 + 108
    Dividing 129 by 108: 3768 = 108 * 1 + 21
    Dividing 108 by 21: 3768 = 21 * 5 + 3
    Dividing 21 by 3: 3768 = 3 * 7 + 0

    Hence GCD (1701, 3768) = 3

    You might also like