scholarly journals Théorèmes de type Fouvry–Iwaniec pour les entiers friables

2015 ◽  
Vol 151 (5) ◽  
pp. 828-862 ◽  
Author(s):  
Sary Drappeau
Keyword(s):  
Recent Work ◽  
Prime Factor ◽  
Arithmetic Progressions ◽  
Dispersion Method ◽  
Fixed Integer ◽  
Residue Classes

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-{\it\varepsilon}$ when $(\log x)^{c}\leqslant x\leqslant x^{1/c}$ for some $c=c({\it\varepsilon})\geqslant 1$, that is to say, they are well distributed in the residue classes of a fixed integer $a$, on average over moduli ${\leqslant}x^{3/5-{\it\varepsilon}}$ for each fixed $a\neq 0$ and ${\it\varepsilon}>0$. We apply this to the estimation of the sum $\sum _{2\leqslant n\leqslant x,P^{+}(n)\leqslant y}{\it\tau}(n-1)$ when $(\log x)^{c}\leqslant y$. This follows and improves on previous work of Fouvry and Tenenbaum. Our proof combines the dispersion method of Linnik in the setting of Bombieri, Fouvry, Friedlander and Iwaniec with recent work of Harper on friable integers in arithmetic progressions.

scholarly journals Limiting Properties of the Distribution of Primes in an Arbitrarily Large Number of Residue Classes

2020 ◽  
Vol 63 (4) ◽  
pp. 837-849 ◽  
Author(s):  
Lucile Devin
Keyword(s):  
Riemann Hypothesis ◽  
Linear Independence ◽  
Classical Case ◽  
Weak Version ◽  
Distribution Of Primes ◽  
Logarithmic Density ◽  
Fixed Integer ◽  
Residue Classes ◽  
Independence Hypothesis ◽  
And Function

AbstractWe generalize current known distribution results on Shanks–Rényi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function field analogues developed in the recent years. More precisely, let $\unicode[STIX]{x1D70B}(x;q,a)$ be the number of primes up to $x$ that are congruent to $a$ modulo $q$. For a fixed integer $q$ and distinct invertible congruence classes $a_{0},a_{1},\ldots ,a_{D}$, assuming the generalized Riemann Hypothesis and a weak version of the linear independence hypothesis, we show that the set of real $x$ for which the inequalities $\unicode[STIX]{x1D70B}(x;q,a_{0})>\unicode[STIX]{x1D70B}(x;q,a_{1})>\cdots >\unicode[STIX]{x1D70B}(x;q,a_{D})$ are simultaneously satisfied admits a logarithmic density.

scholarly journals The variance of divisor sums in arithmetic progressions

2018 ◽  
Vol 30 (2) ◽  
pp. 269-293
Author(s):  
Brad Rodgers ◽  
Kannan Soundararajan
Keyword(s):  
Arithmetic Progressions ◽  
Large Sieve ◽  
Restricted Range ◽  
Divisor Function ◽  
Residue Classes ◽  
Divisor Sums

AbstractWe study the variance of sums of thek-fold divisor function{d_{k}(n)}over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture about the asymptotics of this variance. This result is closely related to moments of DirichletL-functions, and our proof relies on the asymptotic large sieve.

scholarly journals Product of primes in arithmetic progressions

2019 ◽  
Vol 16 (04) ◽  
pp. 747-766
Author(s):  
Olivier Ramaré ◽  
Priyamvad Srivastav ◽  
Oriol Serra
Keyword(s):  
Natural Number ◽  
Arithmetic Progressions ◽  
Residue Classes ◽  
Primes In Arithmetic Progressions ◽  
Number Formula ◽  
Special Case

We prove that, for all [Formula: see text] and for all invertible residue classes [Formula: see text] modulo [Formula: see text], there exists a natural number [Formula: see text] that is congruent to [Formula: see text] modulo [Formula: see text] and that is the product of exactly three primes, all of which are below [Formula: see text]. The proof is further supplemented with a self-contained proof of the special case of the Kneser Theorem we use.

scholarly journals The Number of Unitarily k-Free Divisors of An Integer

1976 ◽  
Vol 21 (1) ◽  
pp. 19-35
Author(s):  
D. Suryanarayana ◽  
R. Sita Rama Chandra Rao
Keyword(s):  
Positive Integer ◽  
Prime Factor ◽  
Canonical Representation ◽  
Fixed Integer ◽  
Unitary Divisor ◽  
Free Divisors

Let k be a fixed integer ≧ 2. A positive integer n is called unitarily k-free, if the multiplicity of each prime factor of n is not a multiple of k; or equivalently, if n is not divisible unitarily by the k-th power of any integer > 1. By a unitary divisor, we mean as usual, a divisor d> 0 of n such that (d, n/d) = 1. The interger 1 is also considered to be unitarily k-free. The concept of a unitarily k-free integer was first introduced by Cohen (1961; §1). Let denote the set of unitarily k-free integers. When k = 2, the set coincides with the set Q* of exponentially odd integers (that is, integers in whose canonical representation each exponent is odd) discussed by Cohen himself in an earlier paper (1960; §1 and §6). A divisor d > 0 of the positive integer n is called a unitarily k-free divisor of n if d ∈ . Let (n) denote the number of unitarily k-free divisors of n.

scholarly journals ON A THEOREM OF HERSTEIN

1990 ◽  
Vol 21 (2) ◽  
pp. 123-130
Author(s):  
CHEN-TE YEN
Keyword(s):  
Polynomial Identity ◽  
Associative Ring ◽  
Prime Factor ◽  
Subdirectly Irreducible ◽  
Fixed Integer

Let $R$ be an associative ring with identity such that for some fixed integer $m >1$, $(x+y)^m =x^m+y^m$ for all $x,y$ in $R$. If $m =2$ (mod 4) ,or $p-1|m-1$ for each prime factor $p$ of $m$, then $R$ is commutative. The restriction on $m$ is essential. Moreover, in case of $m=2$ (mod 4) and $m >2$, then $R$ is isomorphic to a subdirect sum of subdirectly irreducible rings $R_i$ each of which, as homomorphic images of $R$, satisfies the same polynomial identity $(x +y)^m =x^m +y^m$; and for each $x$ in $R_i$;,either $x^2 =0$ or $x^{2q} =1$, where $(q,m)=1$.

scholarly journals Thue-like Sequences and Rainbow Arithmetic Progressions

10.37236/1660 ◽  
2002 ◽  
Vol 9 (1) ◽  
Author(s):  
Jaroslaw Grytczuk
Keyword(s):  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Euclidean Spaces ◽  
Open Problems ◽  
Lovász Local Lemma ◽  
Fixed Integer ◽  
Local Lemma ◽  
Minimum Number ◽  
Lovasz Local Lemma ◽  
Positive Integers

A sequence $u=u_{1}u_{2}...u_{n}$ is said to be nonrepetitive if no two adjacent blocks of $u$ are exactly the same. For instance, the sequence $a{\bf bcbc}ba$ contains a repetition $bcbc$, while $abcacbabcbac$ is nonrepetitive. A well known theorem of Thue asserts that there are arbitrarily long nonrepetitive sequences over the set $\{a,b,c\}$. This fact implies, via König's Infinity Lemma, the existence of an infinite ternary sequence without repetitions of any length. In this paper we consider a stronger property defined as follows. Let $k\geq 2$ be a fixed integer and let $C$ denote a set of colors (or symbols). A coloring $f:{\bf N}\rightarrow C$ of positive integers is said to be $k$-nonrepetitive if for every $r\geq 1$ each segment of $kr$ consecutive numbers contains a $k$-term rainbow arithmetic progression of difference $r$. In particular, among any $k$ consecutive blocks of the sequence $f=f(1)f(2)f(3)...$ no two are identical. By an application of the Lovász Local Lemma we show that the minimum number of colors in a $k$-nonrepetitive coloring is at most $2^{-1}e^{k(2k-1)/(k-1)^{2}}k^{2}(k-1)+1$. Clearly at least $k+1$ colors are needed but whether $O(k)$ suffices remains open. This and other types of nonrepetitiveness can be studied on other structures like graphs, lattices, Euclidean spaces, etc., as well. Unlike for the classical Thue sequences, in most of these situations non-constructive arguments seem to be unavoidable. A few of a range of open problems appearing in this area are presented at the end of the paper.

On the Sums Running over Reduced Residue Classes Evaluated at Polynomial Arguments

2020 ◽  
Author(s):  
Mehdi Hassani ◽  
Mahmoud Marie Marie
Keyword(s):  
Euler Function ◽  
Fixed Integer ◽  
Residue Classes

For a given polynomial G we study the sums φm(n) := ∑′km and φG(n) = ∑′G(k) where m ≥ 0 is a fixed integer and ∑′ runs through all integers k with 1 ≤ k ≤ n and gcd(k, n) = 1. Although, for m ≥ 1 the function φm is not multiplicative, analogue to the Euler function we obtain expressions for φm(n) and φG(n). Also, we estimate the averages ∑n≤x φm(n) and ∑n≤xφG(n), as more as, the alternative averages ∑n≤x(−1)n−1φm(n) and ∑n≤x(−1)n−1φG(n).

scholarly journals Vanishing coefficients in some q-series expansions

2019 ◽  
Vol 15 (04) ◽  
pp. 763-773 ◽  
Author(s):  
Dazhao Tang
Keyword(s):  
Recent Work ◽  
Arithmetic Progressions ◽  
Series Expansions

Motivated by the recent work of Hirschhorn on vanishing coefficients of the arithmetic progressions in certain [Formula: see text]-series expansions, we study some variants of these [Formula: see text]-series and prove some comparable results. For instance, let [Formula: see text] then [Formula: see text]

scholarly journals Discrepancy of Cartesian Products of Arithmetic Progressions

10.37236/1758 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Benjamin Doerr ◽  
Anand Srivastav ◽  
Petra Wehr
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Arithmetic Progressions ◽  
Cartesian Products ◽  
Fixed Integer ◽  
Higher Dimensional ◽  
Special Cases ◽  
Dimensional Version ◽  
Compact Abelian Groups ◽  
Combinatorial Discrepancy

We determine the combinatorial discrepancy of the hypergraph ${\cal H}$ of cartesian products of $d$ arithmetic progressions in the $[N]^d$–lattice ($[N] = \{0,1,\ldots,N-1\}$). The study of such higher dimensional arithmetic progressions is motivated by a multi-dimensional version of van der Waerden's theorem, namely the Gallai-theorem (1933). We solve the discrepancy problem for $d$–dimensional arithmetic progressions by proving ${\rm disc}({\cal H}) = \Theta(N^{d/4})$ for every fixed integer $d \ge 1$. This extends the famous lower bound of $\Omega(N^{1/4})$ of Roth (1964) and the matching upper bound $O(N^{1/4})$ of Matoušek and Spencer (1996) from $d=1$ to arbitrary, fixed $d$. To establish the lower bound we use harmonic analysis on locally compact abelian groups. For the upper bound a product coloring arising from the theorem of Matoušek and Spencer is sufficient. We also regard some special cases, e.g., symmetric arithmetic progressions and infinite arithmetic progressions.

scholarly journals On the regularity of primes in arithmetic progressions

2017 ◽  
Vol 13 (05) ◽  
pp. 1349-1361
Author(s):  
Christian Elsholtz ◽  
Niclas Technau ◽  
Robert Tichy
Keyword(s):  
Positive Integer ◽  
Number Fields ◽  
Arithmetic Progressions ◽  
Prime Ideals ◽  
General Situation ◽  
Residue Classes ◽  
Primes In Arithmetic Progressions

We prove that for a positive integer [Formula: see text] the primes in certain kinds of intervals cannot distribute too “uniformly” among the reduced residue classes modulo [Formula: see text]. Hereby, we prove a generalization of a conjecture of Recaman and establish our results in a much more general situation, in particular for prime ideals in number fields.

Sign in / Sign up

Export Citation Format

Share Document