ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers a,b,c,m,n,ka,b,c,m,n,k consider the system

am+bn=ck,gcd⁡(a,b,c)=1,1m+1n+1k<1.a^{m} + b^{n} = c^{k}, \qquad \gcd(a,b,c) = 1, \qquad \frac{1}{m} + \frac{1}{n} + \frac{1}{k} < 1 .

Let

S={(am, bn, ck)  :  a,b,c,m,n,k∈Z>0, am+bn=ck, gcd⁡(a,b,c)=1, 1m+1n+1k<1}⊆Z>03,S = \left\{ (a^{m},\, b^{n},\, c^{k}) \;:\; a,b,c,m,n,k \in \mathbb{Z}_{>0},\ a^{m}+b^{n}=c^{k},\ \gcd(a,b,c)=1,\ \tfrac{1}{m}+\tfrac{1}{n}+\tfrac{1}{k}<1 \right\} \subseteq \mathbb{Z}_{>0}^{3},

the set of triples of powers occurring in such solutions. Then SS is finite; that is, there are only finitely many solutions (a,b,c,m,n,k)(a,b,c,m,n,k) with pairwise distinct triples (am,bn,ck)(a^{m}, b^{n}, c^{k}).

Here the inequality 1m+1n+1k<1\frac{1}{m}+\frac{1}{n}+\frac{1}{k}<1 is an essential hypothesis: without it the corresponding set of triples of powers is infinite, as shown by k=1k=1 with c=am+bnc = a^{m}+b^{n} for arbitrary a,b,m,na,b,m,n, and by m=n=k=2m=n=k=2 with (a,b,c)(a,b,c) any primitive Pythagorean triple.

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.