On the Diophantine equation L_n-L_m = 2 3a

DOI10.1007/S10998-019-00287-0MaRDI QIDQ2338602zbMATH OpenOpenAlexFDO

Authors Bahar Demirtürk Bitim Bitim

Publication date 21 November 2019

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10998-019-00287-0

zbMATH Keywords

Diophantine equationlogarithmic methodlower bounds

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Review text

Let \(L_{{\kern 1pt} k} \) be the Lucas numbers. The author solved the Diophantine equation \(L_{n} -L_{m} =2\cdot 3^{{\kern 1pt} a} \) for nonnegative integers \(n,m,a;\; \, n>m\). The solutions for \((n,m,a)\) are the triplets \((3,0,0),(2,1,0),(4,1,1),(7,5,2),(8,7,2)\).

Recommendations

• On perfect powers which are sum or difference of two Lucas numbers
• On solutions of the Diophantine equation F_n-F_m=3a
• Powers of two as sums of three Lucas numbers
• On Pillai's problem with Lucas numbers and powers of 3
• On the Diophantine equation \(F_n - F_m=2^a\)

Cited in

(9)

• On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
• On the Diophantine equation \(3^{2n} - 2 \cdot 3^m+ 1 = k^2\)
• On the Diophantine equation \(L_n=\binom{x}{5}\)
• On Pillai's problem with Lucas numbers and powers of 3
• On perfect powers which are sum or difference of two Lucas numbers
• Lucas numbers of the form \(\binom{2^t}{k}\)
• Mersenne numbers as a difference of two Lucas numbers
• On Diophantine equations involving difference of Lucas numbers and powers of 2
• Nonnegative integer solutions of the equation \(L_n^{(k)}- L_m^{(k)}=2\cdot 3^{\alpha}\)

This page was built for publication: On the Diophantine equation \(L_n-L_m = 2\cdot 3^a\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2338602)