The nth taxicab number, denoted as T(n), is defined as the smallest number that can be expressed as a sum of two positive algebraic cubes in n distinct ways (source: wikipedia).
Example:
T(1) = 2 = 1^3 + 1^3
T(2) = 1729 = 1^3 + 12^3 = 9^3 + 10^3Return the value of n if the given number is a taxicab number. Return 0 if not. If the input is 1729, output would be 2, since 1729 is smallest number that can be expressed as a sum of two cubes in two (n=2) distinct ways.
Avoid look up table solution. Test suit might expand.
Solution Stats
Problem Comments
Solution Comments
3 Comments
rifat ahmed
on 18 Jun 2014
not a general solution
Guillaume
on 19 Jun 2014
Considering that the proof of the 6th taxicab number produced over 8GB of data and consisted of an exhaustive search over the integers up to 1e21, a truly generic solution is not really possible.
Jean-Marie Sainthillier
on 20 Jul 2014
:-)
Tags
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today
1 player likes this problem
1 player likes this problem