Fibonacci Sequence

posted by .

The sequence < un > is defined by the recurrence

Un+1 = 3Un+1\5Un+3

initial condition of u1 = 1:
Need to show un in terms of Fibonacci / Lucas numbers

  • Fibonacci Sequence - malformed -

    I assume you mean

    Un+1 = 3Un + 1/(5Un+3)

    since no other interpretation makes any sense.

    But that's not an integer sequence. So, how about fixing your typos, using parentheses, and maybe say U<n+1> to avoid mixing subscripts with numeric values?

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. Math

    F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci sequence. Find F27. I do not understand the Fibonacci sequence, could someone help me with my question and explain it to me please.
  2. Computer Science - MATLAB

    One interesting property of a Fibonacci sequence is that the ratio of the values of adjacent members of the sequence approach a number called “the golden ratio” or PHI. Create a program that accepts the first two numbers of a Fibonacci …
  3. Pre-Calc

    Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence?
  4. Fibonacci numbers

    I have three problems to answer dealing with Fibonacci numbers. I understand the first two, but would like for reassurrance that they are correct and lost on the last one and could use some help. Thank you. 1. Fibonacci numbers can …
  5. Fibonacci Numbers

    This is not a test question, but I did not know what the appropriate topic for my question is. If I used the terms 2, 3, 4, 8 consecutive terms of the Fibonacci sequence. "a" is the first and fourth terms and "b" is twice the product …
  6. Fibonacci sequence

    The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8… is defined recursively using the formulas a1=a2=1 and an+2=an+an+1 for all n≥1. Find the greatest common divisor of a484 and a2013.
  7. Math (fibonacci

    A sequence of numbers is called a Fibonacci-type sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci- type sequence. If 1985, x, y, 200 …
  8. Maths

    A super-Fibonacci sequence is a list of whole numbers with the property that, from the third term onwards, every term is the sum of all the previous terms. For example, 1, 4, 5, 10, ... How many super-Fibonacci sequences with 1 involve …
  9. Math

    The sequence < un > is defined by the recurrence Un+1 = 3Un+1\5Un+3 initial condition of u1 = 1: Need to show un in terms of Fibonacci / Lucas numbers
  10. Maths

    The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ... starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci …

More Similar Questions