Discrete Math - 5.3.2 Structural Induction

แชร์
ฝัง
  • เผยแพร่เมื่อ 21 ธ.ค. 2024

ความคิดเห็น • 10

  • @keysersoze8678
    @keysersoze8678 2 ปีที่แล้ว +7

    thank you for your effort, mrs. Brehm.

  • @osyrusthevirus2434
    @osyrusthevirus2434 10 วันที่ผ่านมา +1

    Some folks are confused by the “math magic” step (step 3), so I will clarify:
    The first thing to realize is that the professor cancels the 1 with one of two -1, which is why step 3 contains the remaining -1.
    Now, the magic part is nothing but simple intuition. Notice that the professor denotes step 3 as ≤ left of the equation. This tells us that step 2 (the inductive hypothesis) is less than or equal to step 3. This means that no matter what h(T1) and h(T2) are, their sum will always be less than or equal to 2 * max( h(T1), h(T2) ). The sum is equal only when h(T1) = h(T2). In other words:
    Let n = h(T1) = h(T2), all positive integers
    Therefore, 1 + (2^[h(T1) + 1] - 1) + (2^[h(T2) + 1] - 1) = 2 * 2^[n + 1] - 1
    Now let n = max( h(T1), h(T2) ) and h(T1) ≠ h(T2)
    Therefore, 1 + (2^[h(T1) + 1] - 1) + (2^[h(T2) + 1] - 1) ≤ 2 * 2^[max( h(T1), h(T2) ) + 1] - 1
    I have my final tomorrow, so this helped a lot. Thank you for your clear explanations professor.

  • @ayanaxhye
    @ayanaxhye 2 ปีที่แล้ว +33

    huh

  • @ramielomar6883
    @ramielomar6883 2 ปีที่แล้ว +2

    Thank you mrs u really helped me out im forever in your dept

  • @Salvation1984
    @Salvation1984 4 ปีที่แล้ว +48

    "Math magic" following a formula and then hearing to work it out you have to pull something out of thin air. That right there explains my burning-lava-of -rage dislike to Math

  • @RafidShuvo
    @RafidShuvo 10 หลายเดือนก่อน

    But miss your n and h typing looks same so it's a little confusion for me to understand

  • @y1729
    @y1729 8 หลายเดือนก่อน

    Small Typo: "A" should be the set of all *positive* integers divisible by 7