The Euler sum of powers conjecture was presented by Leonard Euler in 1778 to the Academy of Sciences of St. Petersburg. It was disproved by Lander and Parkin (1966) using a direct search algorithm written in Fortran on a CDC 6600 computer. This repository contains three Fortran codes that implement a similar search algorithm using language features available in the Fortran 2018 standard.
- Fortran Discourse: Euler Conjecture and CDC 6600
- L. J. Lander and T. R. Parkin: Counterexample to Euler’s conjecture on sums of like powers
Bulletin of the American Mathematical Society 72:6 (1966), 1079
DOI: 10.1090/S0002-9904-1966-11654-3 - L. Euler: Resolutio formulae Diophanteae ab(maa+nbb) = cd(mcc+ndd) per numeros rationales
Nova acta Academiae scientiarum imperialis petropolitanae 13, 45
https://scholarlycommons.pacific.edu/euler-works/716 - G. Ehlers: Solution of the Diophantine equation ab(maa + nbb) = cd(mcc + ndd) using rational numbers
Euleriana 3:2 (2023), 81
DOI: 10.56031/2693-9908.1041 - J. Reid: The new features of Fortran 2018
ACM SIGPLAN Fortran Forum 37:1 (2018), 5
DOI: 10.1145/3206214.3206215
This software is released under the MIT License.