Questions tagged [fibonacci-sequence]
The Fibonacci sequence is the sequence defined by F(0) = 0, F(1) = 1, F(n + 2) = F(n) + F(n + 1). The first few terms are 0, 1, 1, 2, 3, 5, 8.
163
questions
3
votes
1answer
236 views
Testing Fibonacci conjecture
The sequence of Fibonacci numbers is defined as F1 = 1, Fn = Fn−2 +
Fn−1. It has been conjectured that for any Fibonacci number F, F2 + 41
is composite.
... [T]ask is to either prove the ...
2
votes
1answer
191 views
Project Euler #2: sum of even Fibonacci numbers, using generators
I am currently working on Project Euler problem #2 which requires you to print the sum of all even fibonacci numbers below 4 million.
I just recently learned about generators and from my ...
3
votes
1answer
843 views
Finding the nth element of generalized Fibonacci sequences
I solved the Fibonacci Golf problem on checkio.org:
The Fibonacci numbers or Fibonacci sequence are the numbers in the
following integer sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21...
This is not ...
2
votes
2answers
116 views
Sequence generation problem - Fibonacci
Below is the representation and user interface fib_sequence for generating a Fibonacci sequence:
...
3
votes
2answers
210 views
Sequence processing problems
Problem 1:
Sum the even numbers for the first n fibonacci numbers
Solution:
...
3
votes
1answer
1k views
Memoization of Fibonacci using generic Int => Int helper
I'm trying to understand memoization using Scala. I took the Fibonacci sequence as an example because of the high cost of recursively computing numbers in the sequence without memoization.
...
2
votes
1answer
5k views
Project Euler 25 - 1000-digit Fibonacci Number
I have recently completed problem 25 from the project Euler site.
The Fibonacci sequence is defined by the recurrence relation:
\$\qquad F_n = F_{n−1} + F_{n−2}\$, where \$F_1 = 1\$ and \$F_2 =...
65
votes
2answers
4k views
I HAZ A FIBO, RLY
First LOLCODE program, run here. This program inputs a Fibonacci number from the user, then determines and prints whether the number is in the Fibonacci series. What do you think?
...
2
votes
2answers
1k views
Tail Recursive Fibonacci
Please critique my implementation of a tail-recursive method for generating the Fibonacci sequence:
...
8
votes
3answers
2k views
Project Euler #2 (Fibonacci Sequence)
Challenge: The Fibonacci sequence is generated by adding the previous two terms.
By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8,
13, 21, 34, 55, 89.
Consider a ...
6
votes
1answer
225 views
Evaluating Fibonacci-sequence-based recurrence relation (SPOJ Flibonakki)
I have a function fib2 which returning two values as Tuple but I want to print the product of tuples returned by function fib2. I am new to Haskell so please ...
12
votes
3answers
1k views
Lock-free thread-safe Fibonacci number generator
Here is my implementation of a lock-free thread-safe Fibonacci number generator. Is it correct? The idea is to use an immutable holder for previous and current numbers (since it's hard to change two ...
11
votes
8answers
1k views
Fibonacci checker
I wrote a simple Fibonacci checker using HTML, CSS, and JS. This is my first JS program, so be sure to tell me everything that is wrong with it. Check it out here (http://jsfiddle.net/z49fyypt/1/), ...
4
votes
1answer
949 views
Clojure Fibonacci
I'm a Clojure novice working through 4Clojure problems. In one problem I am supposed to create a function that takes a number and returns that number of Fibonaccis. My first thought was to create a ...
3
votes
2answers
151 views
Project Euler #2 in F#
Project Euler Problem 2 asks for the sum of all even Fibonacci numbers below 4 million.
My first attempt at this problem using functional programming with F#. I would've liked to use some kind of ...
6
votes
2answers
1k views
Project Euler #2 Efficiency
Each new term in the Fibonacci sequence is generated by adding the previous two terms.
By starting with 1 and 2, the first 10 terms will be:
...
7
votes
4answers
169 views
2
votes
1answer
352 views
7
votes
1answer
1k views
Iterative Fibonacci sequence using standard library functions
We're all aware of Fibonacci sequence calculators but they look like C-style code. I want to avoid that and take advantage of the standard library. This code is very short, so I'm focusing on ...
10
votes
1answer
277 views
Project Euler #2 - Sum of even Fibonacci numbers to 4,000,000
This particular problem has already been posted here before, but the community is ok with me to post it again, so I can have feedback on my own implementation.
I tried to keep things simple, with ...
4
votes
1answer
71 views
Zeckendorf numbers the Clojure way
I'm just getting into Clojure, and I wanted to make sure I am writing code the "Clojure way". The challenge I took on is Zeckendorf numbers (fairly trivial).
...
20
votes
4answers
3k views
Project Euler #2 (Even Fibonacci numbers) in Swift
I figured working through Project Euler problems in Swift would be a good way to learn any tips or tricks. For example, tuples are something I'm not used to using, but they proved useful here. Using ...
8
votes
6answers
7k views
Program for finding Fibonacci primes
I think it could have been designed with more object orientation. I don't like how one of my methods calls another from within the method, but I wasn't sure how to return the result because it is a ...
12
votes
2answers
789 views
Project Euler #2 Even Fibonacci numbers
Problem:
Each new term in the Fibonacci sequence is generated by adding the
previous two terms. By starting with 1 and 2, the first 10 terms will
be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
...
5
votes
2answers
326 views
Comparison of Fibonacci (Multinacci) Functions in Python3
After coming up with a formula on this Stack Overflow question, defeating recursion limits and finding a few new ways of calculating these numbers (as per this Stack Overflow question), I decided that ...
12
votes
5answers
7k views
Dynamic programming with Fibonacci
I have written the following code using a dynamic programming technique. Can I use ArrayList here? Please let me know if I can improve this code.
...
6
votes
1answer
2k views
Memoized Fibonacci
I went ahead and implemented a method to calculate Fibonacci numbers using memoization.
...
12
votes
4answers
435 views
I'm not sure if I still love Fibonacci, but my code is getting better. How much better?
Technically, this is a follow up to these two questions, but I have taken a radically different approach.
Everybody Loves Fibonacci
Does everyone still love Fibonacci
I finally allowed myself to be ...
4
votes
1answer
1k views
Fibonacci number function: convert to tail-recursion?
I've been implementing a function for calculating the nth Fibonacci number in F#. So far the best implementation I could come up with is this:
...
31
votes
4answers
1k views
Standardly deviated Fibonacci
I'm new to C++ (about 4 weeks with no prior programming experience in other languages) and am writing a program that's supposed to do the following:
Define an array of 100 sequential numbers of type <...
12
votes
3answers
1k views
Does everyone still love Fibonacci?
I'm following up on this question. I made a few decisions about my model and implemented recommendations accordingly.
TL;DR the link
Uses a loop algorithm to return a Fibonacci number \$Fn\$ of ...
38
votes
4answers
5k views
Everyone loves Fibonacci
I was bored and burnt out on more serious projects.... until I saw this Computerphile video on YouTube. Now I'm inspired again. Now I feel like spending some time implementing that recursive algorithm ...
2
votes
2answers
300 views
Testing whether sums of cubes are Fibonacci numbers
I'm trying to iterate through all the combinations of pairs of positive long integers in Java and testing the sum of their cubes to discover if it's a Fibonacci ...
4
votes
3answers
739 views
How would you count in the Fibonacci Sequence?
I was wondering if I did this in a remotely acceptable way:
...
7
votes
2answers
8k views
Calculate fibonacci in O(log n)
This program calculates the \$n\$th fibonacci number, in \$O(\log n)\$ time. I'm looking for code review, optimizations, and best practices.
...
8
votes
4answers
2k views
Another even Fibonacci numbers implementation
This is intended as something of a comparative study. I'm including not just one, but two separate implementations of code to implement the Project Euler problem to sum the even Fibonacci numbers up ...
6
votes
1answer
1k views
Four algorithms to find the Nth Fibonacci number
I'm implementing some basic algorithms in Go as an introductory exercise. Here are four different algorithms to find the Nth Fibonacci number.
I'm looking for general feedback, but I'm specially ...
6
votes
2answers
337 views
10
votes
3answers
1k views
Recursive Fibonacci with Generic delegates
Here is a fast recursive Fibonacci-like for loop. How can it be more readable, and is it possible remove TArgs?
...
5
votes
2answers
2k views
Print routes on the stairway when only 1 or 2 steps are possible
Given a staircase with N steps, you can go up with 1 or 2 steps each
time. Output all possible ways you go from bottom to top.
I'm looking for code review, best practices, optimizations etc. ...
3
votes
2answers
2k views
Fibonacci series, topdown and bottom up approaches, stairway climbing
I have solved fibonacci series and then used the topdown and bottom up approaches to solve it. Also I have included the stairway climbing question as follows "You are climbing a stair case. Each time ...
5
votes
2answers
4k views
7
votes
4answers
2k views
More efficient solution for Project Euler #2 (sum of Fibonacci numbers under 4 million)
I would like to get some feedback on my code. I am starting to program after doing a few online Python courses.
Would you be able to help me by following my track of thinking and then pinpointing ...
13
votes
4answers
4k views
Fibonacci sequence in C
I'm very new to C, so pointing out better ways of doing things, errors, bad practices, etc would be optimal at this stage.
Code on GitHub
...
10
votes
3answers
16k views
Project Euler Question #2: Sum of even Fibonacci numbers under 4 million
The question is:
Each new term in the Fibonacci sequence is generated by adding the previous two terms.
By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, ...
8
votes
1answer
164 views
Optimize RecursionArray interface
I created a class a while ago that I named a "Recursion Array". It is a way to create dynamically memoized sequences such as the Fibonacci sequence or the factorial numbers sequences. The concept is ...
1
vote
1answer
453 views
Better way of calculating Project Euler #2 (Fibonacci sequence)
Even Fibonacci numbers
Problem 2
Each new term in the Fibonacci sequence is generated by adding the
previous two terms. By starting with 1 and 2, the first 10 terms will
be:
1, 2, 3,...
2
votes
3answers
825 views
Maintaining the Single Responsibility Principle with Project Euler #2
This is my solution to Project Euler problem 2:
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
The class ...
3
votes
2answers
567 views
Fibonacci using cache
This is my simple Fibonacci implementation in CoffeeScript. What do you think? Using cache (fibResults), it's very very fast.
...
2
votes
2answers
4k views
