✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
We completely solve this equation by using a lower bound for linear forms in logarithms due to Matveev and a version of the Baker-Davenport reduction method due to Dujella and Peth\H{o}.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper, we consider the Diophantine equation $P_n - P_m = N_k$ in positive integers $n, m$ and $k$ with $n > m \ge 1$, where $P_n$ is the $n$-th Pell number and $N_k$ is the $k$-th Narayana's cows number.
📊
Key Findings & Data:In this paper, we consider the Diophantine equation $P_n - P_m = N_k$ in positive integers $n, m$ and $k$ with $n > m \ge 1$, where $P_n$ is the $n$-th Pell number and $N_k$ is the $k$-th Narayana's cows number.
💡
Conclusion & Impact:We completely solve this equation by using a lower bound for linear forms in logarithms due to Matveev and a version of the Baker-Davenport reduction method due to Dujella and Peth\H{o}.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Pell numbers · Narayana's cows sequence · Diophantine equation
Abstract
In this paper, we consider the Diophantine equation $P_n - P_m = N_k$ in positive integers $n, m$ and $k$ with $n > m \ge 1$, where $P_n$ is the $n$-th Pell number and $N_k$ is the $k$-th Narayana's cows number. We completely solve this equation by using a lower bound for linear forms in logarithms due to Matveev and a version of the Baker-Davenport reduction method due to Dujella and Peth\H{o}.
🔖
Cite This Article
Çağman, A. (2026). NARAYANA'S COWS NUMBERS AS DIFFERENCES OF TWO PELL NUMBERS. Eastern Anatolian Journal of Science, Volume: 12 Issue: 1. https://ajindex.com/articles/1475618