olymmath

BALTIC-WAY 2019 Problem 2

    Let (Fn)(F_n) be the sequence defined recursively by F1=F2=1F_1=F_2=1 and Fn+1=Fn+Fn−1F_{n+1}=F_n+F_{n-1} for n≥2n\geq 2 . Find all pairs of positive integers (x,y)(x,y) such that 5Fx−3Fy=1.5F_x-3F_y=1.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator baltic-way/2019/p2 · Tag JRXFN0X6QY · Edit this page on GitHub · Keys: j next, k previous