Sun's Lucas and mixed Fibonacci–Lucas representation conjectures
Let and 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 . Sun's Lucas and mixed Fibonacci–Lucas conjectures. (i) Every integer can be written as the sum of an odd prime, an odd Lucas number, and a positive Lucas number. For , every integer can be written as , where is an odd prime, , and or is odd. (ii) Every integer 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 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 can be written as , where is an odd prime, , and or is odd. The source reports extensive computational checks, but these assertions remain open.
References
Primary source
Zhi-Wei Sun, “Mixed sums of primes and other terms”, arXiv:0901.3075 (2009).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.