ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≥3p\ge 3 be prime and set Np=2p−1N_p=2^p-1. Write ω(Np)\omega(N_p) for the number of distinct prime factors of NpN_p. The distinct-factor bound conjecture. There exists p0p_0 such that, for every prime p>p0p>p_0,

ω(Np)<1.36log⁡p.\omega(N_p)<1.36\log p.

This is motivated by sieve heuristics for integers whose prime factors satisfy congruence restrictions; it would imply that only finitely many primes pp violate the displayed bound.

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.