ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A positive integer nn is almost-prime if it is square-free and satisfies n∣Tn(x)n\mid T_n(x) for every integer xx, where

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

and 1=d1<d2<⋯<dk=n1=d_1<d_2<\dots<d_k=n are all divisors of nn. Infinitude conjecture. There are infinitely many composite almost-prime numbers. Every almost-prime is either prime or a Carmichael number, so this conjecture asks for an infinite special subclass of the composite Carmichael numbers. Its resolution is not specified 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.