ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, let D(n)D(n) denote its set of divisors and let τ(n)=∣D(n)∣\tau(n)=|D(n)|. Say that nn is strongly matchable if every coprime arithmetic progression of τ(n)\tau(n) integers admits a coprime matching to D(n)D(n). Say that nn is an M-number if it is not divisible by any ppp^p for a prime pp, equivalently if vp(n)≤p−1v_p(n)\leq p-1 for every prime pp. The strong matchability characterization conjecture. A number nn is strongly matchable if and only if it is an M-number. This would give an exact structural characterization of strong matchability, extending the preceding results on ordinary matchability and its asymptotic density. The statement is presented without resolution evidence in the source.

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.