Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Instructions: Due Date

    Uploaded by

    Agrim joshi

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Instructions: Due Date

    Uploaded by

    Agrim joshi
    7 views2 pages

    Original Title

    A8

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    7 views2 pages

    Instructions: Due Date

    Uploaded by

    Agrim joshi

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    MACM 201 A SSIGNMENT #8

    Due Date: Friday November 15, 2024, Quiz time


    Instructions

    Do all of these questions and write out the solutions neatly and succinctly as training. You do not have to hand
    in your work. The quiz on November 15 will closely follow some of the questions on this assignment. Solutions
    will be posted afterwards. Compare these with your own work to check if you did the questions correctly and
    use them to improve your own exposition. Make use of the workshop to get clarification.

    Textbook Reading

    • Sections: 9.5 11.1, 11.3

    Definitions, Concepts & Keywords

    • Be able to use proof by induction to prove summation formulas.


    • Know what a multi-graph, walk, circuit, trail, cycle, Euler circuit, and Euler trail is.

    Exercises

    A. Textbook Questions
    9.5 Exercises 1, 2.
    11.1 Exercise 2.
    11.3 Exercises 18 (simple graph), 20a (find an EC).
    B. Additional Questions
    Questions on 9.5
    1. Find the generating function for the series 1, 2, 4, 6, 8, . . . , 2n, . . ..
    Construct it by applying the summation operator to a series.
    2. Find a generating function A(x) that generates the sum of the first n integers, i.e.,

    A(x) = 0 + 1x + 3x2 + · · · + (0 + 1 + 2 + · · · + n)xn + · · · ,


    n(n+1)
    express it as a rational function and then obtain a formula for [xn ]A(x). You should get 2 .
    n
    X n(n + 1)(2n + 1)
    3. Show that i2 = by induction on n.
    i=1
    6
    n
    X
    4. Find a formula for k 3 = 03 + 13 + 23 + 33 + · · · + n3 . Use the summation operator and an
    k=0
    argument similar to Example 5.35.
    Hint: To do this you first need to find a generating function for the sequence an = n3 . If you
    need to compute a derivative, and haven’t done calculus, then use WolframAlpha.
    n   n  
    X n X n
    5. Show that k = n2n−1 . Hint: Write out 2 k = ....
    k k
    k=0 k=0
    √
    6. Let α = (1 + 5)/2 and fn be the n’th Fibonacci number for n ≥ 0. Show that α2 = α + 1. Now
    prove αn = αfn + fn−1 for n ≥ 1 by induction on n.

    Continued on next page

    C OPYRIGHT B RUIN 1
    MACM 201 A SSIGNMENT #8
    Questions on 11.1
    7. Suppose G is a simple graph with 10 vertices and 10 edges. What is the maximum number of
    connected components that G can have? How does this change if G is a multigraph?
    8. Draw the multigraph G = (V, E) where V = {1, 2, 3, 4, 5} and
    E = {{1, 2}, {2, 3}, {2, 3}, {3, 3}, {3, 1}, {4, 5}, {4, 5}, {4, 1}} and list all cycles in G.
    9. Let G be a simple connected graph and e any edge in G. Prove that G − e (i.e. G with edge e
    removed) is connected if and only if e is in a cycle of G.
    Questions on 11.3
    10. (a) Does K4 have an Euler circuit? If yes, draw one. If not, explain.
    (b) Does K4 have an Euler trail? If yes, draw one. If not, explain.
    (c) Does K5 have an Euler circuit? If yes, draw one. If not, explain.
    (d) Does K5 have an Euler trail? If yes, draw one. If not, explain.
    11. Find an Euler trail in the following graph.

    a b
    e f

    h g
    d c

    C OPYRIGHT B RUIN 2

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy