Multiplicative functions in arithmetic progressions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic progressions in multiplicative groups of finite fields

Let G be a multiplicative subgroup of the prime field Fp of size |G| > p1−κ and r an arbitrarily fixed positive integer. Assuming κ = κ(r) > 0 and p large enough, it is shown that any proportional subset A ⊂ G contains non-trivial arithmetic progressions of length r. The main ingredient is the Szemerédi-Green-Tao theorem. Introduction. We denote by Fp the prime field with p elements and Fp its ...

متن کامل

Alternating Sums Concerning Multiplicative Arithmetic Functions

We deduce asymptotic formulas for the alternating sums ∑ n≤x(−1)f(n) and ∑ n≤x(−1) 1 f(n) , where f is one of the following classical multiplicative arithmetic functions: Euler’s totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, ...

متن کامل

Primes in arithmetic progressions

Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-type estimates in the prime number theorem for arithmetic progressions, for all moduli k ≤ 72 and other small moduli.

متن کامل

Discrepancy in Arithmetic Progressions

It is proven that there is a two-coloring of the first n integers forwhich all arithmetic progressions have discrepancy less than const.n1/4. Thisshows that a 1964 result of K. F. Roth is, up to constants, best possible. Department of Applied Mathematics, Charles University, Malostranské nám. 25,118 00 Praha 1, Czech RepublicE-mail address: [email protected] Courant Insti...

متن کامل

On rainbow 4-term arithmetic progressions

{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales mathématiques du Québec

سال: 2013

ISSN: 2195-4755,2195-4763

DOI: 10.1007/s40316-013-0001-z