It is known that by Fermat's Last Theorem there are no solutions to $a^3+b^3=c^3$ for $a,b,c\in\mathbb{N}$. I wondered about how multiplying the $c^3$ by a constant would change this fact.
Accordingly, I have been looking into instances where $c^3|(a^3+b^3)$ for $a,b\in\mathbb{N}$. In other words, solutions to the Diophantine Equation:
$a^3+b^3=dc^3$ where $a,b,$ and $c$ are pairwise co-prime and $a,b,c>0$
Obviously there are some trivial solutions. If $c=1$, for example, $a$ and $b$ can be any integers, and $d$ can be chosen to simply be $a^3+b^3$.
By requiring that $a,b,$ and $c$ are pairwise co-prime and that $c\not=1$, we eliminate the trivial solutions, and what remains is of much more interest.
For $a,b,c,d\le20$, there are 5 solutions:
$4^3+5^3=7*3^3$
$2^3+7^3=13*3^3$
$1^3+8^3=19*3^3$
$3^3+5^3=19*2^3$
$1^3+19^3=20*7^3$
Under $100$ there are $16$ solutions, as found by Mathematica.
My question about this equation: Has it been studied previously? Are there infinitely many primitive solutions (which it seems like there are)? If so, can they be parametrized?
To show that there are infinitely many non-trivial solutions, it suffices to consider solutions of the following form, for $n=0,1,2\dots$
$\qquad a=3$
$\qquad b=24n+5$
$\qquad c=2$
$\qquad d=(3n+1)[9-3(24n+5)+(24n+5)^2]=1728n^3+1080n^2+225n+19$
Note that:
$$a^3+b^3 = (a+b)(a^2-ab+b^2)=(3+24n+5)[9-3(24n+5)+(24n+5)^2]$$
so that:
$$a^3+b^3=(3n+1)[9-3(24n+5)+(24n+5)^2]2^3=dc^3$$
and also:
$\gcd(a,b)=1$ since $24n+5\equiv2\pmod3$
$\gcd(a,c)=1$ and $\gcd(b,c)=1$ since $a,b$ odd.