Related papers: Entiers friables dans des progressions arithm\'eti…

A natural integer is called $y$-ultrafriable if none of the prime powers occurring in its canonical decomposition exceed $y$. We investigate the distribution of $y$-ultrafriable integers not exceeding $x$ among arithmetic progressions to…

An integer is said to be $y$-friable if its greatest prime factor is less than $y$. In this paper, we obtain estimates for exponential sums over $y$-friable numbers up to $x$ which are non-trivial when $y \geq \exp\{c \sqrt{\log x} \log…

A number is said to be $y$-friable if it has no prime factor greater than $y$. In this paper, we prove a central limit theorem on average for the distribution of divisors of $y$-friable numbers less than $x$, for all $(x, y)$ satisfying…

An integer n is said to be y-friable if its largest prime factor $P^+(n)$ is less than y. In this paper, it is shown that the y-friable integers less than x have a weak exponent of distribution at least $3/5-\varepsilon$ when $(\log…

We investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over…

An integer is said to be $y$-friable if its greatest prime factor P(n) is less than $y$. In this paper, we study numbers of the shape $n-1$ when $P(n)\leq y$ and $n\leq x$. One expects that, statistically, their multiplicative behaviour…

Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example,…

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

The standard probability law on the set $S(x,y)$ of $y$-friable integers not exceeding $x$ assigns to each friable integer $n$ a probability proportional to $1/n^\alpha$ where $\alpha=\alpha(x,y)$ is the saddle-point of the inverse Laplace…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Andrade and Keating computed the mean value of quadratic Dirichlet $L$--functions at the critical point, in the hyperelliptic ensemble over a fixed finite field $\mathbb{F}_q$. Summing $L(1/2,\chi_D)$ over monic, square-free polynomials $D$…

Let $F(X_1,X_2)\in\mathbb{Z}[X_1,X_2] $ be an irreducible binary form of degree $3$ and $h$ an arithmetic function. We give some estimates for the average order $\sum_{\substack{|n_1|\leq x,|n_2|\leq x}}h(F(n_1,n_2))$ when $h$ satisfy…

We consider a sequence $\{f(p)\}_{p\ {\rm prime}}$ of independent random variables taking values $\pm 1$ with probability $1/2$, and extend $f$ to a multiplicative arithmetic function defined on the squarefree integers. We investigate upper…

Elaborating on previous works and taking advantage of estimates on the local behaviour of the counting function of friable integers, we determine the optimal range in which the friable Tur\'an-Kubilius constant tends to $1$.

Let $E_x(q,a)$ be the error term when counting primes in arithmetic progressions and let $M(Q)=\sum_{q\leq Q}\phi(q)\sum_{a=1}^qE_x(q,a)^3$. We show that $M(Q)<<Q^3(x/Q)^{7/5}$ for large $Q$ close to $x$ (in the usual BDH sense) thereby…

In this paper, we explore the existence of $m$-terms arithmetic progressions in $\mathbb{F}_{q^n}$ with a given common difference whose terms are all primitive elements, and at least one of them is normal. We obtain asymptotic results for…

Let $\mathcal{A}$ be a finite set of positive integers and $y\geq 1$. We give an effective lower bound of the cardinality of the set $\{n\in\mathcal{A};\,p|n\Longrightarrow p\leq y\}$ under the condition of a good knowledge of the level of…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

According to a general probabilistic principle, the natural divisors of friable integers (i.e.~free of large prime factors) should normally present a Gaussian distribution. We show that this indeed is the case with conditional density…

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…