Nurettin Irmak2019-08-012019-08-0120171300-0098https://app.trdizin.gov.tr/makale/TWpRMk1USTFOUT09https://hdl.handle.net/11480/2347In this paper, we solve completely the Diophantine equation Fn1 Fn2 . . . Fnk ± 1 = [ m t ] F (1) for t = 1 and t = 2 where 2 < n1 < n2 < . . . < nk positive integers and [m t ] F is the Fibonomial coefficient.In this paper, we solve completely the Diophantine equation Fn1 Fn2 . . . Fnk ± 1 = [ m t ] F (1) for t = 1 and t = 2 where 2 < n1 < n2 < . . . < nk positive integers and [m t ] F is the Fibonomial coefficient.eninfo:eu-repo/semantics/openAccessMatematikArticle4148258282-s2.0-85026236321Q2246125WOS:000406419900005Q3