Scribd Logo
Upload

Welcome to Scribd!

  • TEST 6. Mathematical Induction 1 (2020)

    Uploaded by

    Junghoon Lee
    14 views5 pages
    This document contains a mathematical induction test with 3 problems. Problem 1 asks to prove that 3^2n + 7 is divisible by 8 for any positive integer n. Problem 2(a) asks to prove an equation involving sums and powers of 2 using induction, and part (b) asks to confirm the statement is true for n=3. Problem 3 asks to prove an inequality involving powers and sums using induction, for integers n greater than or equal to 2.

    Original Description:

    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
    This document contains a mathematical induction test with 3 problems. Problem 1 asks to prove that 3^2n + 7 is divisible by 8 for any positive integer n. Problem 2(a) asks to prove an equation involving sums and powers of 2 using induction, and part (b) asks to confirm the statement is true for n=3. Problem 3 asks to prove an inequality involving powers and sums using induction, for integers n greater than or equal to 2.

    Copyright:

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

    TEST 6. Mathematical Induction 1 (2020)

    Uploaded by

    Junghoon Lee
    This document contains a mathematical induction test with 3 problems. Problem 1 asks to prove that 3^2n + 7 is divisible by 8 for any positive integer n. Problem 2(a) asks to prove an equation involving sums and powers of 2 using induction, and part (b) asks to confirm the statement is true for n=3. Problem 3 asks to prove an inequality involving powers and sums using induction, for integers n greater than or equal to 2.

    Copyright:

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

    MAA HL

    Test on Mathematical Induction

    by Christos Nikolaidis
    Date: 28 January 2020

    Marks: /40
    without GDC

    Name of student: __________________________________________________

    1. [Maximum mark: 6]
    Prove by mathematical induction that 3 2 n + 7 is divisible by 8 for any n ∈ Z + .

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................
    Turn over

    1
    2. [Maximum mark: 9]
    (a) Prove by mathematical induction that [7]
    1 ⋅ 21 + 2 ⋅ 2 2 + 3 ⋅ 2 3 + L + n ⋅ 2 n = (n − 1)2 n +1 + 2 for any n ∈ Z + .

    (b) Confirm that the statement is true for n = 3 . [2]

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    2
    3. [Maximum mark: 7]
    Prove by mathematical induction that
    3 n > n 2 + 2n for any integer n ≥ 2 .

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................
    Turn over

    3
    4. [Maximum mark: 8]
    A sequence is defined recursively as follows
    u1 = 5
    u n +1 = 2u n +5
    (a) Write down the first four terms of the sequence. [2]
    (b) Prove by mathematical induction that
    un = 5 ⋅ 2n − 5 for any n = 1,2,3,... . [6]

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    4
    5. [Maximum mark: 10]
    (a) Prove by mathematical induction that
    n!×[2 × 6 × 10 × 14 × L × (4n − 2)] = (2n)! for any n ∈ Z + . [8]

    a!
    (b) Express (2 × 6 × 10 × 14 × L × 78) in the form . [2]
    b!

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................

    ..................................................................................................................................
    5

    You might also like