On the problem of Goldbach's type.
Let be a fixed integer. We study the asymptotic formula of , which is the number of positive integer solutions such that the polynomial is -free. We obtained the asymptotic formula of for all . Our result is new even in the case . We proved that , where is a constant depending on . This improves upon the error term obtained by G.-L. Zhou, Y. Ding (2022).
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 for all large x, while for φ it is equal to , 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.
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 . If with , then we obtain . We also show how our method of proof yields the bound , where T 1/5+ε≤G≪T, T
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 . If E *(t)=E(t)-2πΔ*(t/2π) with , then we obtain and It is also shown how bounds for moments of | E *(t)| lead to bounds for moments of .
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 where . For instance, the upper bound for |Ek(x)| established here improves the earlier known upper bounds for all integers k satisfying .