The Diophantine equation $x_1^6+x_2^6+y^6=z^2$ where both $(x_i)\equiv 0{\pmod 7}$.
As a logical follow on to The Diophantine equation $x_1^6+x_2^6+x_3^6=z^2$ where exactly one $(x_i)\equiv 0{\pmod 7}$. I have considered the case with exactly two of the sixth powers $\equiv 0{\pmod 7}$.
Although I’ve attempted two different methods, I’ve not found a solution up to $z=10^{12}$
Method 1
Calculate $(7a)^6+(7b)^6+y^6$ within a range, testing if each result is square.
Method 2
As I’m interested in primitive solutions,
$$x_1=7a$$ $$x_2=7b$$ $$7^6(a^6+b^6)=z^2-y^6=(z-y^3)(z+y^3)$$
Then either $(z-y^3)\equiv 0{\pmod 7^6}$ or $(z+y^3)\equiv 0{\pmod 7^6}$.
Using $f_1=z-y^3$ and $f_2=z+y^3$
when $z=7^6c+y^3$ we have $f_1=7^6c$
when $z=7^6d-y^3$ we have $f_2=7^6d$
----------
I’ve omitted much of the details of secondary modular tests from the above.
To my surprize, I found both methods ran at about the same speed.
My question
Can anyone find a non-trivial solution or prove any useful constrains (perhaps $z$ must be a cube as a wild guess) please?
Please note that I do not have access to an academic library.