The infinitude of composite almost-prime numbers
Statement
A positive integer is almost-prime if it is square-free and satisfies for every integer , where
and are all divisors of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.