The distribution of prime divisors in composite almost-prime numbers

Let nn be a composite almost-prime number, and write ω(n)\omega(n) for the number of its prime divisors. Distribution conjecture. There exists an ϵ<1\epsilon<1 such that

#{pn | ω(p1)>2}<εω(n)\# \left\{p\mid n\ \middle|\ \omega(p-1)>2\right\}<\varepsilon\omega(n)

is satisfied for infinitely many composite almost-primes nn. The preceding restrictions in the source concern prime divisors pp with ω(p1)>2\omega(p-1)>2; the conjecture predicts that such divisors form a relatively small proportion for infinitely many composite almost-primes. Its resolution is not specified in the source.

Sources & referencesView supporting material

Primary source

Tigran Hakobyan, “T-Fermat integers”, arXiv:2603.00679 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.