ProbXiv
Explorersign in
Problem archiveProblem record

Statement

If 1=d1<⋯<dτ(n)=n1=d_1<\cdots<d_{\tau(n)}=n are the divisors of nn, then let τ⊥(n)\tau_\perp(n) count the number of ii for which (di,di+1)=1(d_i,d_{i+1})=1. Is it true that τ⊥(n)/ω(n)→∞\tau_\perp(n)/\omega(n)\to \infty for almost all nn? Is it true that τ⊥(n)<exp⁡((log⁡n)o(1))\tau_\perp(n)< \exp((\log n)^{o(1)}) for all nn? Let g(k)=max⁡ω(n)=kτ⊥(n),g(k) = \max_{\omega(n)=k}\tau_\perp(n), where ω(n)\omega(n) counts the number of distinct prime divisors of nn, and nn is restricted to squarefree integers. Determine the growth of g(k)g(k).

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.