In this paper, we solve the equation
\begin{equation*}
\sum_{k=0}^{m} {{2m+1}\brack{k}}_{F}\pm F_{t}=F_{n},
\end{equation*}
under weak assumptions. Here, $F_n$ is $n^{th}$ Fibonacci number and ${{.}\brack {.}}_{F}$ denotes Fibonomial coefficient.
Fibonomial coefficient Fibonacci number Diophantine equation
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Research Article |
Yazarlar | |
Yayımlanma Tarihi | 29 Aralık 2023 |
Gönderilme Tarihi | 3 Şubat 2023 |
Kabul Tarihi | 1 Ağustos 2023 |
Yayımlandığı Sayı | Yıl 2023 Cilt: 72 Sayı: 4 |
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics.
This work is licensed under a Creative Commons Attribution 4.0 International License.