On the Diophantine equation \(\sum_{j=1}^kjP_j^p=P_n^q\) (Q2221046)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Diophantine equation _j=1ᵏʲP_j^p=P_n^q |
scientific article; zbMATH DE number 7301206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Diophantine equation \(\sum_{j=1}^kjP_j^p=P_n^q\) |
scientific article; zbMATH DE number 7301206 |
Statements
On the Diophantine equation \(\sum_{j=1}^kjP_j^p=P_n^q\) (English)
0 references
25 January 2021
0 references
The Pell numbers are defined recursively as \(P_0 = 0\), \(P_1 = 1\), and \(P_n = 2P_{n-1} + P_{n-2}\) for all \(n \geq 2\). The paper under review finds all solutions of the diophantine equations \( P_1^p+2P_2^p+3P_3^p+\ldots +kP_k^p=P_n^q\) in variables \(k,n\), when \(p,q\in\{1,2\}\).
0 references
Pell number
0 references
Diophantine equation
0 references
0.8474027514457703
0 references
0.846935510635376
0 references
0.8317391872406006
0 references
0.8309682607650757
0 references