Related papers: Dealing with prime numbers I.: On the Goldbach con…
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.
In this note we present a method to bound gaps between primes via the divergence of the series of reciprocals of the prime numbers, a consequence of a version of the Bertrand's test for convergence of series of positive numbers and a…
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…
Assuming the Riemann Hypothesis, we obtain asymptotic formulas for the average number representations of an even integer as the sum of two primes. We use the method of Bhowmik and Schlage-Puchta and refine their results slightly to obtain a…
In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…
Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…
This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested…
Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
I define Goldbach counting function with N > 0 and square-free P > 0. Decomposition of this function is discovered and deduction formula is found. I propose a hypothesis on upper bound of Goldbach counting function and prove that Goldbach…
The $abc$ conjecture is a very deep concept in number theory with wide application to many areas of number theory. In this article we introduce the conjecture and give examples of its applications. In particular we apply the $abc$…
Goldbach's comet is the plot of the Goldbach function g(n), in the interval [3, N], with a large positive integer N. The function g(n) counts the number of different ways in which 2n can be expressed as the sum of two odd primes. An…
In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…
Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and…
Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…
We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…
Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…