论文部分内容阅读
An integer sequence is said to be Fibonacci-like if it satisfies the binary recurrence relation: Xn=Xn1+Xn2.Graham proved that there exist two relatively prime positive integers such that the Fibonacci-like sequence contains no primes.