Sun's prime–Fibonacci–Fibonacci representation conjecture

From papers

Let F0=0F_0=0, F1=1F_1=1, and Fi+1=Fi+Fi1F_{i+1}=F_i+F_{i-1} for i=1,2,3,i=1,2,3,\ldots be the Fibonacci sequence. A Fibonacci number is positive when its index is positive and its value is positive. Sun's prime–Fibonacci–Fibonacci conjecture. Every integer n>4n>4 can be written as

n=p+Fs+Ft,n=p+F_s+F_t,

where pp is an odd prime and Fs,FtF_s,F_t are positive Fibonacci numbers; moreover, one of Fs,FtF_s,F_t can be required to be odd. This is a sparse additive analogue of Goldbach's conjecture. The source reports verification up to 101410^{14}, but the conjecture itself remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Zhi-Wei Sun, “Mixed sums of primes and other terms”, arXiv:0901.3075 (2009).

Solutions 0

No solutions have been posted yet.