Cubed sums

This is a fairly simple school project. It involves writing a java program to find the 10 smallest integers *n* that can be written as the sum of two cubes, in two different ways. There is no input it just has to output the number(n) and a,b,c,d for all ten numbers. Ex. for one of the numbers n = 4104 a = 2 b = 16 c = 9 d = 15 n = a(cubed) + b(cubed) = c(cubed) + d(cubed) (a,b) cannot be the same as (c,d) I use J Builder for my projects but I assume any type will do. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site). ## Platform It needs to run on J Builder however if the code is there I assume I could just copy and past it to J Builder.