Available online at http://www.journalijdr.com International Journal of Development Research ISSN: 2230-9926 Vol. 11, Issue, 03, pp.45038-45042, March, 2021 https://doi.org/10.37118/ijdr.21265.03.2021 RESEARCH ARTICLE OPEN ACCESS ANALYSIS AND CONJECTURES REGARDING THE PRIME GAPS USING C# PROGRAMMING LANGUAGE *Bruno Luiz Silva Rodrighero ARTICLEInstitutoINFO Federal de Educação, CiênciaABSTRACT e Tecnologia de Rondônia (IFRO) & Universidade Presbiteriana Mackenzie ArticleArticleHistory:History: This paper brings four conjectures, based on analysis of prime gaps, to the knowledge of the th ReceivedReceived0xxxxxx,9 December, 2019 2020 scientific community. This research and its results were based on data obtained directly by ReceivedReceived inin revisedrevised formform computational algorithms, which were developed by the authors of this paper, for the analysis of th 1xxxxxxxx,4 January201, 20921 th prime numbers and prime gaps. These data were the basis for the conjectures proposed here. AcceptedAccepted 1xxxxxxxxx2 February, 20, 202119 However, they are only preliminary results and conjectures that require more investigation and Published online 15th March, 2021 Published online xxxxx, 2019 deeper analysis for future proof or refutation. The first conjecture presented states that the graph Key Words: for the first occurrences of all prime gaps behaves according to an exponential function that tends to a quadratic function. The second proposes which are the only prime gaps that occur Prime Gaps, Prime Numbers, consecutively in the sequence of prime gaps. The third conjecture proposes the creation of a new Twin Primes, Consecutive Prime Gaps. sequence of intervals, but now between prime gaps, in which the sum of its infinite elements will be equal to zero and consequently, may serve as a feasible argument that the twin primes occur *Corresponding author: infinitely. Bruno Luiz Silva Rodrighero Copyright © 2021, Bruno Luiz Silva Rodrighero. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Citation: Bruno Luiz Silva Rodrighero. 2021. “Analysis and conjectures regarding the prime gaps using c# programming language”, International Journal of Development Research, 11, (03) , 45038-45042. The research of the behavior of the function that describes the first INTRODUCTION occurrence of each PG will be the first point to be analyzed. The second will deal specifically with PG numbers that occur The research of prime numbers has great relevance not only in consecutively, for example, ([…], 6, 6, [...]) etc. Then, based on the mathematics, but in several fields of knowledge (NEUKIRCH, 2013). PG sequence, a new sequence will be derived with the interval Given its importance, several means and tools were created between PGs, which will be called IPG, that will be analysed and throughout history for its research. One of these ways of studying and another conjecture will be proposed concerning its behavior. For this looking for patterns in prime numbers is a sequence of numbers of the entire research, it is necessary to emphasize, the main data that intervals between prime numbers, also known as prime gaps. These support it were obtained through algorithms, developed by the authors numbers were already known and studied since antiquity (Stillwell, themselves, both for the analysis of the primes, as well as the PGs and 2010). Prime gaps, or PGs as it will be called from now on, are a IPG etc., which require more deep analysis. The readers are invited to sequence of numbers that can express important properties about the review these codes, which follow below, to replicate their results, to behavior of prime numbers. Further on, the main initial concepts increase the quantity of data, to better test each of the conjectures regarding this sequence will be detailed. For now, it must be said that presented here and / or to present a better demonstration of the any tool or equation that makes it possible to predict the sequence of behavior of such sequences of numbers. PGs will also make it feasible to determine the prime numbers (Granville, 1995a). However, although this result is far from being achieved, there are other properties that can be extracted and studied MATERIALS AND METHODS based on the sequence of PGs that would be of value for the study of the prime numbers. In this paper, therefore, some of these properties Algorithms and programing language used in this research: Using will be studied and, based on data obtained with computational the C# programming language, the following algorithms and methods algorithms, preliminary conjectures will be proposed, which in the were developed for this research of PGs. Although other future should be revised, refined, better analyzed, so that they can programming languages may be more suited to improve the finally be proved or disproved. performance of the analysis, the authors were limited to use a 45039 Bruno Luiz Silva Rodrighero, Analysis and conjectures regarding the prime gaps using c# programming language language that they had better familiarity and qualification to program, this being C#. However, such algorithms can easily be replicated and translated into other programming languages by the reader. Below are the main methods and algorithms used: Algorithm (1) to check if the input number is a prime number: Algorithm (6) indicates the distance (quantity of numbers leading up) between the beginning of the sequence of prime gaps and the first occurrence of a chosen value: Algorithm (2) that checks what will be the next prime number in relation to the number indicated in the input: Algorithm (7) returns a list with the occurrence distances from the chosen prime gap to the prime gap 2: Algorithm (3) that indicates the number of prime numbers in the defined range: Algorithm (8) returns a list with only the distance between the chosen prime gaps. Algorithm (4) that returns the prime gaps of an interval defined with an ulong vector: Algorithm (5) that checks if there is a number in the list of prime gaps that occurs consecutively: 45040 International Journal of Development Research, Vol. 11, Issue, 03, pp.45038-45042, March, 2021 Table I: DistPG (y), in quantity of predecessor elements, of the referred prime gaps (x). 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 1 3 8 23 33 45 29 281 98 153 188 262 366 428 589 737 216 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 1182 3301 2190 1878 1830 7969 3076 3426 2224 3792 8027 4611 4521 3643 8687 66 68 70 72 74 76 78 80 82 84 86 88 90 14861 12541 15782 3384 34201 19025 17005 44772 23282 38589 14356 44902 34214 Initial Concepts: Prime gaps are a sequence of numbers obtained the PG 74 after 34,201 positions. Thus, it appears that some specific through the difference between two consecutive prime numbers, such PGs occur more frequently than others. that , (where p is a prime number and PG is a prime gap), which results, for example, in In this way, if the terms y are placed in ascending order, and the etc. (WEISSTEIN,= − 2001). Thus, using the algorithm (4), for the values of x are changed by 1 to 45, the graph in Figure 1 is formed: following primes, the first 60 PGs are defined,= 1, in =parentheses,= 2, as an= example4 : |2, (1), 3|, |3, (2), 5|, |5, (2), 7| , |7, (4), 11| , |11, (2), 13| , |13, (4), 17| , |17, (2), 19| , |19, (4), 23| , |23, (6), 29| , |29, (2), 31| , |31, (6), 37| , |37, (4), 41| , |41, (2), 43| , |43, (4), 47| , |47, (6), 53| , |53, (6), 59| , |59, (2), 61| , |61, (6), 67| , |67, (4), 71| , |71, (2), 73| , |73, (6), 79| , |79, (4), 83| , |83, (6), 89| , |89, (8), 97| , |97, (4), 101| , |101, (2), 103| , |103, (4), 107| , |107, (2), 109| , |109, (4), 113| , |113, (14), 127| , |127, (4), 131| , |131, (6), 137| , |137, (2), 139| , |139, (10), 149| , |149, (2), 151| , |151, (6), 157| , |157, (6), 163| , |163, (4), 167| , |167, (6), 173| , |173, (6), 179| , |179, (2), 181| , |181, (10), 191| , |191, (2), 193| , |193, (4), 197| , |197, (2), 199| , |199, (12), 211| , |211, (12), 223| , |223, (4), 227| , |227, (2), 229| , |229, (4), 233| , |233, (6), 239| , |239, (2), 241| , |241, (10), 251| , |251, (6), 257| , |257, (6), 263| , |263, (6), 269| , |269, (2), 271| , |271, (6), 277| , |277, (4), 281| , |281, (2), 283|. Briefly: 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, Figure 1. Points in Table 1 plotted in a graph, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, with increasing values 12, 12, 4, 2, 4, 6, 2, 10, 6, 6, 6, 2, 6, 4, 2. Looking at the graph above, it is noticeable a plausible exponential or quadratic function pattern forming. By analyzing the data, it is tenable Due to the importance of prime numbers, several methods have been to raise some assumptions: created since antiquity to analyze existing patterns regarding these numbers in order to propose explanations and conjectures for the Conjecture (1): The function that describes the growth of the interval understanding their behavior. PGs emerged with this main purpose, between primes, DistPG, follows an exponential pattern that tends to evolving over time to become an important subject with diverse and quadratic, by the following approximation: [1] , for profound properties as well as important conjectures , considering such that the disparities in some of its (NAZARDONYAVI, 2012). Some of these properties are, for intervals will be reduced as larger PGs are computed,= tending+ + towards3 example: PG 1 occurs only once between the primes 2 and 3, while 2 a >quadratic0 function.