An asymptotic formula involving e-divisor function
Zhao Yuan-e
Abstract
Zhao Yuan-e
Abstract
Let n1 be an integer,and np~(α_1)_1p~(α_2)_2…p~(α_k)_k is it′s prime factorization.A number mp~(β_1)_1p~(β_2)_2…p~(β_r)_r is called an e-divisor of n if β_i|α_i with i1,2,…,k.Note d_e(n) is the number of all e-divisor of n.By using the analytic methods,the mean value properties of the e-divisor function on the set of k-full numbers are studied,and an interesting asymptotic formula is given.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let n1 be an integer,and np~(α_1)_1p~(α_2)_2…p~(α_k)_k is it′s prime factorization.A number mp~(β_1)_1p~(β_2)_2…p~(β_r)_r is called an e-divisor of n if β_i|α_i with i1,2,…,k.Note d_e(n) is the number of all e-divisor of n.By using the analytic methods,the mean value properties of the e-divisor function on the set of k-full numbers are studied,and an interesting asymptotic formula is given.
Key concepts: Divisor function, Divisor (algebraic geometry), Prime factor, Mathematics, Asymptotic formula, Integer (computer science), Combinatorics, Function (biology)