Computing four-term arithmetic progressions of powerful numbers (Q6551218)
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 7860858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing four-term arithmetic progressions of powerful numbers |
scientific article; zbMATH DE number 7860858 |
Statements
Computing four-term arithmetic progressions of powerful numbers (English)
0 references
6 June 2024
0 references
In the paper under review, the authors describe their search for the smallest four-tuple of distinct relatively prime power-full numbers \(N, N+d, N+2d, N+3d\) with\N\begin{align*}\NN=\,\, &146027586840764992443268586116964792396\\\N&3463007454989969837612212828 54060601390\\\N&929532162486512072320073482429641,\N\end{align*}\Nand\N\begin{align*}\Nd=\,\, &702453477383069580332301713710563864348\\\N&27954553864819741944157271564 3523112871\\\N&40966583001138305079433031383242.\N\end{align*}
0 references
power-full number
0 references
arithmetic progression
0 references
0.7700729966163635
0 references
0.7673460245132446
0 references
0.7380370497703552
0 references
