On the Diophantine equation \(L_n-L_m = 2\cdot 3^a\) (Q2338602)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7134824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Diophantine equation \(L_n-L_m = 2\cdot 3^a\) |
scientific article; zbMATH DE number 7134824 |
Statements
On the Diophantine equation \(L_n-L_m = 2\cdot 3^a\) (English)
0 references
21 November 2019
0 references
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)\).
0 references
Diophantine equation
0 references
lower bounds
0 references
logarithmic method
0 references
0.8279501795768738
0 references
0.8231655359268188
0 references
0.8131186962127686
0 references
0.80685955286026
0 references
0.8050559759140015
0 references
