On the inverse of a Fibonacci number modulo a Fibonacci number being a Fibonacci number

From MaRDI portal
Publication:6141252



Abstract: Let (Fn)ngeq1 be the sequence of Fibonacci numbers. For all integers a and bgeq1 with gcd(a,b)=1, let be the multiplicative inverse of a modulo b, which we pick in the usual set of representatives 0,1,dots,b−1. Put also when gcd(a,b)>1. We determine all positive integers m and n such that is a Fibonacci number. This extends a previous result of Prempreesuk, Noppakaew, and Pongsriiam, who considered the special case min3,n−3,n−2,n−1 and ngeq7. Let (Ln)ngeq1 be the sequence of Lucas numbers. We also determine all positive integers m and n such that is a Lucas number.












This page was built for publication: On the inverse of a Fibonacci number modulo a Fibonacci number being a Fibonacci number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6141252)