Forum — Daily Challenge
    • Categories
    • Recent
    • Tags
    • Popular
    • Users
    • Groups
    • Login

    Isn't this a recursion? (Your Turn)

    Module 5 Day 8 Your Turn Part 1
    2
    2
    22
    Loading More Posts
    • Oldest to Newest
    • Newest to Oldest
    • Most Votes
    Reply
    • Reply as topic
    Log in to reply
    This topic has been deleted. Only users with topic management privileges can see it.
    • angeliccanaryA
      angeliccanary M0★ M1★ M2 M3★ M5★ M6
      last edited by

      Can't we just use the standard recursion formula or modular arithmetic or use the fact that we are finding GCD's of consecutive fibonacci numbers.
      Please fell free to share other ideas about thsi problem

      HeavenlyCube

      debbieD 1 Reply Last reply Reply Quote 3
      • debbieD
        debbie ADMIN M0★ M1 M5 @angeliccanary
        last edited by

        @angeliccanary Hi there! Thanks for these ideas. 🙂 It's really cool when you can find more than one, or even several, ways of doing the same problem. 🎆 🎆 🌠 You can definitely use the recursion definition of the Fibonacci sequence (which is very similar to what Prof. Loh did). I do think Prof. Loh was trying to find a different way to prove this pattern, rather than assuming the pattern was true, so I'm not sure about this:

        @angeliccanary said in Isn't this a recursion? (Your Turn):

        or use the fact that we are finding GCD's of consecutive fibonacci numbers.

        Great job 🙂 👍

        1 Reply Last reply Reply Quote 2

        • 1 / 1
        • First post
          Last post
        Daily Challenge | Terms | COPPA