Taxicab Numbers (Jaroslaw Wroblewski)Discuss about this problem
Find integers a1>=b1, a2>=b2, ..., aN>=bN such that a1>a2>...>aN and
S = a1^3+b1^3 = a2^3+b2^3 = ... = aN^3+bN^3

is positive and as small as possible.

Category 1 (taxicab): positive integers only.

Category 2 (cabtaxi): any integers, positive, negative or zero.

Find the smallest possible number expressible as the sum of two cubes in N different ways.