ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥2k \geq 2 be an integer and let m,n≥1m, n \geq 1 be integers with m≤nm \leq n. Suppose that x1,…,xmx_1, \ldots, x_m and y1,…,yny_1, \ldots, y_n are positive integers satisfying

∑i=1mxik=∑j=1nyjk,\sum_{i=1}^{m} x_i^{k} = \sum_{j=1}^{n} y_j^{k},

and suppose the equality is nontrivial in the sense that

xi≠yjfor all 1≤i≤m, 1≤j≤n,x_i \neq y_j \quad \text{for all } 1 \leq i \leq m, \ 1 \leq j \leq n,

so that no term occurs on both sides (repetitions of a value within one and the same side are permitted). Then

m+n≥k.m + n \geq k.

Equivalently, for all integers k≥2k \geq 2 and m,n≥1m, n \geq 1 with m+n<km + n < k, there exist no positive integers x1,…,xm,y1,…,ynx_1, \ldots, x_m, y_1, \ldots, y_n with ∑i=1mxik=∑j=1nyjk\sum_{i=1}^{m} x_i^{k} = \sum_{j=1}^{n} y_j^{k} and xi≠yjx_i \neq y_j for all i,ji, j.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.