DOCSLIB.ORG

Argument for a Twin Primes Theorem. Landscapes, Panoramas and Horizons Within Eratosthenes Sieve

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Argument for a Twin Primes Theorem. Landscapes, Panoramas and Horizons Within Eratosthenes Sieve Argument for a twin primes theorem. Landscapes, panoramas and horizons within Eratosthenes sieve. Hubert Schaetzel To cite this version: Hubert Schaetzel. Argument for a twin primes theorem. Landscapes, panoramas and horizons within Eratosthenes sieve.. 2020. hal-02945018 HAL Id: hal-02945018 https://hal.archives-ouvertes.fr/hal-02945018 Preprint submitted on 21 Sep 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Number Theory / Théorie des nombres Argument for a twin primes theorem. Landscapes, panoramas and horizons within Eratosthenes sieve. Hubert Schaetzel Abstract We explore three ways on the twin primes problem. We start with the intermediate sets produced by Eratosthenes sieve implementation. Properties related to the proportions of integers eliminated during process on one hand and the distances generated between integers on the other hand allow twice deducing the infinity of prime numbers and twin prime numbers. In the former case, the analysis of the proportions also allows getting an asymptotic evaluation similar to Hardy-Littlewood formula, but without fully valid proof. In the latter case, the analysis of the spacings between remaining integers yields a replica of Bertrand’s postulate with approximate 2pi spacing and the asymptotic evaluation of the maximum of the distances between pairs of numbers (of spacing 2), which is ranging around ∑i 2pk, enables to conclude to 2 the divergence of twin prime numbers below abscissa pi . Finally, an alternative method, that is readily generalizable to many Diophantine equations, is proposed as an invitation to new studies. Again, we infer the Euler product suggested by Hardy-Littlewood. Argumentaire pour un théorème des nombres premiers jumeaux. Paysages, panoramas et horizons du crible d’Eratosthène. Résumé Nous étudions trois approches au problème des premiers jumeaux. Nous commençons par les ensembles intermédiaires produits par l’exécution du crible d’Eratosthène. Les propriétés liées aux proportions de nombres entiers éliminés d’une part et aux espacements générés entre nombres entiers d’autre part permettent par deux fois de déduire l’infinité des nombres premiers, puis des nombres premiers jumeaux. Dans le premier cas, l’analyse des proportions permet également d’obtenir une évaluation asymptotique identique à la formule d’Hardy-Littlewood, mais sans pleine et entière démonstration. Dans le second cas, l’analyse des espacements entre nombres restants permet d’obtenir une réplique du Postulat de Bertrand avec un espacement de l’ordre de 2pi et l’évaluation asymptotique du maximum de la distance entre paires de nombres (d’écart 2), évaluation qui est équivalente à ∑i 2pk, permet de conclure à la divergence du 2 cardinal des nombres premiers jumeaux en dessous de l’abscisse pi . Enfin, une méthode alternative aisément généralisable à de nombreuses équations diophantines est proposée en guise d’invitation à d’autres études. Nous en déduisons à nouveau le produit d’Euler suggéré par Hardy-Littlewood. Status Preprint Date Version 1 : November 29, 2011 Version 17 : September 11, 2020 Paradox see [1] - no prime number is even except one - no prime number is even except two P 1/142 Summary 1. Preamble. 3 2. An expeditious proof. 3 3. Terminology. 3 4. Fundamental theorems. 4 4.1. Three theorems. 4 4.2. Generalization of Mertens theorem. 4 4.3. Logarithm weighted sums. 5 5. Eratosthenes sieve. 6 5.1. Depletion algorithm. 6 5.2. Landscaping of spacings between pseudo primes. 13 5.2.1. Panoramas of populations. 13 5.2.2. Horizons on the iterative enumeration of populations. 15 5.2.3. Evolution of aggregated populations. 22 5.2.4. Cradle of the multiplicative factors. 23 5.2.5. Maximal spacing. 39 5.2.6. Minimal spacing. 42 6. Eratosthenes crossed sieve. 43 6.1. Case of the twin prime numbers. 43 6.2. Case of relative prime numbers. 46 6.3. Evaluation of relative prime numbers cardinals. 49 6.3.1. Case of twin prime numbers. 49 6.3.2. Case of pairs of prime numbers distant of 2m. 50 6.3.3. Case of relative prime numbers. 51 6.3.4. Formula of cardinals. 51 6.3.5. Common asymptotic branches. 52 6.3.6. Implementation of a bijection between relative prime numbers with common asymptotic branches. 53 6.3.7. Hardy-Littlewood formula. 53 6.3.8. Comparative evolution of depletion coefficients. 56 6.4. Landscaping of twin numbers spacings. 57 6.4.1. Generalities. 57 6.4.2. Basic idea. 58 6.4.3. Panoramas od enumeration. 58 6.4.4. Generative process. 63 6.4.5. Extrema research. 66 6.4.6. Algorithmic background. 68 6.4.7. Classes. 70 6.4.8. Configurations. 71 6.4.9. Spacings generated by the sieve. 72 6.4.10. Lower and upper bounds. 77 6.4.11. Futher horizons for spacings. Entities viewed with a telescope. 79 6.5. Landscaping of spacings between relative integers. 82 6.5.1. Periodicity of the entities. 86 4.4.11.1 Periodicity focusing on even components. 86 4.4.11.2 Periodicity focusing on odd components. 89 6.5.2. Sums of products. 92 6.5.3. Divergence of solutions. 94 6.6. Comparison of families. 94 7. Theorem of density of prime numbers. 96 7.1. Equivalent of a prime number variable. 96 7.2. Reconstruction of De Polignac formula. 97 P 2/142 1. Preamble. Rarefaction of pairs of primes distant of a given value 2n is a simple process based on Eratosthenes sieve. We will establish our theorems thanks to arithmetical laws governing integers’ depletions within natural numbers set N while implementing the said algorithm. The article below has certainly nothing complicated for specialists of this topic. To give more clarity and strength to the argument, we will apply it initially to the enumeration of the prime numbers, i.e. we will attempt to retrieve the prime number theorem (PNT). Passing from the prime numbers’ case to the twin prime numbers will simply consist of replacing a given law of scarcity th (pi-1)/pi by another (pi-2)/pi, pi being the i odd prime number. Although the Hardy-Littlewood formula is deduced, no proof is given (nor for the PNT). Only, the infinitely of twin prime numbers is deduced (following similar work on prime numbers). We downgrade and overrate the number of solutions in both cases and the resulting framing show upper and lower boundaries converging asymptotically (and tending towards infinity). The study is also upgraded after that for our two groups of objects, prime numbers and twin prime numbers, by evaluating the distances between elements, the guiding threads being now, more or less, the two expressions 2pi and ∑i 2pk respectively. However, more than the results in the pi to pi² range that allow us to conclude upon the stated problem, we focus attention, when running Eratosthenes algorithm, on the existence of recursive formulas’ systems to evaluate asymptotically in the pi to pi+pi# interval, pi# = 2.3.5.7.11…pi denoting the primorial of pi, the integers’ populations with given spacing Δ = 2j (populations of pseudo-primes on the one hand, populations of pseudo-twin primes or relative primes on the other hand), knowing less than j/2+1 initial staffs. (The terms “pseudo” and “spacing” will be defined very soon in the present article). Thus, the interest of this article has also become over the course of the different versions, this aspect having taken more and more importance with respect to the initial purpose, facing apparent absence of such a corpus elsewhere, that of an in- depth study of the Eratosthenes sieve. The reader would have been disappointed with the lack of challenge if he had already found here all the statements demonstrated. On the contrary, and fortunately, he will still be able to exercise all of his insight facing high walls of difficulties, especially in order to appropriate himself the said recursive systems. There is a time for discovery and another for the full comprehension of a subject. 2. An expeditious proof. For the reader who does not have time, here is an appetizier for his immediate satisfaction. Proposition 1 There is an infinity of twin prime numbers. Proof Let us apply the Eratosthenes algorithm up to step pi. Then, beyond pi, the intervals of size #pi, the primordial of pi, contain each ∏ (pi-2) pairs of 2-gap numbers. This answers the question of the existence of pairs (not necessarly primes). As the algorithm begins with the removal of the smallest dividers, the first pair is a pair of twin primes (you can challenge anyone to find a counter-example). Let us consider pj the largest number of this pair. Let us continue the depletion algorithm up to pj. Beyond pj, the intervals of size #pj each contain ∏ (pj-2) pairs of 2-gap numbers, the first of which is a pair of twin prime numbers which is different of the first pair. So we get a second coveted pair. The argument applies to infinity by recurrence. 3. Terminology. Gap and spacing : Notions related to the distance between objects in this study can lead to pernicious confusion. Precise terminology is therefore required to avoid it. We will have to manipulate either isolated integers or pairs of integers.
Load more

Recommended publications
  • About a Virtual Subset
    About a virtual subset Dipl. Math.(FH) Klaus Lange* *Cinterion Wireless Modules GmbH, Technology, Product Development, Integration Test Berlin, Germany [email protected] ___________________________________________________________________________ Abstract: Two constructed prime number subsets (called “prime brother & sisters” and “prime cousins”) lead to a third one (called “isolated primes”) so that all three disjoint subsets together generate the prime number set. It should be suggested how the subset of isolated primes give a new approach to expand the set theory by using virtual subsets. ___________________________________________________________________________ I. Prime number brothers & sisters This set of prime numbers is given P = {2; 3; 5; 7; 11; …}. Firstly we are going to establish a subset of prime numbers called “brothers & sisters” to generalize the well known prime number twins. Definition D1: Brother & Sister Primes Two direct neighbours of prime numbers p i and p i+1 are called brothers & sisters if this distance d is given n d = p i+1 – p i = 2 with n ∈ IN 0. All these brothers & sisters are elements of the set B := ∪Bj Notes: (i) Bj is the j-th subset of B by d and separated from Bj+1 because the distance between Bj and n Bj+1 does not have the structure 2 . For example B1 = {2; 3; 5; 7; 11; 13; 17; 19; 23} B2 = {29; 31} B3 = {37; 41; 43; 47} B4 = {59; 61} B5 = {67; 71; 73} B6 = {79; 83} B7 = {89; 97; 101; 103; 107; 109; 113} B8 = {127; 131} B9 = {137; 139} B10 = {149; 151} The distances between 29 - 23 and 37 – 31 etc.
    [Show full text]
  • Proof of the Twin Prime Conjecture (Together with the Proof of Polignac’S Conjecture for Cousin Primes) Marko Jankovic
    Proof of the Twin Prime Conjecture (Together with the Proof of Polignac’s Conjecture for Cousin Primes) Marko Jankovic To cite this version: Marko Jankovic. Proof of the Twin Prime Conjecture (Together with the Proof of Polignac’s Conjec- ture for Cousin Primes). 2020. hal-02549967v1 HAL Id: hal-02549967 https://hal.archives-ouvertes.fr/hal-02549967v1 Preprint submitted on 21 Apr 2020 (v1), last revised 18 Aug 2021 (v12) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Marko V. Jankovic Department of Emergency Medicine, Bern University Hospital “Inselspital”, and ARTORG Centre for Biomedical Engineering Research, University of Bern, Switzerland Abstract. In this paper proof of the twin prime conjecture is going to be presented. In order to do that, the basic formula for prime numbers was analyzed with the intention of finding out when this formula would produce a twin prime and when not. It will be shown that the number of twin primes is infinite. The originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved. The same approach is used to prove the Polignac’s conjecture for cousin primes.
    [Show full text]
  • Generator and Verification Algorithms for Prime K−Tuples Using Binomial
    International Mathematical Forum, Vol. 6, 2011, no. 44, 2169 - 2178 Generator and Verification Algorithms for Prime k−Tuples Using Binomial Expressions Zvi Retchkiman K¨onigsberg Instituto Polit´ecnico Nacional CIC Mineria 17-2, Col. Escandon Mexico D.F 11800, Mexico [email protected] Abstract In this paper generator and verification algorithms for prime k-tuples based on the the divisibility properties of binomial coefficients are intro- duced. The mathematical foundation lies in the connection that exists between binomial coefficients and the number of carries that result in the sum in different bases of the variables that form the binomial co- efficent and, characterizations of k-tuple primes in terms of binomial coefficients. Mathematics Subject Classification: 11A41, 11B65, 11Y05, 11Y11, 11Y16 Keywords: Prime k-tuples, Binomial coefficients, Algorithm 1 Introduction In this paper generator and verification algorithms fo prime k-tuples based on the divisibility properties of binomial coefficients are presented. Their math- ematical justification results from the work done by Kummer in 1852 [1] in relation to the connection that exists between binomial coefficients and the number of carries that result in the sum in different bases of the variables that form the binomial coefficient. The necessary and sufficient conditions provided for k-tuple primes verification in terms of binomial coefficients were inspired in the work presented in [2], however its proof is based on generating func- tions which is distinct to the argument provided here to prove it, for another characterization of this type see [3]. The mathematical approach applied to prove the presented results is novice, and the algorithms are new.
    [Show full text]
  • New Congruences and Finite Difference Equations For
    New Congruences and Finite Difference Equations for Generalized Factorial Functions Maxie D. Schmidt University of Washington Department of Mathematics Padelford Hall Seattle, WA 98195 USA [email protected] Abstract th We use the rationality of the generalized h convergent functions, Convh(α, R; z), to the infinite J-fraction expansions enumerating the generalized factorial product se- quences, pn(α, R)= R(R + α) · · · (R + (n − 1)α), defined in the references to construct new congruences and h-order finite difference equations for generalized factorial func- tions modulo hαt for any primes or odd integers h ≥ 2 and integers 0 ≤ t ≤ h. Special cases of the results we consider within the article include applications to new congru- ences and exact formulas for the α-factorial functions, n!(α). Applications of the new results we consider within the article include new finite sums for the α-factorial func- tions, restatements of classical necessary and sufficient conditions of the primality of special integer subsequences and tuples, and new finite sums for the single and double factorial functions modulo integers h ≥ 2. 1 Notation and other conventions in the article 1.1 Notation and special sequences arXiv:1701.04741v1 [math.CO] 17 Jan 2017 Most of the conventions in the article are consistent with the notation employed within the Concrete Mathematics reference, and the conventions defined in the introduction to the first articles [11, 12]. These conventions include the following particular notational variants: ◮ Extraction of formal power series coefficients. The special notation for formal n k power series coefficient extraction, [z ] k fkz :7→ fn; ◮ Iverson’s convention.
    [Show full text]
  • Sum of the Reciprocals of Famous Series: Mathematical Connections with Some Sectors of Theoretical Physics and String Theory
    1Torino, 14/04/2016 Sum of the reciprocals of famous series: mathematical connections with some sectors of theoretical physics and string theory 1,2 Ing. Pier Franz Roggero, Dr. Michele Nardelli , P.i. Francesco Di Noto 1Dipartimento di Scienze della Terra Università degli Studi di Napoli Federico II, Largo S. Marcellino, 10 80138 Napoli, Italy 2 Dipartimento di Matematica ed Applicazioni “R. Caccioppoli” Università degli Studi di Napoli “Federico II” – Polo delle Scienze e delle Tecnologie Monte S. Angelo, Via Cintia (Fuorigrotta), 80126 Napoli, Italy Abstract In this paper it has been calculated the sums of the reciprocals of famous series. The sum of the reciprocals gives fundamental information on these series. The higher this sum and larger numbers there are in series and vice versa. Furthermore we understand also what is the growth factor of the series and that there is a clear link between the sums of the reciprocal and the "intrinsic nature" of the series. We have described also some mathematical connections with some sectors of theoretical physics and string theory 2Torino, 14/04/2016 Index: 1. KEMPNER SERIES ........................................................................................................................................................ 3 2. SEXY PRIME NUMBERS .............................................................................................................................................. 6 3. TWIN PRIME NUMBERS .............................................................................................................................................
    [Show full text]
  • Is 547 a Prime Number
    Is 547 a prime number Continue Vers'o em portug's Definition of a simple number (or simply) is a natural number larger than one that has no positive divisions other than one and itself. Why such a page? Read here Lists of The First 168 Prime Numbers: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227 , 229, 233, 239 , 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601 , 607, 613, 617 , 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941 947, 953, 967, 971, 977, 983, 991, 997 Big Lists Firt 10,000 prime numbers First 50 Milhon prime numbers First 2 billion prime prime numbers Prime numbers up to 100,000,000 Prime number from 100,000 000,000 to 200,000,000,000 Prime numbers from 200,000,000,000 to 300,000,000 from 0.000 to 400,000,000,000,000 0 Premier numbers from 400,000,000,000 to 500,000,000 Prime numbers from 500,000,000,000 to 600,000,000,000 Prime numbers from 600,000,000 to 600,000 ,000,000,000 to 700,000,000,000,000 Prime numbers from 700,000,000,000 to 800,000,000,000 Prime numbers from 800,000 0,000,000 to 900,000,000,000 Prime numbers from 900,000,000,000 to 1,000,000,000,000 Deutsche Version - Prime Numbers Calculator - Is it a simple number? There is a limit to how big a number you can check, depending on your browser and operating system.
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]
  • Proof of the Twin Prime Conjecture (Together with the Proof of Polignac’S Conjecture for Cousin Primes) Marko Jankovic
    Proof of the Twin Prime Conjecture (Together with the Proof of Polignac’s Conjecture for Cousin Primes) Marko Jankovic To cite this version: Marko Jankovic. Proof of the Twin Prime Conjecture (Together with the Proof of Polignac’s Conjec- ture for Cousin Primes). 2020. hal-02549967v2 HAL Id: hal-02549967 https://hal.archives-ouvertes.fr/hal-02549967v2 Preprint submitted on 27 May 2020 (v2), last revised 18 Aug 2021 (v12) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Marko V. Jankovic Department of Emergency Medicine, Bern University Hospital “Inselspital”, and ARTORG Centre for Biomedical Engineering Research, University of Bern, Switzerland Abstract. In this paper proof of the twin prime conjecture is going to be presented. In order to do that, the basic formula for prime numbers was analyzed with the intention of finding out when this formula would produce a twin prime and when not. It will be shown that the number of twin primes is infinite. Originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved. The same approach is used to prove the Polignac’s conjecture for cousin crimes.
    [Show full text]
  • Subject Index
    Subject Index Many of these terms are defined in the glossary, others are defined in the Prime Curios! themselves. The boldfaced entries should indicate the key entries. γ 97 Arecibo Message 55 φ 79, 184, see golden ratio arithmetic progression 34, 81, π 8, 12, 90, 102, 106, 129, 136, 104, 112, 137, 158, 205, 210, 154, 164, 172, 173, 177, 181, 214, 219, 223, 226, 227, 236 187, 218, 230, 232, 235 Armstrong number 215 5TP39 209 Ars Magna 20 ASCII 66, 158, 212, 230 absolute prime 65, 146, 251 atomic number 44, 51, 64, 65 abundant number 103, 156 Australopithecus afarensis 46 aibohphobia 19 autism 85 aliquot sequence 13, 98 autobiographical prime 192 almost-all-even-digits prime 251 averaging sets 186 almost-equipandigital prime 251 alphabet code 50, 52, 61, 65, 73, Babbage 18, 146 81, 83 Babbage (portrait) 147 alphaprime code 83, 92, 110 balanced prime 12, 48, 113, 251 alternate-digit prime 251 Balog 104, 159 Amdahl Six 38 Balog cube 104 American Mathematical Society baseball 38, 97, 101, 116, 127, 70, 102, 196, 270 129 Antikythera mechanism 44 beast number 109, 129, 202, 204 apocalyptic number 72 beastly prime 142, 155, 229, 251 Apollonius 101 bemirp 113, 191, 210, 251 Archimedean solid 19 Bernoulli number 84, 94, 102 Archimedes 25, 33, 101, 167 Bernoulli triangle 214 { Page 287 { Bertrand prime Subject Index Bertrand prime 211 composite-digit prime 59, 136, Bertrand's postulate 111, 211, 252 252 computer mouse 187 Bible 23, 45, 49, 50, 59, 72, 83, congruence 252 85, 109, 158, 194, 216, 235, congruent prime 29, 196, 203, 236 213, 222, 227,
    [Show full text]
  • Primes and Open Problems in Number Theory Part II
    Primes and Open Problems in Number Theory Part II A. S. Mosunov University of Waterloo Math Circles February 14th, 2018 Happy Valentine’s Day! Picture from https://upload.wikimedia.org/wikipedia/commons/ thumb/b/b8/Twemoji_2764.svg/600px-Twemoji_2764.svg.png. Perfect day to read “Love and Math”! Picture from https://images-na.ssl-images-amazon.com/images/I/ 612d9ocw9VL._SX329_BO1,204,203,200_.jpg. Recall Prime Numbers I We were looking at prime numbers, those numbers that are divisible only by one and themselves. I We computed all prime numbers up to 100: 2,3,5,7,11,13,17,19,23,29,31,37,41, 43,47,53,59,61,67,71,73,79,83,89,97,... I We saw three di↵erent arguments for the infinitude of primes due to Euclid, Euler, and Erd˝os. I We learned about Prime Number Theorem (PNT), which states that there are “roughly” x/lnx prime numbers up to x. I This week, we will look at other famous results and conjectures about prime numbers, starting from the Twin Prime Conjecture. But before that. EXERCISE! Exercise: Heuristics on Prime Numbers 1. Use PNT to prove that the probability of choosing a prime among integers between 1 and x is “approximately” 1/lnx. 2. What is the probability of choosing a random integer that is not divisible by a positive integer p? 3. Let n be a random number x.Clearly,thisnumberisprime if it is not divisible by any prime p such that p < x.Givea heuristic explanation why the probability of n being prime is ’ (1 1/p).
    [Show full text]
  • On the Infinity of Twin Primes and Other K-Tuples
    On The Infinity of Twin Primes and other K-tuples Jabari Zakiya: [email protected] August 14, 2020 Abstract The paper uses the structure and math of Prime Generators to show there are an infinity of twin primes, proving the Twin Prime Conjecture, as well as establishing the infinity of other k-tuples of primes. 1 Introduction In number theory Polignac’s Conjecture (1849) [6] states there are infinitely many consecutive primes (prime pairs) that differ by any even number n. The Twin Prime Conjecture derives from it for prime pairs that differ by 2, the so called twin primes, e.g. (11, 13) and (101, 103). K-tuples are groupings of primes adhering to specific patterns, usually designated as (k, d) groupings, where k is the number of primes in the group and d the total spacing between its first and last prime [4]. Thus, Polignac’s pairs are type (2, n), where n is any even number. Three named (2, n) tuples are Twin Primes (2, 2), Cousin Primes (2, 4), and Sexy Primes (2, 6). The paper shows there are many more Sexy Primes (in fact they are the most abundant) than Twins or Cousins, though an infinity of each, and an infinity of any other (2, n) tuple. I begin by presenting the foundation of Prime Generator Theory (PGT), through its various components. I start with Prime Generators (PG), which as their name implies, generate all the primes. Each larger PG is more efficient at identifying primes by reducing the number space they can possibly exist within.
    [Show full text]
  • Solving Polignac's and Twin Prime Conjectures Using
    Solving Polignac’s and Twin Prime Conjectures Using Information-Complexity Conservation John Y. C. Ting1 1 Rural Generalist in Anesthesia and Emergency medicine, Dental and Medical Surgery, 729 Albany Creek Road, Albany Creek, Queensland 4035, Australia Correspondence: Dr. John Y. C. Ting, 729 Albany Creek Road, Albany Creek, Queensland 4035, Australia. E-mail: [email protected] Abstract: Prime numbers and composite numbers are intimately related simply because the complementary set of com- posite numbers constitutes the set of natural numbers with the exact set of prime numbers excluded in its entirety. In this research paper, we use our ’Virtual container’ (which predominantly incorporates the novel mathematical tool coined Information-Complexity conservation with its core foundation based on this [complete] prime-composite number relation- ship) to solve the intractable open problem of whether prime gaps are infinite (arbitrarily large) in magnitude with each individual prime gap generating prime numbers which are again infinite in magnitude. This equates to solving Polignac’s conjecture which involves analysis of all possible prime gaps = 2, 4, 6,... and [the subset] Twin prime conjecture which involves analysis of prime gap = 2 (for twin primes). In conjunction with our cross-referenced 2017-dated research paper entitled ”Solving Riemann Hypothesis Using Sigma-Power Laws” (http://viXra.org/abs/1703.0114), we advocate for our ambition that the Virtual container research method be considered a new method of mathematical proof especially for solving the ’Special-Class-of-Mathematical-Problems with Solitary-Proof-Solution’. Keywords: Information-Complexity conservation; Polignac’s conjecture; Riemann hypothesis; Twin prime conjecture Mathematics Subject Classification: 11A41, 11M26 1.
    [Show full text]