Related papers: Uniformly counting primes with a given primitive r…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…
In this note, assuming a variant of the Generalized Riemann Hypothesis, which does not exclude the existence of real zeros, we prove an asymptotic formula for the mean value of the representation function for the sum of two primes in…
We study the distribution of primes from a topological viewpoint. Certain conjecture is introduced, and we show that it is equivalent to the Riemann Hypothesis.
We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…
Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli…
We consider equations of the form $a_{1}x_{1}^{k}+...+a_{s}x_{s}^{k}$ and when they have solutions in the primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove…
This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…
The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…
Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…
In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…
We prove a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel-Walfisz theorem, Hoheisel's asymptotic for intervals of length $x^{1-\delta}$, a Brun-Titchmarsh bound, and Linnik's…
This work concerns Artin's Conjecture on primitive roots and related problems for number fields. Let $K$ be a number field and let $W_1$ to $W_n$ be finitely generated subgroups of $K^\times$ of positive rank. We consider the index map,…