English
Related papers

Related papers: Structure and asymptotics for Catalan numbers modu…

200 papers

Let $m$ be any positive integer and let $\delta_1,\delta_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=\delta_1\…

Number Theory · Mathematics 2019-09-06 Hao Pan , Zhi-Wei Sun

Consider a strongly $b$-multiplicative sequence and a prime $p$. Studying its $p$-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of $p$. The integer values of the…

Number Theory · Mathematics 2016-02-10 Alexandre Aksenov

An integer is a primitive root modulo a prime $p$ if it generates the whole multiplicative group $(\mathbb{Z}/p\mathbb{Z})^*$. In 1927 Artin conjectured that an integer $a$ which is not $-1$ or a square is a primitive root for infintely…

Number Theory · Mathematics 2025-02-28 Paul Péringuey

Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.

Number Theory · Mathematics 2007-05-23 William D. Banks , John B. Friedlander , Florian Luca

We use a variant of Vinogradov's method to show that the density of the set of prime numbers $p\equiv -1\bmod~4$ for which the class group of the imaginary quadratic number field $\mathbb{Q}(\sqrt{-8p})$ has an element of order $16$ is…

Number Theory · Mathematics 2017-06-13 Djordjo Milovic

An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound…

Number Theory · Mathematics 2015-06-24 Nilotpal Kanti Sinha

We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…

Number Theory · Mathematics 2025-10-08 Kübra Benli , Greg Martin , Paul Péringuey

A partition is $t$-regular if none of its parts is divisible by $t$. Let $p(N,t)$ be the number of $(t+1)$-regular partitions of a positive integer $N$. In 1971, Hagis proved an asymptotic formula for $p(N,t)$ using the circle method, when…

Number Theory · Mathematics 2026-03-23 Jayanta Barman , Kamalakshya Mahatab

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Logic · Mathematics 2013-07-02 Rodney G. Downey , Carl G. Jockusch , Paul E. Schupp

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

Number Theory · Mathematics 2019-03-29 Christian Axler

The cumulant representation of the Fourier path integral method is examined to determine the asymptotic convergence characteristics of the imaginary-time density matrix with respect to the number of path variables $N$ included. It is proved…

Computational Physics · Physics 2014-11-21 Sharif D. Kunikeev , David L. Freeman , J. D. Doll

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Combinatorics · Mathematics 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

Number Theory · Mathematics 2019-09-16 Alessandro Languasco , Alessandro Zaccagnini

Given a sequence of integers $a_j, j\ge 1,$ a multiset is a combinatorial object composed of unordered components, such that there are exactly $a_j$ one-component multisets of size $j.$ When $a_j\asymp j^{r-1} y^j$ for some $r>0$, $y\geq…

Combinatorics · Mathematics 2007-06-13 Boris L. Granovsky , Dudley Stark

The well-known asymptotic formula for the module of a condenser with one of the plates degenerating to a point is generalized to the case of a condenser of general type. The condensers under consideration consist of n plates, n > 2, and the…

Complex Variables · Mathematics 2011-10-18 V . N . Dubinin

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p.…

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

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

Combinatorics · Mathematics 2023-06-02 W. T. Gowers , Thomas Karam

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…

Combinatorics · Mathematics 2015-12-09 Cyril Banderier , Pawel Hitczenko

Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…

General Mathematics · Mathematics 2018-05-08 N. A. Carella

Let $\{f_n\}$ be the Franel numbers given by $f_n=\sum_{k=0}^n\binom nk^3$, and let $p>5$ be a prime. In this paper we mainly determine $\sum_{k=0}^{p-1} \binom{2k}k\frac{f_k}{m^k}\pmod p$ for $m=5,-16,16,32,-49,50,96$. Let…

Number Theory · Mathematics 2015-05-05 Zhi-Hong Sun