ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa and bb be positive integers with (a,b)=1(a,b)=1. The prime linear-representation conjecture. When n≥(a−1)(b−1)n\geq(a-1)(b-1), there always exists a pair of primes (x,y)(x,y) such that

ax+by=n.ax+by=n.

This is a prime-variable analogue of the classical coprime linear representation problem. The source gives numerical motivation but no proof of the general assertion, so it 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.