Related papers: When the sieve works
We consider the problem of minimizing a sum of several convex non-smooth functions. We introduce a new algorithm called the selective linearization method, which iteratively linearizes all but one of the functions and employs simple…
We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…
In this paper we introduce an Euclidean decomposition of elements a_n of an increasing sequence of natural numbers into weight * level + jump which we use to classify the numbers a_n either by weight or by level. We then show that this…
It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…
In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…
We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $\lambda^{s_n}$. In particular, we obtain a result which is…
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…
We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…
This 1964 paper developed as an off-shoot to the foundational query: Do we discover the natural numbers (Platonically), or do we construct them linguistically? The paper also assumes computational significance in the light of Agrawal, Kayal…
A case is made that researchers are interested in studying processes. Often the inferences they are interested in making are about the process and its associated population. On other occasions, a researcher may be interested in making an…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
We unify in a large class of additive functions the results obtained in the first part of this work. The proof rests on series involving the Riemann zeta function and certain sums of primes which may have their own interest.
In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously…
In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…
For $a \neq 1$ and $p$ prime, we define numbers of the form $pa^2$ to be Square-Prime (SP) Numbers. For example, 75 = 3 $\cdot$ 25; 108 = 3 $\cdot$ 36; 45 = 5 $\cdot$ 9. These numbers are listed in the OEIS as A228056. We study the…