ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥3k\geq 3 be an integer. Conjecture. There exists a primitive weird number having at least kk distinct prime factors. This would show that primitive weird numbers occur with arbitrarily many distinct prime factors; the source motivates the claim by the existence of weird numbers with six distinct prime factors, but gives no resolution.

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.