ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be a primitive covering number, meaning a positive integer that is a covering number but has no proper divisor that is a covering number. Write its prime factorization as

L=p1a1⋯prar,L=p_1^{a_1}\cdots p_r^{a_r},

where p1,…,prp_1,\ldots,p_r are distinct primes and a1,…,ara_1,\ldots,a_r are positive integers. Sun's conjecture. Every primitive covering number can be written in this form with the primes and exponents satisfying the condition given in equation (Eq:Sun) of the source. The conjecture proposed a characterization of all primitive covering numbers; the paper states that it is false and provides infinitely many counterexamples.

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.