ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϵ>0\epsilon>0 and ω(n)\omega(n) count the number of distinct prime factors of nn. Are there infinitely many values of nn such that ω(n−k)<(1+ϵ)log⁡klog⁡log⁡k\omega(n-k) < (1+\epsilon)\frac{\log k}{\log\log k} for all k<nk<n which are sufficiently large depending on ϵ\epsilon only? Can one show the stronger version with ω(n−k)<log⁡klog⁡log⁡k+O(1)\omega(n-k) < \frac{\log k}{\log\log k}+O(1) is false?

Record

Added
Links

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.