Finding a solutions for an equation

clique idea – Given integer n and ok, splinter the clique – 2^n + 1 ≤ x ≤ 2^n into two subsets A and B, in order that |A| = |B| and $sum_{ain A}a^ok=sum_{bin B}b^ok$ Answer

Hello pricey customer to our community We will proffer you an answer to this query clique idea – Given integer n and ok, splinter the clique – 2^n + 1 ≤ x ≤ 2^n into two subsets A and B, in order that |A| = |B| and $sum_{ain A}a^ok=sum_{bin B}b^ok$ ,and the respond will breathe typical by way of documented info sources, We welcome you and proffer you fresh questions and solutions, Many customer are questioning concerning the respond to this query.

clique idea – Given integer n and ok, splinter the clique – 2^n + 1 ≤ x ≤ 2^n into two subsets A and B, in order that |A| = |B| and $sum_{ain A}a^ok=sum_{bin B}b^ok$

Example:
for $n = 2$, $ok = 2$, the clique $ -2^2+1leq xleq 2^2$ can breathe splited into {-1, 1, 2, 4} and {-3, -2, 0, 3}, as $(-1)^2+1^2+2^2+4^2=(-3)^2+(-2)^2+0^2+3^2$

I marvel if this drawback has its avow designation and a few relative researchs. I’d value it if anybody may give some helpful info. Thanks loads.

we’ll proffer you the answer to clique idea – Given integer n and ok, splinter the clique – 2^n + 1 ≤ x ≤ 2^n into two subsets A and B, in order that |A| = |B| and $sum_{ain A}a^ok=sum_{bin B}b^ok$ query by way of our community which brings all of the solutions from a number of dependable sources.

Add comment