English
Related papers

Related papers: Breaking the 6/5 threshold for sums and products m…

200 papers

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

Number Theory · Mathematics 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

Let c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x^1/2 and ab is less than n^c. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce…

Number Theory · Mathematics 2020-11-24 Roger Baker , Glyn Harman

We prove a supercongruence modulo $p^3$ between the $p$th Fourier coefficient of a weight 6 modular form and a truncated ${}_6F_5$-hypergeometric series. Novel ingredients in the proof are the comparison of two rational approximations to…

Number Theory · Mathematics 2021-02-04 Robert Osburn , Armin Straub , Wadim Zudilin

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

Number Theory · Mathematics 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

Number Theory · Mathematics 2023-04-19 Moubariz Z. Garaev , Igor E. Shparlinski

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Number Theory · Mathematics 2020-06-30 Komal Agrawal , Paul Pollack

We show that for any $P= 6^{m+1}.N -1 $ is a prime number for any $1 < N \le 13$ , $N \ne 8$ and $N \ne i^{m+1}Mod(6i+1) $ where $ i \in Z^+ $ and $ m \in $ $odd$ $Z^+ $ for $1 < N \le 13$ and $N \ne 8$ and also we further discussed that…

General Mathematics · Mathematics 2018-10-05 Gandarawatta R. W. M. P. I. S. B. , Perera S. P. C. , Rathnayake R. M. L. S.

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place…

Number Theory · Mathematics 2014-02-26 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yildirim

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

Combinatorics · Mathematics 2016-11-29 Shanshan Du , Hao Pan

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Number Theory · Mathematics 2025-11-25 Chenghui Ren

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

Let $A$ be a multiplicative subgroup of $\mathbb Z_p^*$. Define the $k$-fold sumset of $A$ to be $kA=\{x_1+\dots+x_k:x_i \in A,1\leq i\leq k\}$. We show that $6A\supseteq \mathbb Z_p^*$ for $|A| > p^{\frac {11}{23} +\epsilon}$. In addition,…

Combinatorics · Mathematics 2013-05-24 Derrick Hart

We show that if $A\subset \mathbb{Z}$ is a finite set of integers in which every integer is divisible by $O(1)$ many primes then \[\max(\lvert A+A\rvert,\lvert AA\rvert) \geq \lvert A\rvert^{12/7-o(1)}\] and, for any $m\geq 2$,…

Number Theory · Mathematics 2026-01-07 Rishika Agrawal , Thomas F. Bloom , Giorgis Petridis

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

Combinatorics · Mathematics 2017-08-16 Sophie Stevens , Frank de Zeeuw

In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…

Number Theory · Mathematics 2023-09-06 Neea Palojärvi

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

Number Theory · Mathematics 2016-11-21 Mei-Chu Chang

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso
‹ Prev 1 4 5 6 7 8 10 Next ›