相关论文: Large gaps between consecutive prime numbers conta…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

We study the gaps between products of two primes in imaginary quadratic number fields using a combination of the methods of Goldston-Graham-Pintz-Yildirim \cite{GGPY}, and Maynard \cite{MAY}. An important consequence of our main theorem is…

We study some counting questions concerning products of positive integers $u_1, \ldots, u_n$ which form a non-zero perfect square, or more generally, a perfect $k$-th power. We obtain an asymptotic formula for the number of such integers of…

In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong…

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $[\alpha n]$, $[\alpha n]+1$, where $\alpha>1$ is irrational number with bounded partial quotient or irrational algebraic number.

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

We show that the set of prime numbers has exponential alternating complexity, proving a conjecture by Fijalkow. We further show that the set of squarefree integers has essentially maximal possible alternating complexity.

This paper provides a commentary and guide to Appendix 8 of Laws Of Form, which is a chapter (appendix) on number theory in the book Laws of Form by Spencer-Brown. (Spencer-Brown,Laws Of Form,Revised Seventh English edition. Bohmeier…

We consider the error term of the asymptotic formula for the number of pairs of $k$-free integers up to $x$. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to $r$-tuples of $k$-free…

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…

We prove that a positive proportion of the gaps between consecutive primes are short gaps of length less than any fixed fraction of the average spacing between primes.

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

In this note, we prove by using T. Estermann's and S. Dimitrov's arguments with an elementary inequality that there are infinitely many $n$ for which all of the numbers $n^2+1,n^2+2$ and $n^2+3$ are squarefree. We also improve the error…

We develop a general approach for showing when a set of integers $\mathscr{A}$ has infinitely many $k^{th}$ powerfree numbers without relying on equidistribution estimates for $\mathscr{A}$. In particular, we show that if the Fourier…

We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…