Displaying 181 – 200 of 216

Showing per page

On the parity of generalized partition functions, III

Fethi Ben Saïd, Jean-Louis Nicolas, Ahlem Zekraoui (2010)

Journal de Théorie des Nombres de Bordeaux

Improving on some results of J.-L. Nicolas [15], the elements of the set 𝒜 = 𝒜 ( 1 + z + z 3 + z 4 + z 5 ) , for which the partition function p ( 𝒜 , n ) (i.e. the number of partitions of n with parts in 𝒜 ) is even for all n 6 are determined. An asymptotic estimate to the counting function of this set is also given.

On the range of Carmichael's universal-exponent function

Florian Luca, Carl Pomerance (2014)

Acta Arithmetica

Let λ denote Carmichael’s function, so λ(n) is the universal exponent for the multiplicative group modulo n. It is closely related to Euler’s φ-function, but we show here that the image of λ is much denser than the image of φ. In particular the number of λ-values to x exceeds x / ( l o g x ) . 36 for all large x, while for φ it is equal to x / ( l o g x ) 1 + o ( 1 ) , an old result of Erdős. We also improve on an earlier result of the first author and Friedlander giving an upper bound for the distribution of λ-values.

On the riemann zeta-function and the divisor problem

Aleksandar Ivić (2004)

Open Mathematics

Let Δ(x) denote the error term in the Dirichlet divisor problem, and E(T) the error term in the asymptotic formula for the mean square of ς 1 2 + i t . If E * t = E t - 2 π Δ * t / 2 π with Δ * x = - Δ x + 2 Δ 2 x - 1 2 Δ 4 x , then we obtain 0 T E * t 4 d t e T 16 / 9 + ε . We also show how our method of proof yields the bound r = 1 R t r - G t r + G ς 1 2 + i t 2 d t 4 e T 2 + e G - 2 + R G 4 T ε , where T 1/5+ε≤G≪T, T

On the riemann zeta-function and the divisor problem II

Aleksandar Ivić (2005)

Open Mathematics

Let Δ(x) denote the error term in the Dirichlet divisor problem, and E(T) the error term in the asymptotic formula for the mean square of ζ 1 2 + i t . If E *(t)=E(t)-2πΔ*(t/2π) with Δ * x + 2 Δ 2 x - 1 2 Δ 4 x , then we obtain 0 T E * t 5 d t ε T 2 + ε and 0 T E * t 544 75 d t ε T 601 225 + ε . It is also shown how bounds for moments of | E *(t)| lead to bounds for moments of ζ 1 2 + i t .

On the Riesz means of n/ϕ(n) - III

Ayyadurai Sankaranarayanan, Saurabh Kumar Singh (2015)

Acta Arithmetica

Let ϕ(n) denote the Euler totient function. We study the error term of the general kth Riesz mean of the arithmetical function n/ϕ(n) for any positive integer k ≥ 1, namely the error term E k ( x ) where 1 / k ! n x n / ϕ ( n ) ( 1 - n / x ) k = M k ( x ) + E k ( x ) . For instance, the upper bound for |Ek(x)| established here improves the earlier known upper bounds for all integers k satisfying k ( l o g x ) 1 + ϵ .

On the sphere problem.

Fernando Chamizo, Henryk Iwaniec (1995)

Revista Matemática Iberoamericana

One of the oldest problems in analytic number theory consists of counting points with integer coordinates in the d-dimensional ball. It is very easy to find a main term for the counting function, but the size of the error term is difficult to estimate (...).

On the spinor zeta functions problem: higher power moments of the Riesz mean

Haiyan Wang (2013)

Acta Arithmetica

Let F be a Siegel cusp form of integral weight k on the Siegel modular group Sp₂(ℤ) of genus 2. The coefficients of the spinor zeta function Z F ( s ) are denoted by cₙ. Let D ρ ( x ; Z F ) be the Riesz mean of cₙ. Kohnen and Wang obtained the truncated Voronoï-type formula for D ρ ( x ; Z F ) under the Ramanujan-Petersson conjecture. In this paper, we study the higher power moments of D ρ ( x ; Z F ) , and then derive an asymptotic formula for the hth (h=3,4,5) power moments of D ( x ; Z F ) by using Ivić’s large value arguments and other techniques.

On the sum of the first n values of the Euler function

R. Balasubramanian, Florian Luca, Dimbinaina Ralaivaosaona (2014)

Acta Arithmetica

Let ϕ(n) be the Euler function of n. We put E ( n ) = m n ϕ ( m ) - ( 3 / π ² ) n ² and give an asymptotic formula for the second moment of E(n).

Currently displaying 181 – 200 of 216