Project Notes

I know, number theory is not in the charts of "Scratch community", nevertheless: The "Diophant equations" concern such equations for integer numbers as: a^2+b^2=c^k for examples: Pythagorian triples as: a^2+b^2 = c^2 This project gives the solutions for a^2 + b^2 = c^3 In other words, integer cubics as sum of two integer squares. You may regard theese cubics, having various solutions, in the list "multibles" The list "Supers" concerns c-(cubic) having more than 2 solutions. For example, 1105^3 is the first number having 4 solutions. Because the algorithm is a little jumpy: the solutions are complete within the limit "C-cubic>?" and "Found_all_c_cubic 2 ? I have found a pretty proof, but there is not enough space in this comment.... ;-)