Erdős Problem #1100 — If 1=d_1<…<d_τ(n)=n are the divisors of n, then let τ_⊥(n) count the number of i for which (d_i,d_i+1)=1.
Statement
If are the divisors of , then let count the number of for which . Is it true that for almost all ? Is it true that for all ? Let where counts the number of distinct prime divisors of , and is restricted to squarefree integers. Determine the growth of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.