Erdős problem 887Is there an absolute constant KK such that, for every C>0C > 0, if nn is sufficiently large then nn has at most KK divisors in (n12,n12+Cn14)(n^{\frac{1}{2}}, n^{\frac{1}{2}} + C n^{\frac{1}{4}}).WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 8875 retained source recordsCanvaspublic previewSource#887→ResultNone→Checks0