Tagged Questions
1
vote
1answer
42 views
Register Machine on Fibonacci Numbers
This problem is easy to understand but I am struggling to come up with any solutions.
According to Wikipedia a register machine is a generic class of abstract machines used in a manner similar to a ...
1
vote
0answers
51 views
Is this “Elegant” algorithm for logarithm by Zeckendorf representation, the same as an 'efficient' algorithm?
The algorithm here which computes the exponent $b$ given a base $a$, and given $n$ = $a$^$b$, appears no better to me than simply counting the number of times we divide $n$ through by the base $a$ ...
3
votes
5answers
104 views
Translating matrix fibonacci into c++ (how can we determine if a number is fibonacci?)
Is it possible to determine if a number is a fibonacci number in less than N time (where N is the Nth fibonacci number) using the matrix method? I'm trying to exclude external libraries like cmath or ...
0
votes
1answer
543 views
How to solve tribonacci series [duplicate]
Possible Duplicate:
Fibonacci, tribonacci and other similar sequences
Suppose my Tribonacci series is like this:
\begin{equation}
T(n) = T(n-1) + T(n-2) +T(n-3)
\end{equation}
with initial ...
0
votes
1answer
544 views
Smallest Fibonacci number having a common factor with a given number
We have a number $k$ and we have to find the smallest Fibonacci number that has common factor with it(except $1$). We also have $2 \leq k \leq 1,000,000$.
The required Fibonacci number is guaranteed ...
3
votes
1answer
349 views
Finding the smallest prime number that divides $Fib(n)$ but not any other $Fib(k)$ smaller than $Fib(n)$
Let $F(n)$ be $n$-th Fibonacci number.$$F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, F(4) = 3 \text{ and so on. }$$Given a positive integer $n \gt 2$,Find the smallest prime number $P$ such that $P$ ...
1
vote
2answers
643 views
Finding index of a Fibonacci number: any mathematical solution possible?
The problem:
Given a Fibonacci number,find its index.
I am aware of the standard solution 'generate-hash-find'. I am just curious if there is ...
