71 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.We investigate several problems related to the multiplicative structure of integers. First, we determine the order of magnitude of the function H2(x, y, z), the number of positive integers n ≤ x having exactly two divisors in ( y, z], in the range of y10 ≤ z ≤ x1/3, and that of the function H3(x, y, z), the number of positive integers n ≤ x having exactly three divisors in ( y, z], in the range of y10 ≤ z ≤ x1/4. Next, we introduce a new function H1,1(x, y, z 1, z2), the number of positive integers n ≤ x having one divisor in (y, z 1] and one divisor in (z1, z 2] and study its order of magnitude. Finally, we investigate problems about localizat...
This dissertation deals with four problems concerning arithmetic structures in dense sets of integer...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
In the multiplicative number theory we decompose a natural number n into prime factors and consider ...
AbstractLet 1=d1(n)<d2(n)<⋯<dτ(n)=n be the sequence of all positive divisors of the integer n in inc...
AbstractLet 1=d1(n)<d2(n)<⋯<dτ(n)=n be the sequence of all positive divisors of the integer n in inc...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
We estimate the density of integers which have more than one divisor in an interval (y, z] with z ≈ ...
summary:In this note, we study those positive integers $n$ which are divisible by $\sum _{d|n}\lambd...
We prove an upper bound for exponential sums associated to the divisor functions localized on multid...
We establish upper bounds for the number of smooth values of the Euler function. In particular, alth...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46612/1/222_2005_Article_BF01388495.pd
RésuméLet 1=d1(n)<d2(n)<…<dτ(n)=n be the sequence of all the divisors of the integer n in increasing...
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
AbstractFor any positive integers k and m, and any l, 0 ≤ l < m, we show that there is a number β = ...
This dissertation deals with four problems concerning arithmetic structures in dense sets of integer...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
In the multiplicative number theory we decompose a natural number n into prime factors and consider ...
AbstractLet 1=d1(n)<d2(n)<⋯<dτ(n)=n be the sequence of all positive divisors of the integer n in inc...
AbstractLet 1=d1(n)<d2(n)<⋯<dτ(n)=n be the sequence of all positive divisors of the integer n in inc...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
We estimate the density of integers which have more than one divisor in an interval (y, z] with z ≈ ...
summary:In this note, we study those positive integers $n$ which are divisible by $\sum _{d|n}\lambd...
We prove an upper bound for exponential sums associated to the divisor functions localized on multid...
We establish upper bounds for the number of smooth values of the Euler function. In particular, alth...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46612/1/222_2005_Article_BF01388495.pd
RésuméLet 1=d1(n)<d2(n)<…<dτ(n)=n be the sequence of all the divisors of the integer n in increasing...
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
AbstractFor any positive integers k and m, and any l, 0 ≤ l < m, we show that there is a number β = ...
This dissertation deals with four problems concerning arithmetic structures in dense sets of integer...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
In the multiplicative number theory we decompose a natural number n into prime factors and consider ...