scholarly journals INFINITUDE OF PRIME p such that ap+b is prime where a, b are coprime integers

2019 ◽  
Author(s):  
OLIVIER IDRISS BADO

In 1904, Dickson [6] stated a very important conjecture. Now people call it Dickson’s conjecture. In 1958, Schinzel and Sierpinski [3]generalized Dickson’s conjecture to the higher order integral polynomial case. However, they did not generalize Dickson’s conjecture to themultivariable case. In 2006, Green and Tao [9] considered Dickson’sconjecture in the multivariable case and gave directly a generalizedHardy-Littlewood estimation. But, the precise Dickson’s conjecture inthe multivariable case does not seem to have been formulated. In thispaper, based on the idea in [8] we introduce an interesting class of prime numbers to solve the dickson conjecture Although this article does not solve the dickson conjecture but it solves a problem that is similar to the Dickson conjecture. the problem is stated as follows being given two coprime integers a, b there is an infinity of prime numbers p such that ap+b is prime. This type of prime numbers we call it Bado-Tiemoko prime numbers .We intend to generalize this result but for the moment we speculate that given a family $(a_{i},b_{i})_{1\leq i\leq k}$ such that $\gcd(a_{i},b_{i})=1,\forall 1\leq i\leq k$ there is an infinity of prime numbers $p$ such that $a_{i}p+b_{i}$ is prime for $\forall 1\leq i\leq k$ Let $q_{a}$ be the smallest prime number dividing $a$ and $\omega(q_{a})$ its order by arranging the prime numbers in ascending order.Let $\beta(n)$ the number of Bado-Tiemoko prime less than $n$ and $$\eta_{s,i}=\frac{(p_{i}-1)^{\delta_{p_{i}}(a)}\prod_{k=1}^{s}(p_{i_{k}}-1)^{\delta_{p_{i_{k}}(a)}}}{\phi(a)\prod_{k=1}^{s}(p_{i_{k}}-1)(p_{i}-1)\prod_{k=1}^{s}p_{i_{k}}^{\delta_{p_{i_{k}}(a)}}p_{i}^{\delta_{p_{i}}(a)}}$$ $$\mu(r)=\frac{1}{\phi(a)}[\sum_{s=1}^{\omega(q_{a})}(-1)^{s-1}\sum_{1\leq i_{1}

2019 ◽  
Author(s):  
OLIVIER IDRISS BADO

In 1904, Dickson [6] stated a very important conjecture. Now people call it Dickson’s conjecture. In 1958, Schinzel and Sierpinski [3]generalized Dickson’s conjecture to the higher order integral polynomial case. However, they did not generalize Dickson’s conjecture to themultivariable case. In 2006, Green and Tao [9] considered Dickson’sconjecture in the multivariable case and gave directly a generalizedHardy-Littlewood estimation. But, the precise Dickson’s conjecture inthe multivariable case does not seem to have been formulated. In thispaper, based on the idea in [8] a partial proof of Dickson's Conjecture is provided .Let $\{a_ {1},a_{2},....a_{k}\}$ the set of $k$ linear prime admissible , $t \geq 1$, $q_{a_{t}}$ be the smallest prime number dividing $a_{t}$ and $\omega(q_{a_{t}})$ its order by arranging the prime numbers in ascending order.$\beta_{j}(\sqrt{n})$ the number of prime $p\leq \sqrt{n}$ such that $ a_{j}p+b_{j}$ is prime .Let \begin{eqnarray}G(\omega(q_{a_{t}}))=\left[ \frac{1}{\phi(a_{t})}+ \frac{ 1}{q_{a_{t}}\phi(a_{t})} -\frac{1+q_{a_{t}}}{q_{a_{t}}\phi(a_{t})}\prod_{i=1}^{\omega(q_{a_{t}})-1}\left[ 1-\frac{1}{p_{i}^{\sigma^{-1}(i)}(p_{i}-1)} \right]\right]\\R(r,t)=\frac{1}{\phi(a_{t})}\left[1-\prod_{i=\omega(q_{a_{t}})+1,p_{i}\mid a_{t}}^{r}\left[ 1-\frac{1}{p_{i}^{\sigma^{-1}(i)}} \right]\prod_{i=\omega(a_{t})+1,p_{i}\nmid a_{t}}^{r}\left[ 1-\frac{1}{p_{i}^{\sigma^{-1}(i)-1}(p_{i}-1)}\right]\right]\\\mu(k,r) = \sum_{t=1}^{k}\Pi(a_{t}n+b_{t})\prod_{i=1}^{r}\left[ \frac{\prod_{p\mid a_{i}}p^{v_{p}(a_{i})}p_{i}-1}{\prod_{p\mid a_{i}}p^{v_{p}(a_{i})}p_{i}}\right]\end{eqnarray}Let $ H(n)$ the number of prime $p$ less that $n$ such that :$ \forall i \leq k,a_{i}p+b_{i}$ is prime and $ Q(n)$ the number of prime such $\exists i \leq k ,a_{i}p+b_{i}$ is primeWe show that :\begin{eqnarray}H(n)-Q(\sqrt{n})\sim_{+\infty }\Pi(k,n)-\mu(k,r)\\Q(n)-Q(\sqrt{n})\sim_{+\infty }\Pi(k,n)-\sum_{t=1}^{k}\Pi(a_{t}n+b_{t})\left[G(\omega(q_{a_{t}}))+ R(r,t)\right]\end{eqnarray} Where $ \Pi(k,n)=\Pi(\min(a_{1},a_{2},..a_{k})n+\max(b_{1},b_{2},..b_{k}))$ \end{center}


2021 ◽  
Author(s):  
Xie Ling

Abstract n continuous prime numbers can combine a group of continuous even numbers. If an adjacent prime number is followed, the even number will continue. For example, if we take prime number 3, we can get even number 6. If we follow an adjacent prime number 5, we can get even numbers by using 3 and 5: 6, 8 and 10. If a group of continuous prime numbers 3,5,7,11,... P, we can get a group of continuous even numbers 6,8,10,12,..., 2n. Then if an adjacent prime number q is followed, the original group of even numbers 6,8,10,12,..., 2n will be finitely extended to 2 (n + 1) or more adjacent even numbers. My purpose is to prove that the continuity of prime numbers will lead to even continuity as long as 2 (n + 1) can be extended. If the continuity of even numbers is discontinuous, it violates the Bertrand Chebyshev theorem of prime numbers. Because there are infinitely many prime numbers: 3, 5, 7, 11,... We can get infinitely many continuous even numbers: 6,8,10,12,...


2021 ◽  
Author(s):  
Xie Ling

Abstract n continuous prime numbers can combine a group of continuous even numbers. If an adjacent prime number is followed, the even number will continue. For example, if we take prime number 3, we can get even number 6. If we follow an adjacent prime number 5, we can get even numbers by using 3 and 5: 6, 8 and 10. If a group of continuous prime numbers 3,5,7,11,... P, we can get a group of continuous even numbers 6,8,10,12,..., 2n. Then if an adjacent prime number q is followed, the original group of even numbers 6,8,10,12,..., 2n will be finitely extended to 2 (n + 1) or more adjacent even numbers. My purpose is to prove that the continuity of prime numbers will lead to even continuity as long as 2 (n + 1) can be extended. If the continuity of even numbers is discontinuous, it violates the Bertrand Chebyshev theorem of prime numbers. Because there are infinitely many prime numbers: 3, 5, 7, 11,... We can get infinitely many continuous even numbers: 6,8,10,12,...


2020 ◽  
Vol 8 (2) ◽  
pp. 113-120
Author(s):  
Aminudin Aminudin ◽  
Gadhing Putra Aditya ◽  
Sofyan Arifianto

This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS). ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation. This method was applied to instant messaging using TCP sockets. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number. It also applies to the encryption and decryption process. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. The test was processed for 15 hours until the test computer resource runs out.


2019 ◽  
Vol 15 (05) ◽  
pp. 1037-1050
Author(s):  
Erik R. Tou

The mathematics of juggling emerged after the development of siteswap notation in the 1980s. Consequently, much work was done to establish a mathematical theory that describes and enumerates the patterns that a juggler can (or would want to) execute. More recently, mathematicians have provided a broader picture of juggling sequences as an infinite set possessing properties similar to the set of positive integers. This theoretical framework moves beyond the physical possibilities of juggling and instead seeks more general mathematical results, such as an enumeration of juggling patterns with a fixed period and arbitrary number of balls. One problem unresolved until now is the enumeration of primitive juggling sequences, those fundamental juggling patterns that are analogous to the set of prime numbers. By applying analytic techniques to previously-known generating functions, we give asymptotic counting theorems for primitive juggling sequences, much as the prime number theorem gives asymptotic counts for the prime positive integers.


Author(s):  
V. S. Malakhovsky

It is shown how to define one or several prime numbers following af­ter given prime number without using computer only by calculating sev­eral arithmetic progressions. Five examples of finding such prime num­bers are given.


2002 ◽  
Vol 8 (2) ◽  
pp. 70-76
Author(s):  
Jeffrey J. Wanko ◽  
Christine Hartley Venable

Middle school students learn about patterns, formulas, and large numbers motivated by a search for the largest prime number. Activities included.


1996 ◽  
Vol 26 (1) ◽  
pp. 117-121 ◽  
Author(s):  
Jan Dhaene ◽  
Bjørn Sundt ◽  
Nelson De Pril

AbstractIn the present note we consider the Hipp approximation to the convolution of a finite number of probability distributions on the non-negative integers. It is shown that the moment up to and including order r of the rth order approximation are equal to the corresponding moments of the exact distribution. We also give a relation between the exact and approximated (r + 1)th order moments and indicate how similar relations can be obtained for higher order moments.


Sign in / Sign up

Export Citation Format

Share Document