{"schema":"vela.problem-packet.v0.1","problem":448,"statement":"Let $\\tau(n)$ count the divisors of $n$ and $\\tau^+(n)$ count the number of $k$ such that $n$ has a divisor in $[2^k,2^{k+1})$. Is it true that, for all $\\epsilon>0$,\\[\\tau^+(n) < \\epsilon \\tau(n)\\]for almost all $n$?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}