KaydedilenlerDerginizi ekleyin

Dergiler / Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics / 2023 / Volume: 72 Issue: 4

A Diophantine equation including Fibonacci and Fibonomial coefficients

Nurettin Irmak(KONYA TECHNICAL UNIVERSITY)0000-0003-0409-4342
Sayfa
—
Yayın Tarihi
2023-12-29
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Here, $F_n$ is $n^{th}$ Fibonacci number and ${{.}\brack {.}}_{F}$ denotes Fibonomial coefficient.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez: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.
📊
Temel Bulgular & Veri: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.
💡
Sonuç & Katkı:Here, $F_n$ is $n^{th}$ Fibonacci number and ${{.}\brack {.}}_{F}$ denotes Fibonomial coefficient.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Fibonomial coefficient · Fibonacci number · Diophantine equation

Abstract

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.

🔖

Bu Makaleye Atıf Yap

Irmak, N. (2023). A Diophantine equation including Fibonacci and Fibonomial coefficients. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, Volume: 72 Issue: 4. https://doi.org/10.31801/cfsuasmas.1247415

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (13)

  1. Berndt, B. C., Galway, W., The Brocard–Ramanujan diophantine equation $n! + 1 = m^{2}$, Ramanujan J., 4 (2000), 41–42. https://doi.org/10.1023/A:1009873805276
  2. Bollman, M., Hernandez, H. S., Luca, F., Fibonacci numbers which are sums of three factorials, Publ. Math. Debrecen, 77 (2010), 211–224.
  3. Carmichael, R. D., On the numerical factors of the arithmetics forms $\alpha^{n}\pm\beta^{n}$, Annals Math., 2(15) (1913), 30-70.
  4. Grossman, G., Luca, F., Sums of factorials in binary recurrence sequences, J. Number Theory, 93 (2002), 87–107. https://doi.org/10.1006/jnth.2001.2718
  5. Irmak, N., Sum of the Fibonomial coefficients at most one away from Fibonacci numbers, Math. Reports, 18(68)(4) (2016), 567-571.
  6. Irmak, N., S¸iar, Z., Keskin, R., On the sum of the three arbitrary Fibonacci and Lucas numbers, Notes Numbers Theory Discrete Math., 25(4) (2019), 96-101. https://doi.org/10.7546/nntdm.2019.25.4.96-101
  7. Kilic, E., Akkuş, I., Ohtsuka, H., Some generalized Fibonomial sums related with the Gaussian q-Binomial sum, Bull. Math. Soc. Sci. Math. Roumanie Tome, 55(103)(1) (2012), 51-61.
  8. Koshy, T., Fibonacci and Lucas Numbers with Applications, John Wiley and Sons, Proc., New York-Toronto, 2001.
  9. Luca, F., Siksek, S., Factorials expressible as sums of at most three Fibonacci numbers, Proc. of the Edinburgh Math. Soc., 53 (2010), 679–729. https://doi.org/10.1017/S0013091508000874
  10. Marques, D., Fibonomial coefficients at most one away from Fibonacci Numbers, Demonstratio Math., 45(1) (2012), 25-28. https://doi.org/10.1515/dema-2013-0360
  11. Marques, D., The Fibonacci version of a variant the Brocard-Ramanujan Diophantine equation, Far East J. Math. Sci., 56(2) (2011), 219-224.
  12. Marques, D., The Fibonacci version of the Brocard-Ramanujan Diophantine equation, Portugal. Math., 68(2) (2011), 185-189. https://doi.org/10.4171/PM/1887
  13. Szalay, L., Diophantine equations with binary recurrences associated to Brocard-Ramanujan problem, Portugal. Math., 69 (2012), 213-220. https://doi.org/10.4171/PM/1914