AbstractThe author has presented estimates for sums of multiplicative functions, satisfying certain conditions, extended over positive integers n such that n is less than or equal to xt, the greatest prime factor of n is at most equal to x, and n is relatively prime to a natural number k. These estimates are uniform in t, x, and k
82 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.Integers without large prime f...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
AbstractFor k a non-negative integer, let Pk(n) denote the kth largest prime factor of n where P0(n)...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
AbstractIt is shown that certain commonly occurring conditions may be factored out of sums of multip...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46603/1/222_2005_Article_BF01390204.pd
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions ...
AbstractTwo results are obtained about P(n), the largest prime factor of an integer n. The average v...
concerning the upper est’imate of.&f(n) = max N(12,x) = max j 2 p(d) /. * t din d<z Previo...
Let k be a positive integer and f a multiplicative function with 0 f(p) k for all primes p. Then, fo...
Let p(n) denote the smallest prime factor of an integer n>1 and let p(1)=[infinity]. We study the...
Copyright c © 2014 Rafael Jakimczuk. This is an open access article distributed under the Creative C...
summary:In this note, we show that the counting function of the number of composite positive integer...
82 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.Integers without large prime f...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
AbstractFor k a non-negative integer, let Pk(n) denote the kth largest prime factor of n where P0(n)...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
AbstractIt is shown that certain commonly occurring conditions may be factored out of sums of multip...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46603/1/222_2005_Article_BF01390204.pd
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions ...
AbstractTwo results are obtained about P(n), the largest prime factor of an integer n. The average v...
concerning the upper est’imate of.&f(n) = max N(12,x) = max j 2 p(d) /. * t din d<z Previo...
Let k be a positive integer and f a multiplicative function with 0 f(p) k for all primes p. Then, fo...
Let p(n) denote the smallest prime factor of an integer n>1 and let p(1)=[infinity]. We study the...
Copyright c © 2014 Rafael Jakimczuk. This is an open access article distributed under the Creative C...
summary:In this note, we show that the counting function of the number of composite positive integer...
82 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.Integers without large prime f...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
DOI
Add to ORKG