It is not known whether there is a largest prime in the Fibonacci sequence, but of course there are quite a few primes.


Similarly, the Lucas sequence starting with $L\_1=1, L\_2 = 3$ comes to a prime at $L\_4 = 7$. On the other hand, for $x\_1=3, x\_2 = 11$ all the $x\_n$ are composite until $x\_7 = 103$.


It seems intuitive that for any arbitrary positive coprime $(x\_1, x\_2)$ the corresponding sequence eventually arrives at a prime, but I'm wondering whether there is a proof or whether somebody out there can provide a proof. Concretely:



> 
> Given $(x\_1, x\_2) \in \Bbb{Z}+ : \gcd(x\_1,x\_2) = 1$. For all integer $n > 2$ define $x\_n = x\_{n-1}+x\_{n-2}$. Prove that $\exists n \in \Bbb N, | n> 2 \wedge x\_n \in \Bbb{P} $.
> 
> 
> 



Existence of some prime $x_k | k > 2$ in $x_n = x_{n-1} + x_{n-2}$ whenever $x_1$ is coprime to $x_2$
As Gerhard Paseman said in his comment, there are counterexamples. This is discussed in A3 of UPINT. According to the third edition, the smallest known counterexample as of the printing (in 2003) is $x\_1= 8983542533631$ and $x\_2 = 248272649660939$ due to John Nicol. [This article by Knuth discusses the basic idea](https://www.jstor.org/stable/2691504?seq=1#page_scan_tab_contents) behind finding such pairs and may be a good place to start. The relevant section in UPINT has a few references in addition.


