fibonacci

问题 I am practising a C# console application, and I am trying to get the function to verify if the number appears in a fibonacci series or not but I'm getting errors. What I did was: class Program { static void Main(string[] args) { System.Console.WriteLine(isFibonacci(20)); } static int isFibonacci(int n) { int[] fib = new int[100]; fib[0] = 1; fib[1] = 1; for (int i = 2; i <= 100; i++) { fib[i] = fib[i - 1] + fib[i - 2]; if (n == fib[i]) { return 1; } } return 0; } } Can anybody tell me what am

问题 I need to find a (the next) fibonacci number given a integer N. So let's say I have n = 13 and I need to output the next fibonacci number which is 21 but how do I do this? How can I find the previous number that summed up to form it? I mean I could easily come up with a for/while loop that returns the fibonacci sequence but how can I find the next number by being given the previous one. <?php $n = 13; while($n < 1000) { $n = $x + $y; echo($n."<br />"); $x = $y; $y = $n; } ?> 回答1: Using a loop

问题 The goal of this problem is to calculate F[n] mod m . Here the inputs are n and m , where n stands for the index of the fibonacci number, say F[0] = 0, F[1] = 1, F[2] = 1, F[3]= 2 and m stands for the number by which F[n] will be divided. The constraints are: n >= 1 and n <= 10^18 m >= 2 and m <= 10^5 I have gone this problem so far and been able to generate the exact output of this problem except when I give 100000 as the value of m , it exceeds the time limit. The time limit is 5 seconds.

问题 I have to find the first k digit for all Fibonacci number up to fibonacci sequence 2*10^6. It is clear that we can not store the value of the fibonacci number in any variable. Even calculating all the fibonacci number itself take huge computational time. So, is there any way just to get the first k digit of fibonacci number without generating the whole number? 回答1: Since you only need the leading digits, an approximation to the Fibonacci number is sufficient. Thus, you can use the closed-form

问题 I'm learning about parallelization and in one exercise I'm given a couple of algorithms that I should improve in performance. One of them is a Fibonacci sequence generator: array[0] = 0; array[1] = 1; for (q = 2; q < MAX; q++) { array[q] = array[q−1] + array[q−2]; } My suspicion is, that this cannot be optimized (by parallelization), since every number depends on the two preceding numbers (and therefore indirectly on all preceding numbers). How could this be parallelized? 回答1: The Fibonacci

问题 I wanted to try and learn Lisp, but I very quickly gave up. I figured I'd try again. I'm looking at Problem 2 on Project Euler - finding the sum of all even Fibonacci numbers under 4 Million. I wrote the following code which works, but is all kinds of ugly. Chief among them is the fact that it's so slow - because it's doing naive recursion all the time. When I wrote this program in Python I built up a list as I calculated and never recalculated numbers. I know I could do that here (somehow)

问题 Fibonacci numbers have become a popular introduction to recursion for Computer Science students and there's a strong argument that they persist within nature. For these reasons, many of us are familiar with them. They also exist within Computer Science elsewhere too; in surprisingly efficient data structures and algorithms based upon the sequence. There are two main examples that come to mind: Fibonacci heaps which have better amortized running time than binomial heaps. Fibonacci search which

问题 <form method="get" action="Index.php"> <fieldset> <label for="powerof">Fibonacci: </label> <input type="text" name="powerof" value="<?php echo $_GET['powerof']; ?>"/> <input type="submit" name='Go' value="Calculate" /> </fieldset> </form> <?php $message = 'The fibonacci sequence is: <br />1<br />2<br />'; $powerof = 0; $max = 5; $temp = $max; if (isset($_GET['powerof'])) { $powerof = $_GET['powerof']; } if ($powerof > 100) { $powerof = 100; $message = 'Sorry, your input was too high. I

问题 #Program to print fibonacci until a range. print "Fibonacci Series" print "Enter a range" range = raw_input() first=1 second =1 print first print ", " print second print ", " third = 0 while(third < range): third=first+second print third print ", " first = second second = third #End of program Here, the program asks user for a range and prints the series upto the range. But, m getting the series of infinite loop. Can anyone help me? 回答1: range = raw_input() sets range to be a string , e.g. it

问题 I'm working on a homework project where I must have the user input a number, and the computer spits out the Fibonacci numbers up to that one. I'd normally be able to do this, with int values, except that for this program, I need to use the BigInteger type instead, because int, long, double, etc. types are too small to hold the values I'll need. So, this is the code I've got. The problem is that it doesn't print the numbers it's supposed to. My imports: import java.math.*; import java.util