Sun's Lucas and mixed Fibonacci–Lucas representation conjectures

From papers

Let FnF_n and LnL_n denote the Fibonacci and Lucas sequences, respectively. A sequence term is positive when its value is positive, and a term is odd when it is not divisible by 22. Sun's Lucas and mixed Fibonacci–Lucas conjectures. (i) Every integer n>4n>4 can be written as the sum of an odd prime, an odd Lucas number, and a positive Lucas number. For k=2,3k=2,3, every integer n>4n>4 can be written as p+Ls+Ltkp+L_s+L_t^k, where pp is an odd prime, s,t0s,t\geqslant0, and LsL_s or LtL_t is odd. (ii) Every integer n>4n>4 can be written as the sum of an odd prime, a positive Fibonacci number, and twice a positive Fibonacci number, or half of a positive Fibonacci number. Also, every integer n>4n>4 can be written as the sum of an odd prime, twice a positive Fibonacci number, and the square of a positive Fibonacci number. (iii) Every integer n>4n>4 can be written as p+Fs+Ltp+F_s+L_t, where pp is an odd prime, s>0s>0, and FsF_s or LtL_t is odd. The source reports extensive computational checks, but these assertions remain 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.