Erdös and Selfridge first showed that the product of consecutive integers cannot be a perfect power. Later, this result was generalized to polynomial values by various authors. They demonstrated that the product of consecutive polynomial values cannot be the perfect power for a suitable polynomial. In this article, we consider a related problem to the product of consecutive integers. We consider all sequences of polynomial values from a given interval whose products are almost perfect powers. We study the size of these powers and give an asymptotic result. We also define a group theoretic invariant, which is a natural generalization of the Davenport constant. We provide a non-trivial upper bound of this group theoretic invariant.

This paper is concerned with the relationship of $y$-smooth integers and de Bruijn's approximation $\Lambda (x,\,y)$. Under the Riemann hypothesis, Saias proved that the count of $y$-smooth integers up to $x$, $\Psi (x,\,y)$, is asymptotic to $\Lambda (x,\,y)$ when $y \ge (\log x)^{2+\varepsilon }$. We extend the range to $y \ge (\log x)^{3/2+\varepsilon }$ by introducing a correction factor that takes into account the contributions of zeta zeros and prime powers. We use this correction term to uncover a lower order term in the asymptotics of $\Psi (x,\,y)/\Lambda (x,\,y)$. The term relates to the error term in the prime number theorem, and implies that large positive (resp. negative) values of $\sum _{n \le y} \Lambda (n)-y$ lead to large positive (resp. negative) values of $\Psi (x,\,y)-\Lambda (x,\,y)$, and vice versa. Under the Linear Independence hypothesis, we show a Chebyshev's bias in $\Psi (x,\,y)-\Lambda (x,\,y)$.

Let $g \geq 1$ be an integer and let $A/\mathbb Q$ be an abelian variety that is isogenous over $\mathbb Q$ to a product of g elliptic curves defined over $\mathbb Q$ , pairwise non-isogenous over $\overline {\mathbb Q}$ and each without complex multiplication. For an integer t and a positive real number x, denote by $\pi _A(x, t)$ the number of primes $p \leq x$ , of good reduction for A, for which the Frobenius trace $a_{1, p}(A)$ associated to the reduction of A modulo p equals t. Assuming the Generalized Riemann Hypothesis for Dedekind zeta functions, we prove that $\pi _A(x, 0) \ll _A x^{1 - \frac {1}{3 g+1 }}/(\operatorname {log} x)^{1 - \frac {2}{3 g+1}}$ and $\pi _A(x, t) \ll _A x^{1 - \frac {1}{3 g + 2}}/(\operatorname {log} x)^{1 - \frac {2}{3 g + 2}}$ if $t \neq 0$ . These bounds largely improve upon recent ones obtained for $g = 2$ by Chen, Jones, and Serban, and may be viewed as generalizations to arbitrary g of the bounds obtained for $g=1$ by Murty, Murty, and Saradha, combined with a refinement in the power of $\operatorname {log} x$ by Zywina. Under the assumptions stated above, we also prove the existence of a density one set of primes p satisfying $|a_{1, p}(A)|>p^{\frac {1}{3 g + 1} - \varepsilon }$ for any fixed $\varepsilon>0$ .

Halász’s theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\leqslant 1$ has either mean value $0$, or is ‘close to’ $n^{it}$ for some fixed $t$. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to treat short intervals and arithmetic progressions. We use these results to obtain new, arguably simpler, proofs that there are always primes in short intervals (Hoheisel’s theorem), and that there are always primes near to the start of an arithmetic progression (Linnik’s theorem).

Let $f$ and $g$ be 1-bounded multiplicative functions for which $f\ast g=1_{.=1}$. The Bombieri–Vinogradov theorem holds for both $f$ and $g$ if and only if the Siegel–Walfisz criterion holds for both $f$ and $g$, and the Bombieri–Vinogradov theorem holds for $f$ restricted to the primes.

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation

$$\begin{eqnarray*}\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}\end{eqnarray*}$$

$x, y, z$

$f(n)\gt 0$

$n\geq 2$

$f(n)$

$f(p)$

$n$

$p$

$$\begin{eqnarray*}N\hspace{0.167em} {\mathop{\log }\nolimits }^{2} N\ll \displaystyle \sum _{p\leq N}f(p)\ll N\hspace{0.167em} {\mathop{\log }\nolimits }^{2} N\log \log N.\end{eqnarray*}$$

Let a be an integer different from 0, ±1, or a perfect square. We consider a conjecture of Erdős which states that #{p:ℓa(p)=r}≪εrε for any ε>0, where ℓa(p) is the order of a modulo p. In particular, we see what this conjecture says about Artin’s primitive root conjecture and compare it to the generalized Riemann hypothesis and the ABC conjecture. We also extend work of Goldfeld related to divisors of p+a and the order of a modulo p.

We consider logarithmic averages, over friable integers, of non-negative multiplicative functions. Under logarithmic, one-sided or two-sided hypotheses, we obtain sharp estimates that improve upon known results in the literature regarding both the quality of the error term and the range of validity. The one-sided hypotheses correspond to classical sieve assumptions. They are applied to provide an effective form of the Johnsen–Selberg prime power sieve.

In this paper we study the size of the value set of the Carmichael λ-functions.

The summatory function of the Möbius function is denoted $M(x)$. In this article we deduce conditional results concerning $M(x)$ assuming the Riemann hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the Riemann zeta function. Assuming these conjectures, we show that $M(x)$, when appropriately normalized, possesses a limiting distribution, and also that a strong form of the weak Mertens conjecture is true. Finally, we speculate on the lower order of $M(x)$ by studying the constructed distribution function.

For given multiplicative function $f$, with $\left| f\left( n \right) \right|\le 1$ for all $n$, we are interested in how fast its mean value $\left( 1/x \right)\sum{_{n\le x}f\left( n \right)}$ converges. Halász showed that this depends on the minimum $M\,\left( \text{over}\,y\,\in \,\mathbb{R} \right)\,\text{of}\,\sum{_{p\le x}\left( 1-\operatorname{Re}\left( f\left( p \right){{p}^{-iy}} \right) \right)}/p$, and subsequent authors gave the upper bound $\ll \left( 1+M \right){{e}^{-M}}$. For many applications it is necessary to have explicit constants in this and various related bounds, and we provide these via our own variant of the Halász-Montgomery lemma (in fact the constant we give is best possible up to a factor of 10). We also develop a new type of hybrid bound in terms of the location of the absolute value of $y$ that minimizes the sum above. As one application we give bounds for the least representatives of the cosets of the $k$-th powers mod $p$.

A conjecture of Brown and Zassenhaus (see [2]) states that the first log/? primes generate a primitive root (mod p) for almost all primes p. As a consequence of a Theorem of Burgess and Elliott (see [3]) it is easy to see that the first log2p log log4+∊p primes generate a primitive root (mod p) for almost all primes p. We improve this showing that the first log2p/ log log p primes generate a primitive root (mod p) for almost all primes p.