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.

DOI

10.3906/mat-1605-127

Keywords

Diophantine equation, Fibonomial coefficient, Fibonacci number

First Page

825

Last Page

828

Recommended Citation

IRMAK, N (2017). Product of arbitrary Fibonacci numbers with distance 1 to Fibonomial coefficient. Turkish Journal of Mathematics 41 (4): 825-828. https://doi.org/10.3906/mat-1605-127

Download