English
Related papers

Related papers: The large sieve for $2^{[O(n^{15/14+o(1)})]}$ modu…

200 papers

This paper is about the rate of convergence of the Markov chain $X_{n+1}=AX_{n}+B_{n}$ (mod $p$), where $A$ is an integer matrix with nonzero eigenvalues and ${B_{n}}_{n}$ is a sequence of independent and identically distributed integer…

Probability · Mathematics 2008-05-20 Claudio Asci

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

Number Theory · Mathematics 2021-01-22 Matteo Bordignon

In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

Number Theory · Mathematics 2015-03-11 Javier Cilleruelo , Moubariz Z. Garaev

We show that at least 1/3 of positive real numbers are in the set of limit points of normalized prime gaps. More precisely, if $p_n$ denotes the $n$th prime and $\mathbb{L}$ is the set of limit points of the sequence $\{(p_{n+1}-p_n)/\log…

Number Theory · Mathematics 2021-03-03 Jori Merikoski

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

General Mathematics · Mathematics 2023-07-31 Mbakiso Fix Mothebe

The author shows that there are infinitely many primes $p$ such that for any nonzero integer $a$, $p-a$ is divisible by a square $d^2 > p^{\frac{1}{2}+\frac{1}{700}}$. The exponent $\frac{1}{2}+\frac{1}{700}$ improves Merikoski's…

Number Theory · Mathematics 2025-10-20 Runbo Li

We obtain new results about the representation of almost all residues modulo a prime $p$ by a product of a small integer and also an element of small multiplicative subgroup of $({\mathbb Z}/p{\mathbb Z})^*$. These results are based on some…

Number Theory · Mathematics 2014-12-09 Marc Munsch , Igor Shparlinski

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

Number Theory · Mathematics 2018-09-26 Deniz A. Kaptan

Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…

Number Theory · Mathematics 2021-11-19 Roger Baker

Recently, Bruinier and Ono classified cusp forms $f(z) := \sum_{n=0}^{\infty} a_f(n)q ^n \in S_{\lambda+1/2}(\Gamma_0(N),\chi)\cap \mathbb{Z}[[q]]$ that does not satisfy a certain distribution property for modulo odd primes $p$. In this…

Number Theory · Mathematics 2007-05-23 Dohoon Choi

It has been well-observed that an inequality of the type $\pi(x;q,a) > \pi(x;q,b)$ is more likely to hold if $a$ is a non-square modulo $q$ and $b$ is a square modulo $q$ (the so-called ``Chebyshev Bias''). For instance, each of…

Number Theory · Mathematics 2007-05-23 Greg Martin

This is a review of several results related to distribution of powers and combination of powers modulo 1. We include a proof that given a sequence of real numbers $\theta_n$, it is possible to get an $\alpha$ (given $\lambda \ne 0$), or a…

Number Theory · Mathematics 2013-12-23 Miguel A. Lerma

We show that, for sufficiently large integers $m$ and $X$, for almost all $a =1, ..., m$ the ratios $a/x$ and the products $ax$, where $|x|\le X$, are very uniformly distributed in the residue ring modulo $m$. This extends some recent…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…

Number Theory · Mathematics 2015-04-24 Nathan McNew

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

We present a novel approach to the Twin Prime Conjecture, basing on the $6x \pm 1$ representation of primes. By defining so-called twin prime generators $x \in \N$, for which both $6x - 1$ and $6x + 1$ are prime, we reformulate the…

General Mathematics · Mathematics 2025-08-19 Berndt Gensel

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denotes the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $1<c<12/11$ there exist infinitely…

Number Theory · Mathematics 2025-05-02 S. I. Dimitrov

An asymptotic formula for the number of $n \le x$ such that $n$ does not divide $P(n)!$ is given, where P(n) is the largest prime factor of $n$.

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić