I have the following procedure to do the above. It works but it returns [9,10],[10,9],[12,1] for n=1729(for example). How do I modify this to

a) to count 9,10 and 10,9 as the same and hence only show one of them

b) get 1,12 to show as a solution?

**cubesum:=proc(n::nonnegint)**

**global listcub:=table();**

**local k:=0, x:=iroot(iquo(n,3),3),y:=x,x3:=x^3,y3:=y^3;**

**if 3*x3 <> n then x=x+1; x3:=x^3;y:=x;y3:=x3 end if;**

**while x3<=n do**

**y:=iroot(n-x3,3); y3:=y^3;**

**if(x3+y3 = n) then k:=k+1; listcub[k]:=[x,y]end if;**

**x:=x+1; x3:=x^3;**

**end do;**

**convert(listcub,list);**

**end proc:**