DOCSLIB.ORG

The Prime Numbers Hidden Symmetric Structure and Its Relation to the Twin Prime Infinitude and an Improved Prime Number Theorem

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Prime Numbers Hidden Symmetric Structure and Its Relation to the Twin Prime Infinitude and an Improved Prime Number Theorem The Prime Numbers Hidden Symmetric Structure and its Relation to the Twin Prime Infinitude and an Improved Prime Number Theorem. Imre Mikoss Universidad Simón Bolívar, Dep. de Formación Integral y Ciencias Básicas, Valle de Sartenejas, Baruta, Caracas, Venezuela. email: [email protected] Due to the sieving process represented by a Secondary Sieving Map; during the generation of the prime numbers, geometric structures with definite symmetries are formed which become evident through their geometrical representations. The study of these structures allows the development of a constructive prime generating formula. This defines a mean prime density yielding a second order recursive and discrete prime producing formula and a second order differential equation whose solutions produce an improved Prime Number Theorem. Applying these results to twin prime pairs is possible to generate a “Twin Prime Number Theorem” and important conclusions about the infinitude of the twin primes. structure created by the construction of the primes, the Introduction reason why the twin primes should be infinite Most of the knowledge about the sequence of numbers becomes clear. This last is known as the Twin Prime 1 named primes is a set of unproved theorems and Conjecture , which is one of the unproved icons in the conjectures 1. The reason of this fact remains as elusive modern number theory. Using a mean prime density as the very proofs. The approach of this work proposes derived from the geometric construction, a discrete a new and heuristic way of treating these problems. As second order equation is obtained as well as a it is well known, sieving algorithms are the only continuous version of it, which is a second order non- efficient way to produce primes. This fact should be linear differential equation. This is a first taken as an indication that sieving is the natural way of approximation for a prime differential equation and is producing primes. A myth has been generated about used to demonstrate constructively and to improve the the sequence of primes, and many attempts have been best known approximation to the primes, known as the undertaken to find some properties which should be Prime Number Theorem. intrinsic to the sequence itself, despite its generating procedure 2. Most of them (perhaps all of them) are Sieving as a Recursive Map based on the famous Euler formula which relates the Usually recursive maps act on subsets of the real sequence of primes with the Zeta function 3. This numbers, although some of them are defined on formula is nothing else than an analytic representation geometrical objects 5. A recursive map which acts on of the sieving process 4. Through the construction of infinite and discrete sequences of numbers is proposed this formula a limit is taken, which eliminates the very here. This map called Secondary Sieving Map (SSM) heart of the process. Due to this limit, the relevance of is denoted with the Greek letter b. Given: the erased part has remained hidden from the scientific community through centuries. In the present work the structure of this hidden part is made evident through the iteration of a Secondary Sieving Map. Through the 2 However the number one does appear. This is a η={ ηηα , β , ηη χ , δ ,.... ∞} persisting characteristic in b’s successive applications An infinite and discrete sequence of natural on n: the number one always survives and the pivot numbers which satisfies: number used to generate the last iteration obviously disappears from it, because it was multiplied by one η< η < η < η < <∞ α β χ δ .... and extracted. In the second generation, the main Then b act on this sequence h in the following features of these sequences start to emerge: way: β2 ()()= ββ( ) = β 1 == 2 n n( nn()2) () 2,3 βη=− ηη* =− ηηη ⋅ {} = ( ) β 1,5,7,11,13,17,19,23,25,29,... {}{}1,7,13,19,25,...∪ 5,11,17,23,29,... = η=⋅ ηηηηηηηη ⋅ ⋅ ⋅∞ 1 * {βαβ , ββγβδ , , ... } ()()6⋅+n 1∪ 6 ⋅+ n 56 =⋅+ n 5 The minus sign means element extraction . The Where U means as usual the union of two sets temptation to factorize h should be avoided because and the last equation is a convenient way to write the the resulting equation is not the original; hb is a existence of two overlapped linear behaviors. Observe number whereas h is a set. In order to make the last that the set of pivot numbers (which record is kept in definition operational, h and h* should fulfill h û h*. n’s sub index) starts to form the set of prime numbers. The second element of the original sequence hb, is 2 1 Note also that the sequences n (2, 3) and n (2) are called the “pivot number”. The outcomes of applying qualitatively different: a splitting has occurred in the b is named generation. The natural numbers set first one. Instead of one linear function of n, there are (without the cero) * = n complies with all the two overlapped and simultaneous. In order to features required to be an argument of b. Applying b understand this segregation, the symmetric features of on n recursively is similar, but not equal, to the the SSM should be examined through a heuristic Eratosthenes sieve, because the last one is not applied geometrical representation of it, shown in the next on an infinite sequence and it was not conceived as an section. As a final sentence for this section, it should iterative mapping. The SSM applied to n, could be be noted that in the last decades some insight has been written in Mathematica ® as gained about a fractal structure of the primes 6, and it is “Nest[Complement[#,#[[2]]*#]&,Range[m1],m2]”, well known in dynamical systems that fractal where m1 is the size of the natural numbers subset on structures are produced by iterative mappings 5. The which it will be applied, and m2 is the desired SSM acting on n could be the basis for the fractal iterations number (it is impossible to act on a infinite structure of the primes. set with a computer). Acting once whit b on n produces the first generation, the set of odd numbers: Mirror Symmetry and Periodicity in Generations, as a Geometrical Image of a Multiple Linear β (n) = n1 ={ 1,3,5,7,...} =2.n+1 ()2 Representation Using this last notation, n 0 = n (generation The SSM can be represented geometrically using an cero). Observe that the first pivot number (the number infinite chain of curves (jumps) which connects the 2 which appears as a sub index in parentheses) used to sequence of numbers denoted with h* (see equations 1 generate de odd numbers, is not present in them. and 2). The non-touched numbers corresponds to the 3 Figure 1 | Generatio ns and Discrete Scale Invariance Graphical Representations . In Part A the first three generations geometric structure is shown through an analogy between extracted and touched numbers. The periodicity in each generation and their mirror symmetries are evident in the structures of the touching curves. In Part B the DSI of the Second Generation is shown. first generation. Further iterative applications of b can mentioned in the past section is caused by the be made on the same graph simply overlapping the incommensurability of the first pivot number (2) and geometrical representations of the corresponding h*. the second (3) which sets the first untouched numbers For example in Figure 1, the representations of three (1 and 5) to lie symmetrically around the number generations are seen in separate lines. The touched three. Then, due to the six-fold periodicity, the two numbers under b’s action, are just touched once linear behaviours represented in equation (3) are whereas in the graphical representation multiple produced. Note that mirror symmetry around the touching is allowed. In this way the geometrical numbers 3, 9, 15… as well as around the numbers 6, features are better observed. From these drawings can 12, 18… starts to emerge. This symmetry will become be inferred that due to the successive applications of more evident in the third generation and afterwards: the SSM, periodic structures form spontaneously. The β 3(n) = n 3 ={1,7,11,13,17,19, 23, 29,31...} = period of a particular generation is given by the ()2,3,5 1 31 61 91 121 151 181 ... 1 multiplication of all the previous pivot numbers (the 7 37 67 97 127 157 187 ... 7 formal demonstration will be published elsewhere). 11 41 71 101 131 161 191 ... 11 13 43 73 103 133 163 193 ... 13 Actually these structures are periodic both in the =30 ⋅n + 17 47 77 107 137 167 197 ... 17 generations but also in the superposition of the h* 19 49 79 109 139 169 199 ... 19 produced and extracted during each generation. In fact 23 53 83 113 143 173 203 ... 23 this last superposition is the most notorious in the 29 59 89 119 149 179 209 ... 29 geometrical representations from Figure 1, Part A. As it can be observed in the same figure, the splitting 4 This last equation is again a condensed and through its generation will certainly forecast all the convenient way to represent the third generation. In primes between itself and its square, this interval is Figure 1 the corresponding representation shows a called PCI. The PCI is depleted from the pivot number new period (30 = 2.3.5) and a new mirror symmetry multiples and the other numbers contained within have around the multiples of 30 and their halves. In order to their squares, cubes, etc certainly in the outside of this advance in a description of the subject, some interval.
Load more

Recommended publications
  • An Amazing Prime Heuristic.Pdf
    This document has been moved to https://arxiv.org/abs/2103.04483 Please use that version instead. AN AMAZING PRIME HEURISTIC CHRIS K. CALDWELL 1. Introduction The record for the largest known twin prime is constantly changing. For example, in October of 2000, David Underbakke found the record primes: 83475759 264955 1: · The very next day Giovanni La Barbera found the new record primes: 1693965 266443 1: · The fact that the size of these records are close is no coincidence! Before we seek a record like this, we usually try to estimate how long the search might take, and use this information to determine our search parameters. To do this we need to know how common twin primes are. It has been conjectured that the number of twin primes less than or equal to N is asymptotic to N dx 2C2N 2C2 2 2 Z2 (log x) ∼ (log N) where C2, called the twin prime constant, is approximately 0:6601618. Using this we can estimate how many numbers we will need to try before we find a prime. In the case of Underbakke and La Barbera, they were both using the same sieving software (NewPGen1 by Paul Jobling) and the same primality proving software (Proth.exe2 by Yves Gallot) on similar hardware{so of course they choose similar ranges to search. But where does this conjecture come from? In this chapter we will discuss a general method to form conjectures similar to the twin prime conjecture above. We will then apply it to a number of different forms of primes such as Sophie Germain primes, primes in arithmetic progressions, primorial primes and even the Goldbach conjecture.
    [Show full text]
  • A Note on the Origin of the Twin Prime Conjecture
    A Note on the Origin of the Twin Prime Conjecture by William Dunham Department of Mathematics & Computer Science, Muhlenberg College; Department of Mathematics, Harvard University (visiting 2012-2013) More than any other branch of mathematics, number As the title suggests, de Polignac’s paper was about theory features a collection of famous problems that took prime numbers, and on p. 400 he stated two “theorems.” centuries to be proved or that remain unresolved to the It should be noted that he was not using the word in its present day. modern sense. Rather, de Polignac confirmed the truth of Among the former is Fermat’s Last Theorem. This these results by checking a number of cases and thereby states that it is impossible to find a whole number n ≥ 3 called them “theorems.” Of course, we would call them, at and whole numbers x , y , and z for which xn + yn = zn . best, “conjectures.” The true nature of these statements is suggested by the fact that de Polignac introduced them In 1640, as all mathematicians know, Fermat wrote this in under the heading “Induction and remarks” as seen below, a marginal note and claimed to have “an admirable proof” in a facsimile of his original text. that, alas, did not fit within the space available. The result remained unproved for 350 years until Andrew Wiles, with assistance from Richard Taylor, showed that Fermat was indeed correct. On the other hand, there is the Goldbach conjecture, which asserts that every even number greater than 2 can be expressed as the sum of two primes.
    [Show full text]
  • Number 73 Is the 37Th Odd Number
    73 Seventy-Three LXXIII i ii iii iiiiiiiiii iiiiiiiii iiiiiiii iiiiiii iiiiiiii iiiiiiiii iiiiiiiiii iii ii i Analogous ordinal: seventy-third. The number 73 is the 37th odd number. Note the reversal here. The number 73 is the twenty-first prime number. The number 73 is the fifty-sixth deficient number. The number 73 is in the eighth twin-prime pair 71, 73. This is the last of the twin primes less than 100. No one knows if the list of twin primes ever ends. As a sum of four or fewer squares: 73 = 32 + 82 = 12 + 62 + 62 = 12 + 22 + 22 + 82 = 22 + 22 + 42 + 72 = 42 + 42 + 42 + 52. As a sum of nine or fewer cubes: 73 = 3 13 + 2 23 + 2 33 = 13 + 23 + 43. · · · As a difference of two squares: 73 = 372 362. The number 73 appears in two Pythagorean triples: [48, 55, 73] and [73, 2664, 2665]. Both are primitive, of course. As a sum of three odd primes: 73 = 3 + 3 + 67 = 3 + 11 + 59 = 3 + 17 + 53 = 3 + 23 + 47 = 3 + 29 + 41 = 5 + 7 + 61 = 5 + 31 + 37 = 7 + 7 + 59 = 7 + 13 + 53 = 7 + 19 + 47 = 7 + 23 + 43 = 7 + 29 + 37 = 11 + 19 + 43 = 11 + 31 + 31 = 13 + 13 + 47 = 13 + 17 + 43 = 13 + 19 + 41 = 13 + 23 + 37 = 13 + 29 + 31 = 17 + 19 + 37 = 19 + 23 + 31. The number 73 is the 21st prime number. It’s reversal, 37, is the 12th prime number. Notice that if you strip off the six triangular points from the 73-circle hexagram pictured above, you are left with a hexagon of 37 circles.
    [Show full text]
  • Conjecture of Twin Primes (Still Unsolved Problem in Number Theory) an Expository Essay
    Surveys in Mathematics and its Applications ISSN 1842-6298 (electronic), 1843-7265 (print) Volume 12 (2017), 229 { 252 CONJECTURE OF TWIN PRIMES (STILL UNSOLVED PROBLEM IN NUMBER THEORY) AN EXPOSITORY ESSAY Hayat Rezgui Abstract. The purpose of this paper is to gather as much results of advances, recent and previous works as possible concerning the oldest outstanding still unsolved problem in Number Theory (and the most elusive open problem in prime numbers) called "Twin primes conjecture" (8th problem of David Hilbert, stated in 1900) which has eluded many gifted mathematicians. This conjecture has been circulating for decades, even with the progress of contemporary technology that puts the whole world within our reach. So, simple to state, yet so hard to prove. Basic Concepts, many and varied topics regarding the Twin prime conjecture will be cover. Petronas towers (Twin towers) Kuala Lumpur, Malaysia 2010 Mathematics Subject Classification: 11A41; 97Fxx; 11Yxx. Keywords: Twin primes; Brun's constant; Zhang's discovery; Polymath project. ****************************************************************************** http://www.utgjiu.ro/math/sma 230 H. Rezgui Contents 1 Introduction 230 2 History and some interesting deep results 231 2.1 Yitang Zhang's discovery (April 17, 2013)............... 236 2.2 "Polymath project"........................... 236 2.2.1 Computational successes (June 4, July 27, 2013)....... 237 2.2.2 Spectacular progress (November 19, 2013)........... 237 3 Some of largest (titanic & gigantic) known twin primes 238 4 Properties 240 5 First twin primes less than 3002 241 6 Rarefaction of twin prime numbers 244 7 Conclusion 246 1 Introduction The prime numbers's study is the foundation and basic part of the oldest branches of mathematics so called "Arithmetic" which supposes the establishment of theorems.
    [Show full text]
  • Arxiv:Math/0103191V1 [Math.NT] 28 Mar 2001
    Characterization of the Distribution of Twin Primes P.F. Kelly∗and Terry Pilling† Department of Physics North Dakota State University Fargo, ND, 58105-5566 U.S.A. Abstract We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like fixed probability random events. As the sequence of primes grows, the probability decreases as the reciprocal of the count of primes to that point. The manner of the decrease is consistent with the Hardy–Littlewood Conjecture, the Prime Number Theorem, and the Twin Prime Conjecture. Furthermore, our probabilistic model, is simply parameterized. We discuss a simple test which indicates the consistency of the model extrapolated outside of the range in which it was constructed. Key words: Twin primes MSC: 11A41 (Primary), 11Y11 (Secondary) 1 Introduction Prime numbers [1], with their many wonderful properties, have been an intriguing subject of mathematical investigation since ancient times. The “twin primes,” pairs of prime numbers {p,p+ 2} are a subset of the primes and themselves possess remarkable properties. In particular, we note that the Twin Prime Conjecture, that there exists an infinite number of these prime number pairs which differ by 2, is not yet proven [2, 3]. In recent years much human labor and computational effort have been expended on the subject of twin primes. The general aims of these researches have been three-fold: the task of enumerating the twin primes [4] (i.e., identifying the members of this particular subset of the natural numbers, and its higher-order variants “k-tuples” of primes), the attempt to elucidate how twin primes are distributed among the natural numbers [5, 6, 7, 8] (especially searches for long gaps in the sequence [9, 10, 11]), and finally, the precise estimation of the value of Brun’s Constant [12].
    [Show full text]
  • Eureka Issue 61
    Eureka 61 A Journal of The Archimedeans Cambridge University Mathematical Society Editors: Philipp Legner and Anja Komatar © The Archimedeans (see page 94 for details) Do not copy or reprint any parts without permission. October 2011 Editorial Eureka Reinvented… efore reading any part of this issue of Eureka, you will have noticed The Team two big changes we have made: Eureka is now published in full col- our, and printed on a larger paper size than usual. We felt that, with Philipp Legner Design and Bthe internet being an increasingly large resource for mathematical articles of Illustrations all kinds, it was necessary to offer something new and exciting to keep Eu- reka as successful as it has been in the past. We moved away from the classic Anja Komatar Submissions LATEX-look, which is so common in the scientific community, to a modern, more engaging, and more entertaining design, while being conscious not to Sean Moss lose any of the mathematical clarity and rigour. Corporate Ben Millwood To make full use of the new design possibilities, many of this issue’s articles Publicity are based around mathematical images: from fractal modelling in financial Lu Zou markets (page 14) to computer rendered pictures (page 38) and mathemati- Subscriptions cal origami (page 20). The Showroom (page 46) uncovers the fundamental role pictures have in mathematics, including patterns, graphs, functions and fractals. This issue includes a wide variety of mathematical articles, problems and puzzles, diagrams, movie and book reviews. Some are more entertaining, such as Bayesian Bets (page 10), some are more technical, such as Impossible Integrals (page 80), or more philosophical, such as How to teach Physics to Mathematicians (page 42).
    [Show full text]
  • New Yorker Article About Yitang Zhang
    Solving an Unsolvable Math Problem - The New Yorker http://www.newyorker.com/magazine/2015/02/02/pursuit-beautySave paper and follow @newyorker on Twitter Profiles FEBRUARY 2, 2015 ISSUE TABLE OF CONTENTS The Pursuit of Beauty Yitang Zhang solves a pure-math mystery. BY ALEC WILKINSON don’t see what difference it can make Unable to get an now to reveal that I passed high-school academic position, Zhang kept the books for a math only because I cheated. I could Subway franchise. add and subtract and multiply and PHOTOGRAPH BY PETER Idivide, but I entered the wilderness when BOHLER words became equations and x’s and y’s. On test days, I sat next to Bob Isner or Bruce Gelfand or Ted Chapman or Donny Chamberlain—smart boys whose handwriting I could read—and divided my attention between his desk and the teacher’s eyes. Having skipped me, the talent for math concentrated extravagantly in one of my nieces, Amie Wilkinson, a professor at the University of Chicago. From Amie I first heard about Yitang Zhang, a solitary, part-time calculus teacher at the University of New Hampshire who received several prizes, including a MacArthur award in September, for solving a problem that had been open for more than a hundred and fifty years. The problem that Zhang chose, in 2010, is from number theory, a branch of pure mathematics. Pure mathematics, as opposed to applied mathematics, is done with no practical purposes in mind. It is as close to art and philosophy as it is to engineering. “My result is useless for industry,” Zhang said.
    [Show full text]
  • On Squaring a Number and T-Semi Prime Number
    International Journal of Modern Research in Engineering and Technology (IJMRET) www.ijmret.org Volume 3 Issue 3 ǁ March 2018. ON SQUARING A NUMBER AND T-SEMI PRIME NUMBER Mohammed Khalid Shahoodh Applied & Industrial Mathematics (AIMs) Research Cluster, Faculty of Industrial Sciences & Technology, Universiti Malaysia Pahang, Lebuhraya Tun Razak, 26300 Gambang, Kuantan, Pahang Darul Makmur ABSTRACT: In this short paper, we have provided a new method for finding the square for any positive integer. Furthermore, a new type of numbers are called T-semi prime numbers are studied by using the prime numbers. KEYWORDS –Prime numbers, Semi prime numbers, Mathematical tools, T-semi prime numbers. I. INTRODUCTION Let n 10, then It is well known that the field of number (10 1)22 (2 10 1) 81 19 100 (10) . theory is one of the beautiful branch in the In general, the square for any positive mathematics, because of its applications in several 2 subjects of the mathematics such as statistics, integer n can be express as (nn 1) (2 1).Next, numerical analysis and also in different other some examples are presented to illustrate the sciences.In the literature, there are many studies method which are given as follows. had discovered some specific topics in the number theory but still there are somequestions are Example 1. Consider n 37 and n 197, then unsolved yet, which make an interesting for the (n )2 (37) 2 (37 1) 2 (2 37 1) 1296 73 1369. mathematicians to find their answer. One of these (n )2 (197) 2 (197 1) 2 (2 197 1) 38416 393 38809.
    [Show full text]
  • Twin Primes and Other Related Prime Generalization
    Twin primes and other related prime generalization isaac mor [email protected] Abstract I developed a very special summation function by using the floor function, which provides a characterization of twin primes and other related prime generalization. x−2 x +1 x x −1 x − 2 (x) = − + − Where x 4 k =1 k k k k the initial idea was to use my function to prove the twin primes conjecture but then I started to look into other stuff for the twin primes conjecture the idea was to check this: when (x) = 2 then x −1 and x +1 are (twin) primes when (x) is an odd value then those cases (of the function getting odd values) are rarer then the twin prime case Let d be an odd value and (6a) = d , (6b) = 2 , (6c) = d where a b c meaning there is a twin prime case between two odd values cases of the function so you just need to show that one of the odd value cases will continue to infinity and this automatically will prove the twin prime conjecture http://myzeta.125mb.com/100000_first_values.html http://myzeta.125mb.com/100000_odd_only.html http://myzeta.125mb.com/100000_odd_twin.html http://myzeta.125mb.com/1000000_odd_twin.html other then that , this function has a very nice, weird and sometimes gives totally unexpected results for instance , look what happens when (x) = 7 If p is a prime (bigger then 3) such that 9p − 2 is also a prime then (1+ p)/ 2 is a continued fraction with a period 6 1+ 19 1 1+ 59 1 = 2 + = 4 + 2 1 1 1+ 2 2 + 1 1 2 + 1+ 1 1 8 + 14 + 1 1 2 + 1+ 1 1 1+ 2 + 1 1 3 + 7 + If p is a prime such that
    [Show full text]
  • Primes Counting Methods: Twin Primes 1. Introduction
    Primes Counting Methods: Twin Primes N. A. Carella, July 2012. Abstract: The cardinality of the subset of twin primes { p and p + 2 are primes } is widely believed to be an infinite subset of prime numbers. This work proposes a proof of this primes counting problem based on an elementary weighted sieve. Mathematics Subject Classifications: 11A41, 11N05, 11N25, 11G05. Keywords: Primes, Distribution of Primes, Twin Primes Conjecture, dePolignac Conjecture, Elliptic Twin Primes Conjecture, Prime Diophantine Equations. 1. Introduction The problem of determining the cardinality of the subset of primes { p = f (n) : p is prime and n !1 }, defined by a function f : ℕ → ℕ, as either finite or infinite is vastly simpler than the problem of determining the primes counting function of the subset of primes (x) # p f (n) x : p is prime and n 1 " f = { = # $ } The cardinality of the simplest case of the set of all primes P = { 2, 3, 5, … } was settled by Euclid over two millennia ago, see [EU]. After that event,! many other proofs have been discovered by other authors, see [RN, Chapter 1], and the literature. In contrast, the determination of the primes counting function of the set of all primes is still incomplete. Indeed, the current asymptotic formula (25) of the " (x) = #{ p # x : p is prime } primes counting function, also known as the Prime Number Theorem, is essentially the same as determined by delaVallee Poussin, and Hadamard. ! The twin primes conjecture claims that the Diophantine equation q = p + 2 has infinitely many prime pairs solutions. More generally, the dePolignac conjecture claims that for any fixed k ≥ 1, the Diophantine equation q = p + 2k has infinitely many prime pairs solutions, confer [RN, p.
    [Show full text]
  • Some New Results on Gaps Between Consecutive Primes
    i i János Pintz, András Biró, Kálmán Győry, Gergely Harcos, Miklós Simonovits, József Szabados (Eds.): Number Theory, Analysis, and Combinatorics — 2013/11/19 — 12:23 — page 261 i i János Pintz Some new results on gaps between consecutive primes Abstract: The paper presents a brief history of results about small gaps between con­ secutive primes and mentions some recent results of the author, in some cases only with a sketch of the main ideas, in some cases with detailed proofs. Keywords: Distribution of primes, gaps between primes, Selberg’s sieve Classification: Primary 11N05, Secondary 11P32 || János Pintz: Rényi Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Reál­ tanoda u. 13–15, H-1053, Hungary, E-mail: [email protected] 1 Approximations to the twin prime conjecture before 2000 In the present work we will give a survey about some new results concerning small gaps between consecutive primes. In the following let P denote the set of the primes, ℎ ℎ the prime and the difference between consecutive primes, that is, =+1 −. (1.1) The famous Twin Prime Conjecture, =2 infinitely often, (1.2) would answer the most important problem about the smallest values of which oc­ curs infinitely often. However, we will investigate also various conjectures and results which do not follow from (1.2). We will also discuss the well-known generalization of (1.1), formulated in 1849 by de Polignac [18]: + =2 infinitely often for any ∈ℤ . (1.3) We will call an even number 2 aPolignacnumberif =2infinitely often. Polignac’s conjecture (1.2) can be formulated with this definition as Polignac Conjecture.
    [Show full text]
  • Calculating the Number of Twin Primes with Specified Distance Between Them Based on the Simplest Probabilistic Model
    U.P.B. Sci. Bull. Series A, Vol. 80, Iss.3, 2018 ISSN 1223-7027 CALCULATING THE NUMBER OF TWIN PRIMES WITH SPECIFIED DISTANCE BETWEEN THEM BASED ON THE SIMPLEST PROBABILISTIC MODEL Sarsengali ABDYMANAPOV1, Serik ALTYNBEK2, Alua TURGINBAYEVA3 Building modern cryptosystems requires very big primes. This research studies the characterization of primes, the problem of detecting and assessing the number of primes in a numerical series and provides other results regarding the distribution of primes in a natural series. It should be noted that the results were obtained within the framework of the simplest probabilistic model. This research verifies the prospects of obtaining an estimate for the number of r-pairs based on some statistical models of their formation. Keywords: composite numbers; divisibility criterion, primes; sequence of numbers; twin primes, cryptography. 1. Introduction Primes are involved in modern cryptography – the science of secret message coding and decoding. Since many cryptographic systems rely on the research of primes and related theoretical and numerical problems, technological and algorithmic advances in this field have become paramount. Our ability to find big primes and prove that they are prime predetermined our ability to influence the situation that makes cryptographers comfortable. Based on estimate made for the number of twin primes on a particular interval, one can build a pseudorandom number generator or use distribution of primes in cryptography. The latter will be the subject of our research – calculating the number of primes on a specified interval and an attempt to solve the problem of probabilistic distribution of twin primes. Numerous publications have been devoted to methods for synthesizing the PRBS generators and analyzing their characteristics [1-2].
    [Show full text]