Displaying 1121 – 1140 of 1782

Showing per page

On the unimodal character of the frequency function of the largest prime factor

Jean-Marie De Koninck, Jason Pierre Sweeney (2001)

Colloquium Mathematicae

The main objective of this paper is to analyze the unimodal character of the frequency function of the largest prime factor. To do that, let P(n) stand for the largest prime factor of n. Then define f(x,p): = #{n ≤ x | P(n) = p}. If f(x,p) is considered as a function of p, for 2 ≤ p ≤ x, the primes in the interval [2,x] belong to three intervals I₁(x) = [2,v(x)], I₂(x) = ]v(x),w(x)[ and I₃(x) = [w(x),x], with v(x) < w(x), such that f(x,p) increases for p ∈ I₁(x), reaches its maximum value in...

On the value distribution of a class of arithmetic functions

Werner Georg Nowak (1996)

Commentationes Mathematicae Universitatis Carolinae

This article deals with the value distribution of multiplicative prime-independent arithmetic functions ( α ( n ) ) with α ( n ) = 1 if n is N -free ( N 2 a fixed integer), α ( n ) > 1 else, and α ( 2 n ) . An asymptotic result is established with an error term probably definitive on the basis of the present knowledge about the zeros of the zeta-function. Applications to the enumerative functions of Abelian groups and of semisimple rings of given finite order are discussed.

On the variation of certain fractional part sequences

Michel Balazard, Leila Benferhat, Mihoub Bouderbala (2021)

Communications in Mathematics

Let b > a > 0 . We prove the following asymptotic formula n 0 | { x / ( n + a ) } - { x / ( n + b ) } | = 2 π ζ ( 3 / 2 ) c x + O ( c 2 / 9 x 4 / 9 ) , with c = b - a , uniformly for x 40 c - 5 ( 1 + b ) 27 / 2 .

Optimality of Chebyshev bounds for Beurling generalized numbers

Harold G. Diamond, Wen-Bin Zhang (2013)

Acta Arithmetica

If the counting function N(x) of integers of a Beurling generalized number system satisfies both 1 x - 2 | N ( x ) - A x | d x < and x - 1 ( l o g x ) ( N ( x ) - A x ) = O ( 1 ) , then the counting function π(x) of the primes of this system is known to satisfy the Chebyshev bound π(x) ≪ x/logx. Let f(x) increase to infinity arbitrarily slowly. We give a construction showing that 1 | N ( x ) - A x | x - 2 d x < and x - 1 ( l o g x ) ( N ( x ) - A x ) = O ( f ( x ) ) do not imply the Chebyshev bound.

Oscillation of Mertens’ product formula

Harold G. Diamond, Janos Pintz (2009)

Journal de Théorie des Nombres de Bordeaux

Mertens’ product formula asserts that p x 1 - 1 p log x e - γ as x . Calculation shows that the right side of the formula exceeds the left side for 2 x 10 8 . It was suggested by Rosser and Schoenfeld that, by analogy with Littlewood’s result on π ( x ) - li x , this and a complementary inequality might change their sense for sufficiently large values of x . We show this to be the case.

Currently displaying 1121 – 1140 of 1782