Y by
Let k,m,n>=2 positive integers and GCD(m,n)=1, Prove that the equation has infinitely many solutions in distict positive integers: x_1^m+x_2^m+⋯x_k^m=x_(k+1)^n
This post has been edited 1 time. Last edited by A_E_R, Apr 6, 2025, 9:54 AM
Reason: More understandable
Reason: More understandable