ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers AA and BB, call ABAB cube-full when every prime divisor of ABAB occurs to exponent at least 33. The cube-full Catalan-type equation conjecture. Let r≥0r\geq0 be an integer. The Diophantine equation

{A−B=2r,AB is cube-full,\begin{cases} A-B=2^r,\\ AB\text{ is cube-full}, \end{cases}

has no solutions for r=0r=0, and has the unique solution (A,B)=(2r+1,2r)(A,B)=(2^{r+1},2^r) for r≥1r\geq1. The source reports computational verification up to B<A<106B<A<10^6, while the assertion for all rr remains open.

Record

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.