LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Nonnegative integer solutions of the equationFn

Photo by possessedphotography from unsplash

In this study, we solve the Diophantine equation in the title in nonnegative integers $m,n,$ and $a$. The solutions are given by $F_{1}-F_{0}=F_{2}-F_{0}=F_{3}-F_{2}=F_{3}-F_{1}=F_{4}-F_{3}=5^{0}$ and $F_{5}-F_{0}=F_{6}-F_{4}=F_{7}-F_{6}=5.$ Then we give a conjecture… Click to show full abstract

In this study, we solve the Diophantine equation in the title in nonnegative integers $m,n,$ and $a$. The solutions are given by $F_{1}-F_{0}=F_{2}-F_{0}=F_{3}-F_{2}=F_{3}-F_{1}=F_{4}-F_{3}=5^{0}$ and $F_{5}-F_{0}=F_{6}-F_{4}=F_{7}-F_{6}=5.$ Then we give a conjecture that says that if $a\geq 2$ and $p>7$ is prime, then the equation $F_{n}-F_{m}=p^{a}$ has no solutions in nonnegative integers $m,n.$

Keywords: integer solutions; nonnegative integer; solutions equationfn

Journal Title: TURKISH JOURNAL OF MATHEMATICS
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.