✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Moreover, we show that if the equation $V_{n}=11x^{2}-1$ has a solution, then $P\equiv2({mod}8)$ and $P\equiv-1({mod}11).$
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:Let $P\geq3$ be an integer and $(V_{n})$ denote generalized Lucas sequence defined by $V_{0}=2,V_{1}=P,$ and $V_{n+1}=PV_{n}-V_{n-1}$ for $n\geq1.$ In this study, we solve the equation $V_{n}=11x^{2}\mp1.$ We show that the equation $V_{n}=11x^{2}+1$ has a solution only when $n=1$ and $P\equiv 1({mod}11)$.
📊
Temel Bulgular & Veri:Let $P\geq3$ be an integer and $(V_{n})$ denote generalized Lucas sequence defined by $V_{0}=2,V_{1}=P,$ and $V_{n+1}=PV_{n}-V_{n-1}$ for $n\geq1.$ In this study, we solve the equation $V_{n}=11x^{2}\mp1.$ We show that the equation $V_{n}=11x^{2}+1$ has a solution only when $n=1$ and $P\equiv 1({mod}11)$.
💡
Sonuç & Katkı:Moreover, we show that if the equation $V_{n}=11x^{2}-1$ has a solution, then $P\equiv2({mod}8)$ and $P\equiv-1({mod}11).$
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:generalized Lucas numbers · congruences · diophantine equation
Abstract
Let $P\geq3$ be an integer and $(V_{n})$ denote generalized Lucas sequence defined by $V_{0}=2,V_{1}=P,$ and $V_{n+1}=PV_{n}-V_{n-1}$ for $n\geq1.$ In this study, we solve the equation $V_{n}=11x^{2}\mp1.$ We show that the equation $V_{n}=11x^{2}+1$ has a solution only when $n=1$ and $P\equiv 1({mod}11)$. Moreover, we show that if the equation $V_{n}=11x^{2}-1$ has a solution, then $P\equiv2({mod}8)$ and $P\equiv-1({mod}11).$
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
Keskin, R., Öğüt, Ü. (2019). Generalized Lucas numbers of the form $11x^{2}\mp 1$. Hacettepe Journal of Mathematics and Statistics, Volume: 48 Issue: 4. https://ajindex.com/articles/1402761