ID: 1704.00007

The Repeated Divisor Function and Possible Correlation with Highly Composite Numbers

March 31, 2017

View on ArXiv
Sayak Chakrabarty, Arghya Dutta
Mathematics
General Mathematics

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.

Similar papers 1

Highly Composite Numbers

April 27, 2023

88% Match
Lars Magnus Ă˜verlier
Number Theory

The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used many times throughout the thesis and allows us to write a proof that is as simple (and as short) as possible. This thesis is meant to solve the open problem from the ``On-Line Encyclopedia of Integer Sequences" (OEIS): A189394 [3]. The main ...

Find SimilarView on arXiv

On the number of partitions of a number into distinct divisors

February 12, 2024

87% Match
Noah Lebowitz-Lockard, Joseph Vandehey
Number Theory

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is unusually large.

Find SimilarView on arXiv
85% Match
Thomas Fink
Number Theory
Statistical Mechanics
Combinatorics

We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: $\kappa_x(n) = n^x + \sum_{d\lfloor n} \kappa_x(d)$, where the sum is over the proper divisors of $n$. We give a geometrical interpretation of $\kappa_x(n)$, which we use to derive a relation between $\kappa_x(n)$ and $\kappa_0(n)$. For $x \geq 2$, we observe that $\kappa_x(n)/n^x < 1/(2-\zeta(x))$. We show that, for $n \geq 2$, $\kappa_0(n)$ is twice the number of ordered...

Repeated values of some restricted divisor functions

October 16, 2022

84% Match
Qi-Yang Zheng
Number Theory

We prove that $d_k(n)=d_k(n+B)$ infinitely often for any positive integers $k$ and $B$, where $d_k(n)$ denotes the number of divisors of $n$ coprime to $k$.

Find SimilarView on arXiv

The sum of the unitary divisor function

December 17, 2013

83% Match
Tim Trudgian
Number Theory

This article establishes a new upper bound on the function $\sigma^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.

Find SimilarView on arXiv

On the Oppenheim's "factorisatio numerorum" function

July 7, 2008

83% Match
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas
Number Theory

Let $f(n)$ denote the number of distinct unordered factorisations of the natural number $n$ into factors larger than 1.In this paper, we address some aspects of the function $f(n)$.

Find SimilarView on arXiv

Some observations and speculations on partitions into $d$-th powers

February 10, 2021

82% Match
Maciej Ulas
Number Theory
Combinatorics

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of $p_{d}(n)$ a little is known. In the first part of the paper, we prove certain congruences involving functions counting various types of partitions into $d$-th powers. The second part of the paper has experimental nature and contains questi...

Find SimilarView on arXiv

On the variance of sums of divisor functions in short intervals

February 4, 2015

82% Match
Stephen Lester
Number Theory

Given a positive integer $n$ the $k$-fold divisor function $d_k(n)$ equals the number of ordered $k$-tuples of positive integers whose product equals $n$. In this article we study the variance of sums of $d_k(n)$ in short intervals and establish asymptotic formulas for the variance of sums of $d_k(n)$ in short intervals of certain lengths for $k=3$ and for $k \ge 4$ under the assumption of the Lindel\"of hypothesis.

Find SimilarView on arXiv

A hybrid inequality for the number of divisors of an integer

November 22, 2020

82% Match
Patrick Letendre
Number Theory

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

Find SimilarView on arXiv

An Explicit Formula For The Divisor Function

May 16, 2014

82% Match
N. A. Carella
General Mathematics

The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and circle problem.

Find SimilarView on arXiv