Skip to content
List simple solutions for the sum of three cubes: x³ + y³ + z³ = n
C
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
README.md
list.txt
main.c

README.md

LSS

A small C program to list simple solutions (LSS) for the sum of three cubes: x³ + y³ + z³ = n (for n < 1000 and x,y,z < 100000, solutions formatted to be: x <= y <= z)

Perform the following steps, please:

  1. git clone https://github.com/fleschutz/LSS ; cd LSS

  2. gcc -O3 -fopenmp main.c (for GCC compiler) or: clang -O3 -fopenmp main.c (for CLANG compiler)

  3. ./a.out > out.txt

  4. sort -g out.txt > list.txt

Now, see list.txt for the resulting simple solutions.

Currently known complicated solutions

  • 30 = 3982933876681³ − 636600549515³ − 3977505554546³
  • 33 = 88661289752875283³ − 87784054428622393³ − 27361114688070403³
  • 42 = -80538738812075974³ + 80435758145817515³ + 1260212329733563³
  • 52 = 60702901317³ + 23961292454³ − 61922712865³
  • 165 = (-385495523231271884)³ + 383344975542639445 + 98422560467622814³
  • 906 = (−74924259395610397)³ + 72054089679353378³ + 35961979615356503³

Currently unsolved solutions

  • 114 = ?
  • 390 = ?
  • 579 = ?
  • 627 = ?
  • 633 = ?
  • 732 = ?
  • 795 = ?
  • 921 = ?
  • 975 = ?

Links

Feedback

Send your feedback to markus at fleschutz dot de.

You can’t perform that action at this time.