Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology (original) (raw)
Related papers
Prime Numbers and Their Digital Roots
IRJET, 2022
Prime numbers have remained a matter of interest in the mathematical, scientific as well as technical community. Prime numbers follow an enigmatic pattern that is still unknown to date but holds great importance. Prime numbers are building blocks of numbers as atoms are of molecules therefore it is necessary to understand their properties and solve the pattern. This paper shows one such property which is how prime numbers can have specific digital roots only. It further proves this case by using the properties of digital roots. Large numbers are time-consuming to check for primality. In this paper, two simple algorithms are created to find if the number is composite or probable prime before having it checked for primality using existing primality tests, and further distribution of digital roots among different types of prime numbers are shown using pie charts obtained from python programs.
A first ever precise predictive prime number spiral placement
International Journal of Applied Mathematical Research, 2013
This mathematical rhythm of the reality of prime numbers is foreign to current mathematics because prime numbers and generally all numbers function as placement in empty space, rather than counting beans. This final paper on the-1 mathematics, clearly demonstrates the method and the rationality of the random variability of prime numbers, and confirms the central-spiral mathematical arrangement of prime numbers around a half-line. This is purely a numbers phenomenon as arranged in a spiral cone. If current mathematics cannot decipher the very simple entrée presented here in open numbers, it is too bad, for the author is just beginning to grasp at it. The 8 referenced published manuscripts that precede this manuscript specifically qualify the segregated infinite series of prime numbers with the half-line value 18(6*3,-6), and other half-line values starting at 12, as infinitely calculable. The solution and the entered proof of a precise symmetrical Prime number placement has come after much pain and ridicule (what is not understood is ridiculed by the meager in knowledge) .The latter is the focus of the mathematical entrée here, as much sophistication needs to be done, but that will come at the authors discretion. Current mathematics is not set up to solve this final solution to prime numbers; it may observe it, as it observes its large pumpkin Prime numbers.
2021
The paper is the ultimate prime numbers algorithm that gets rid of the unneccessary mystery about prime numbers. All the numerous arithmetic series patterns observed between various prime numbers are clearly explained with an elegant "pattern of remainders". With this algorithm we prove that odd numbers too can make an Ulam spiral contrary to current ""proofs". At the end of the paper this author proves the relationship between a simple arithmetic series pattern and the Riehmann's prime numbers distribution equation. This paper would be important for encryption too. As an example, prime integer 1979 is expressed as 1.2.4.5.10.3.7.3.1.7.26.18.11.1. This makes even smaller primes useful for encryption as well.
Computer Simulation Model of Prime Numbers
Journal of Advances in Mathematics and Computer Science
Prime numbers represent one of the major open problems in number theory mostly in that at present it is not possible to state that the induction principle holds for them. The methodology of experimental mathematics has been little endeavored in this field thus the present report deals with an innovative approach to the problem of primes treated as raw experimental data and as elements of larger and larger finite sequences {Pn}. The modified Chi-square function in the form -1/X2k(A,n/μ) with the ad-hoc A, k and μ parameters is the best-fit function of the finite sequences of primes {Pn}, like the truncated progressions {Cαnα} with domain N and co-domain R+, being (α,k)≡(1+,0-) and k=2-2α and just like the function λn×n×ln(n), what leads to induction algorithms and to many fit relationships Pn≈P(n) though within the precisions of the calculations that is approximate. A bi-injective map can be set between the prime sequences and any of these three fit functions showing that the propert...
Hunting Prime Numbers from Human to Electronic Computers
2008
The present article discusses the changing attitudes of mathematicians towards intensive computations with particular cases as part of the discipline of number theory from the second half of the nineteenth century on. It focuses on the cases of Mersenne primes and irregular primes and discusses factors that shaped these attitudes in various historical contexts. It describes, in particular, the work of Emma and DH Lehmer and the unique approach they followed in their number theoretical investigations. This approach helped them take a leading role in the early incursion of digital computers into number theory. This incursion is described against the background of institutional, ideological and technological aspects of the development of the discipline of number theory in the USA in the period considered. Their cooperation in 1952 with Raphael Robinson in calculating new cases of Mersenne primes with SWAC at UCLA is discussed in some detail.
Pseudo-prime number simulation and its application for security purpose
MATEC Web of Conferences, 2018
Many public cryptography schemes rely on the use of prime numbers like for encryption and decryption. A prime number is one number that is widely used and large and consists of hundreds of digits, so it takes time to test whether the numbers are prime or not. Miller-Rabin is one algorithm that could be used to test prime number. Simulation to show how to test non-prime number elimination process can be used to determine the workings of the Miller-Rabin algorithm and also could be used as a media learning for students and lecturers to know how prime number test and generation.
A COMPLETE CLASSIFICATION OF THE MERSENNE'S PRIMES AND ITS IMPLICATIONS FOR COMPUTING
2020
A study of Mersenne's primes is carried out using the multiplicative group modulo 360 and a complete classification is obtained by its residual classes. This allows the search for Mersenne's primes to be classified into four subgroups mutually exclusive (disjoint) and contributes to the ordered selection of exponents to be computationally tested. According to this idea, Mersenne's trapeze is presented with the purpose of giving a geometric representation for this classification. Finally, from one of the theorems presented and proven for primes in modulo 360, a conjecture is established that could be solved by computing.
Unveiling the Hidden Order A Verified Pattern in Prime Number Generation
This paper presents a groundbreaking discovery in number theory: a deterministic and verified pattern for generating prime numbers using a geometric sequence based on powers of 4. This pattern, rigorously tested and confirmed up to the prime number 1999, definitively challenges the long-held belief that prime numbers occur randomly. We demonstrate a clear and predictable relationship between this sequence and prime number occurrence, revolutionizing our understanding of prime number distribution and opening new avenues in mathematics, cryptography, and quantum computing.
An algorithm for prime numbers311
There are several algorithms to obtain prime numbers. This paper presents an algorithm that can generate all prime numbers without any composite number. Also to consider stopping criterion standard for this algorithm, computer programs can prevent uncontrolled growth of composite numbers set.
Towards Cryptanalysis of a Variant Prime Numbers Algorithm
Mathematics and Computer Science, 2020
A hallmark of prime numbers (primes) that both characterizes it away from other natural numbers and makes it a challenging preoccupation, is its staunch defiance to be expressed in terms of composites or as a formula listing all its sequence of elements. A classification approach, was mapped out, that fragments a prime into two: its last digit (trailer-reduced set of residue {1, 3, 7 and 9}) and the other digits (lead) whose value is incremented by either 1, 2 or 3 thus producing a modulo-3 arithmetic equation. The algorithm tracked both Polignac's and modified Goldbach's coefficients in order to explore such an open and computationally hard problem. Precisely 20,064,735,430 lower primes of digits 2 to 12 were parsed through validity test with the powers of 10 primes of Sloane's A006988. Adopting at most cubic terms of predictors (as the next logical step of Euler's quadratic formula for primes) in multiple linear regression analysis, the generated outputs were analyzed to aid in building Akaike Information Criterion (AIC) best model with forward selection strategy. The main task was fragmented into atomic units of similar instances and types (an atom is a table of length 4,493,869 integer sequences where a database contains 30 relational tables with facilities for further reprocessing). A node, that supports parallel processing, stores 30 contiguous databases, and explores 4,044,482,100 successive integers. 513,649,226,700 lower natural numbers were explored by 127 hypothetical nodes yielding primes stored in 114,300 tables spread across 3,810 databases. Veriton S6630G computer system with 7.86GB usable memory and processor Intel(R) Core(TM) i7-4790 CPU @ 3.60GHz were amongst the remarkable resources. Contrary to the apparent chaotic camouflage of primes as a bundle, the partitioned sample spaces reveal some remarkable patterns in terms of intervals of both sequence numbers and distances of separation from their immediate neighborhoods.