相关论文: On differences between consecutive numbers coprime…
The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).
Jacobsthal's function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to P_k, the product of the first k primes. The best known bound on h(k) is h(k) < C (k ln k)^2 for…
The paper considers the asymptotic of the ratio of the number of primes not exceeding the primorial and the number of residues in the reduced system of residues for the given primorial. We study the relationship between asymptotic lower…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
The function g(n) represents the smallest number Q such that every sequence of Q consecutive integers contains an integer coprime to n. We give a new and explicit upper bound on this function.
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…
If $a$ and $d$ are relatively prime, we refer to the set of integers congruent to $a$ mod $d$ as an `eligible' arithmetic progression. A theorem of Dirichlet says that every eligible arithmetic progression contains infinitely many primes;…
The Jacobsthal function has aroused interest in various contexts in the past decades. We review several algorithmic ideas for the computation of Jacobsthal's function for primorial numbers and discuss their practicability regarding…
Jacobsthal's conjecture has been disproved by counterexample a few years ago. We continue to verify this conjecture on a larger scale. For this purpose, we implemented an extension of the Greedy Permutation Algorithm and computed the…
Let $p_{r+1}-1>n \geq p_r-1$, based on a sequence $\{1,2,3\cdots\ M_r(M_r=p_1p_2\cdots p_r)\}$, we compare the density of coprime numbers and establish a correlation between the proportions of coprime numbers in the ranges from 1 to…
Jacobsthal's function was recently generalised for the case of paired progressions. It was proven that a specific bound of this function is sufficient for the truth of Goldbach's conjecture and of the prime pairs conjecture as well. We…
This paper proves Firoozbakht's conjecture using Rosser and Schoenfelds' inequality on the distribution of primes. This inequality is valid for all natural numbers ${n\geq 21}$. Firoozbakht's conjecture states that if $ {p_{n}}$ and…
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…
Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…
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…
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…
In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…
We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…