✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
As an application we investigate the number of occurrences of positive integers among $F_n^{[k]}$ and determine all the solutions in nonnegative integers $x$ and $y$ to the Diophantine equation $F_x^{[k]}=F_y^{[\ell]}$, where $0\le k
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In this paper, we develop a new formula for hyper-Fibonacci numbers $F_n^{[k]}$, wherein the coefficients (related to Stirling numbers of the first kind) of the polynomial ingredient $p_k(n)$ are determined.
📊
Temel Bulgular & Veri:In this paper, we develop a new formula for hyper-Fibonacci numbers $F_n^{[k]}$, wherein the coefficients (related to Stirling numbers of the first kind) of the polynomial ingredient $p_k(n)$ are determined.
💡
Sonuç & Katkı:As an application we investigate the number of occurrences of positive integers among $F_n^{[k]}$ and determine all the solutions in nonnegative integers $x$ and $y$ to the Diophantine equation $F_x^{[k]}=F_y^{[\ell]}$, where $0\le k
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Hyper-Fibonacci numbers · Stirling numbers of the first kind · Diophantine equation
Abstract
In this paper, we develop a new formula for hyper-Fibonacci numbers $F_n^{[k]}$, wherein the coefficients (related to Stirling numbers of the first kind) of the polynomial ingredient $p_k(n)$ are determined. As an application we investigate the number of occurrences of positive integers among $F_n^{[k]}$ and determine all the solutions in nonnegative integers $x$ and $y$ to the Diophantine equation $F_x^{[k]}=F_y^{[\ell]}$, where $0\le k
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
KOMATSU, T., SZALAY, L. (2022). A new formula for hyper-Fibonacci numbers, and the number of occurrences. Turkish Journal of Mathematics, Cilt: 42 - Sayı: 3, 993–1004. https://ajindex.com/articles/607909