Let n be a positive integer such that
a 3 + b 3 = n
c 3 + d 3 = n
Where a , b , c and d are distinct, positive integers. What is the smallest possible value of n ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I have heard this in the autobiography of Ramanuja the great mathematician
Hardy-Ramanujan Number
It has a name, the "Hardy-Ramanujan number". Lots of history and literature with this one.
I didn't try to solve this, I just recognized the problem and remembered the number.
Log in to reply
Me too, I remembered that I solved this kind of problem last week. :)
Log in to reply
Could you post a solution or tell me where I can find one, please? I can't find the reasoning anywhere...
1729 is the only number that can be represented as a sum of two cube numbers
10^3+9^3=1729
12^3+1^3=1729
so the answer is 1729
By the way, there are infinitely many numbers that can be represented as a sum of 2 cubes. It's just that 1729 is the smallest.
you can easily write a program to find out as many solutions as possible.
Not the only one, the smallest one.
1729 is also special because it is the 3rd Carmichael number
NO, it is not the only number, but it is the smallest of this catgory
Guys I heard about it in a numberphile video but how do you solve it?
its ramanujan number and this speciality about the number was pointed out by the greatest giant of mathematics on the bed while talking with hardy when he was ill .
Taxicab or Hardy-Ramanujan number. Click here to see my problem on it.
Problem Loading...
Note Loading...
Set Loading...
Ramanujan's taxi number?