{"schema":"vela.problem-packet.v0.1","problem":449,"statement":"Let $r(n)$ count the number of $d_1,d_2$ such that $d_1\\mid n$ and $d_2\\mid n$ and $d_1<d_2<2d_1$. Is it true that, for every $\\epsilon>0$,\\[r(n) &#60; \\epsilon \\tau(n)\\]for almost all $n$, where $\\tau(n)$ is the number of divisors of $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)"}