November 10, 2015
Let $n_1,\cdots,n_r$ be any finite sequence of integers and let $S$ be the set of all natural numbers $n$ for which there exists a divisor $d(x)=1+\sum_{i=1}^{deg(d)}c_ix^i$ of $x^n-1$ such that $c_i=n_i$ for $1\leq i \leq r$. In this paper we show that the set $S$ has a natural density. Furthermore, we find the value of the natural density of $S$.
August 15, 2018
Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this constant $\alpha$. We also show that the method developed can be applied to many similar problems that can be stated in terms of the divisor graph, including other questions about primitive sets, geometric-progression-free sets, and the di...
May 17, 2005
Let m(n) be the number of ordered factorizations of n in factors larger than 1. We prove that for every eps>0 n^{rho} m(n) < exp[(log n)^{1/rho}/(loglog n)^{1+eps}] holds for all integers n>n_0, while, for a constant c>0, n^{rho} m(n) > exp[c(log n)^{1/\rho}/(loglog n)^{1/rho}] holds for infinitely many positive integers n, where rho=1.72864... is the real solution to zeta(rho)=2. We investigate also arithmetic properties of m(n) and the number of distinct values of m(n).
March 7, 2024
An approximate divisor order is a partial order on the positive integers $\mathbb{N}^+$ that refines the divisor order and is refined by the additive total order. A previous paper studied such a partial order on $\mathbb{N}^+$, produced using the floor function. A positive integer $d$ is a floor quotient of $n$, denoted $d \,\preccurlyeq_{1}\, n$, if there is a positive integer $k$ such that $d = \lfloor{n / k}\rfloor$. The floor quotient relation defines a partial order on t...
June 2, 2018
The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$. However, the $j$th non-trivial divisor function $c_j$, which counts the ordered proper factorisations of a positive integer into $j$ factors, each of which is greater than or equal to 2, is rather less well-studied. We also consider associated di...
October 4, 2011
A set S of integers is said to be multiplicative if for every pair m and n of coprime integers we have that mn is in S iff both m and n are in S. Both Landau and Ramanujan gave approximations to S(x), the number of n<=x that are in S, for specific choices of S. The asymptotical precision of their respective approaches are being compared and related to Euler-Kronecker constants, a generalization of Euler's constant gamma=0.57721566.... This paper claims little originality, its...
March 22, 2005
The zeta-dimension of a set A of positive integers is the infimum s such that the sum of the reciprocals of the s-th powers of the elements of A is finite. Zeta-dimension serves as a fractal dimension on the positive integers that extends naturally usefully to discrete lattices such as the set of all integer lattice points in d-dimensional space. This paper reviews the origins of zeta-dimension (which date to the eighteenth and nineteenth centuries) and develops its basic...
October 15, 2009
We say that $d$ is an exponential unitary divisor of $n=p_1^{a_1}... p_r^{a_r}>1$ if $d=p_1^{b_1}... p_r^{b_r}$, where $b_i$ is a unitary divisor of $a_i$, i.e., $b_i\mid a_i$ and $(b_i,a_i/b_i)=1$ for every $i\in \{1,2,...,r\}$. We survey properties of related arithmetical functions and introduce the notion of exponential unitary perfect numbers.
June 5, 2013
Let $A$ be a set of $n$ positive integers. We say that a subset $B$ of $A$ is a divisor of $A$, if the sum of the elements in $B$ divides the sum of the elements in $A$. We are interested in the following extremal problem. For each $n$, what is the maximum number of divisors a set of $n$ positive integers can have? We determine this function exactly for all values of $n$. Moreover, for each $n$ we characterize all sets that achieve the maximum. We also prove results for the $...
November 21, 2008
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.