Recursively divisible numbers

2019/12/17 by Fink, Thomas
#Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Number Theory (math.NT) #Statistical Mechanics (cond-mat.stat-mech)

paper · doi:10.48550/arxiv.1912.07979

Abstract

We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: κ_x(n) = n^x + ∑_{d\lfloor n} κ_x(d), where the sum is over the proper divisors of n. We give a geometrical interpretation of κ_x(n), which we use to derive a relation between κ_x(n) and κ₀(n). For x ≥ 2, we observe that κ_x(n)/n^x < 1/(2-ζ(x)). We show that, for n ≥ 2, κ₀(n) is twice the number of ordered factorizations, a problem much studied in its own right. By computing those numbers that are more recursively divisible than all of their predecessors, we recover many of the numbers prevalent in design and technology, and suggest new ones which have yet to be adopted.

Related

• Properties of the recursive divisor function and the number of ordered factorizations
• Number of ordered factorizations and recursive divisors
• A recursion for divisor function over divisors belonging to a prescribed finite sequence of positive integers and a solution of the Lahiri problem for divisor function σ_x(n)
• Divisor Functions and the Number of Sum Systems
• Some Properties and Applications of Non-trivial Divisor Functions