The Diophantine equation 2A6 + B6 = 2C6 + D3 has infinitely many nontrivial
and primitive solutions in positive integers (A;B;C;D) = f4p(p + q); (4p2 .. 2pq .. q2); (4p2 +
q2); (16p4 +48p3q +12p2q2 +4pq3 ..q4)g where p; q 2 N such that either (i). p = q = 1, or (ii).
p > q, gcd(2p; q) = 1, and (p + q) has prime factors i; i2N 2; or 3(mod 4).