Displaying 1301 – 1320 of 1791

Showing per page

Shifted values of the largest prime factor function and its average value in short intervals

Jean-Marie De Koninck, Imre Kátai (2016)

Colloquium Mathematicae

We obtain estimates for the average value of the largest prime factor P(n) in short intervals [x,x+y] and of h(P(n)+1), where h is a complex-valued additive function or multiplicative function satisfying certain conditions. Letting s q ( n ) stand for the sum of the digits of n in base q ≥ 2, we show that if α is an irrational number, then the sequence ( α s q ( P ( n ) ) ) n is uniformly distributed modulo 1.

Sign changes of error terms related to arithmetical functions

Paulo J. Almeida (2007)

Journal de Théorie des Nombres de Bordeaux

Let H ( x ) = n x φ ( n ) n - 6 π 2 x . Motivated by a conjecture of Erdös, Lau developed a new method and proved that # { n T : H ( n ) H ( n + 1 ) < 0 } T . We consider arithmetical functions f ( n ) = d n b d d whose summation can be expressed as n x f ( n ) = α x + P ( log ( x ) ) + E ( x ) , where P ( x ) is a polynomial, E ( x ) = - n y ( x ) b n n ψ x n + o ( 1 ) and ψ ( x ) = x - x - 1 / 2 . We generalize Lau’s method and prove results about the number of sign changes for these error terms.

Small discriminants of complex multiplication fields of elliptic curves over finite fields

Igor E. Shparlinski (2015)

Czechoslovak Mathematical Journal

We obtain a conditional, under the Generalized Riemann Hypothesis, lower bound on the number of distinct elliptic curves E over a prime finite field 𝔽 p of p elements, such that the discriminant D ( E ) of the quadratic number field containing the endomorphism ring of E over 𝔽 p is small. For almost all primes we also obtain a similar unconditional bound. These lower bounds complement an upper bound of F. Luca and I. E. Shparlinski (2007).

Currently displaying 1301 – 1320 of 1791