posted by .

How many of the first 1001 Fibonacci numbers are divisible by 3?

  • Math -


Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. math

    There is no function equation for the Fibonacci numbers, you have to use a Recursion formula. F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1 what is the equation for the fibonacci sequence
  2. Math

    How many digits are in the smallest positive number divisible by th first ten numbers in the Fibonacci sequence?
  3. 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 …
  4. Math grade 7

    The number 7 is a factor of 1001. explain how you know 1001 is a multiple of 7?
  5. math

    Using the numbers 1 through 9 with no repeats, find a 9 number such that: the first digit is divisible by 1, the first two digits are divisible by 2, the first 3 digits are divisible by 3, and so on until we get to a 9 digit number …
  6. math

    How many of the first 1001 Fibonacci numbers are divisible by 3?
  7. Math

    1. Find the sum of the first 21 terms of the arithmetic sequence given by the formula an = n+5 I see that I have to plug in numbers and get the terms...but i'm sure there's a shorter way to do this instead of plugging in 21 numbers. …
  8. 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 …
  9. math

    three digit numbers are to be formed from digits 0,1,2,3...9 if repetitionis allowed. (a) how many of such numbers can be formed?
  10. Math

    What is the first common number among: palindromic numbers, Triangular numbers and Fibonacci numbers?

More Similar Questions