{"paper":{"title":"The Repeated Divisor Function and Possible Correlation with Highly Composite Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Arghya Dutta, Sayak Chakrabarty","submitted_at":"2017-03-31T17:44:41Z","abstract_excerpt":"Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \\leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \\geq 2$ and in this paper we try to find the smallest $k$ such that $d(d(...d(n)...)) = 2$ where the divisor function is applied $k$ times. At the end of the paper we make a conjecture based on some observations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00007","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}