•  
  •  
 

Turkish Journal of Mathematics

Authors

NURETTİN IRMAK

DOI

10.3906/mat-1605-127

Abstract

In this paper, we solve completely the Diophantine equation \begin{gather} F_{n_{1}}F_{n_{2}}\ldots F_{n_{k}}\pm 1={m\brack t}_{F} \end{gather} for $t=1$ and $t=2$ where $2$ < $n_{1}$ < $n_{2}$ < $\ldots$ < $n_{k}$ positive integers and ${m\brack t}_{F}$ is the Fibonomial coefficient.

Keywords

Diophantine equation, Fibonomial coefficient, Fibonacci number

First Page

825

Last Page

828

Included in

Mathematics Commons

Share

COinS