Related papers: An extension of the Siegel-Walfisz theorem

Consider an elliptic curve, defined over the rational numbers, and embedded in projective space. The rational points on the curve are viewed as integer vectors with coprime coordinates. What can be said about a rational point if a bound is…

Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…

We show that a direct limit of surjections of (weak) Golod--Shafarevich algebras is a weak Golod--Shafarevich algebra as well. This holds both for graded and for filtered algebras provided that the filtrations are induced by the filtration…

A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…

Let $q$ be a power of a prime number $p$, $\mathbb F_q$ be a finite field with $q$ elements and $\mathcal{G}$ be a subgroup of $(\mathbb F_q,+)$ of order $p$. We give an existence criterion and an algorithm for computing maximally…

Fix a prime number $p$. Let $\mathbb{F}_q$ be a finite field of characteristic coprime to 2, 3, and $p$, which also contains the primitive $p$-th root of unity $\mu_p$. Based on the works by Swinnerton-Dyer and Klagsbrun, Mazur, and Rubin,…

We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…

The notion of $\alpha$-large families of finite subsets of an infinite set is defined for every countable ordinal number $\alpha$, extending the known notion of large families. The definition of the $\alpha$-large families is based on the…

An abstract theory of Fourier series in locally convex topological vector spaces is developed. An analog of Fej\'{e}r's theorem is proved for these series. The theory is applied to distributional solutions of Cauchy-Riemann equations to…

In this paper, we prove analogues of the Dirichlet theorem on arithmetic progressions and the Siegel--Walfisz theorem for the digital reverses of primes for arbitrary bases, which the authors obtained in the previous paper but only for…

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…

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erd\"os that measures the minimal gap size $f(k)$ in the sequence of integers at least one of whose prime factors exceeds $k$. This…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.