Irmak, NurettinHe, Bo2024-11-072024-11-0720191310-51322367-8275https://doi.org/10.7546/nntdm.2019.25.4.102-109https://hdl.handle.net/11480/15087In this paper, we solve the Diophantine equationF(n)(s) = 2(a) + 3(b) + 5(c), where a, b, c and s are positive integers with 1 <= max {a, b} <= c.eninfo:eu-repo/semantics/openAccessFibonacci numbersLinear forms in logarithmsReduction methods-th powers-th power of Fibonacci number of the form 2a +3b +5cArticle25410210910.7546/nntdm.2019.25.4.102-109WOS:000502371600012N/A