ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer nn, let

Tn(x)=xd1+xd2+⋯+xdk−kx,T_n(x)=x^{d_1}+x^{d_2}+\dots+x^{d_k}-kx,

where 1=d1<d2<⋯<dk=n1=d_1<d_2<\dots<d_k=n are all divisors of nn. A positive integer nn is weakly almost-prime if n∣Tn(x)n\mid T_n(x) for every integer xx; if it is also square-free, it is almost-prime. Existence conjecture. There are no composite weakly almost-prime numbers greater than four and no composite almost-prime numbers. The source phrases this as a question, so its resolution is not specified here.

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.