The primary objective of this work is to develop an accelerated version of the method of trial division, which is the simplest of the numerous attempts employed in the determination of the primality of a number. By folding the odd number line to form a matrix it is readily seen that there are infinite sets of numbers which cannot possibly be prime, that there are primes which can never be members of a set of twins and it is not possible that three (or more) consecutive odd numbers can be prime. The modified version of trial division developed here is used in conjunction with a simple formula which contains only the row and column numbers of the matrix. The sequence of operations of which this method is comprised yields either the primality of any number of interest or its factors and is eminently suitable for computerisation.
Table of Contents
1. Introduction
2. Analysis
3. Array
4. Discussion
5. Appendix
6. References
Objectives and Key Themes
The primary objective of this work is to develop an accelerated version of the trial division method, providing a more efficient way to determine the primality of a number through matrix-based reduction of the search space.
- Mathematical optimization of the trial division method.
- Rearrangement of odd numbers into a matrix structure to identify non-prime sequences.
- Application of simple formulas to determine the location and primality of any odd number.
- Suitability of the developed algorithm for computerization.
Excerpt from the Book
Analysis
If we write out the odd numbers it is noted that every fourth number is divisible by 3 and hence cannot be prime. It then follows that we may construct a series of ‘cages’ containing two numbers which may, or may not, be prime. Further, if we stack the odd number line as shown in the table below it is seen that we have formed a matrix having 15 columns and, assuming that the odd numbers extend to infinity, will have an infinite number of rows. The numbers shown underlined and in bold are prime numbers obtained using a prime number calculator available on Wikipedia. Inspection of the array shows that, with the exception of columns which have a prime number as their first entry, there can never be prime numbers in columns 1, 2, 4, 7, 10, 12, and 13. Any number in the table (and the extension of the table to infinity) which is divisible by 3 can be rearranged to yield other numbers which cannot be prime; in the context of this work any rearranged number must not end in an even number and any rearranged number which ends in a 5 is a member of one of columns 2, 7, or 12. It should be noted that the ‘spacing’ between adjacent rows is 30, whilst that between adjacent columns is 2.
Summary of Chapters
Introduction: Provides a background on prime numbers and outlines the motivation to improve the efficiency of the traditional trial division method.
Analysis: Introduces the concept of organizing odd numbers into a matrix to filter out composite numbers and establish a framework for testing primality.
Array: Demonstrates the practical application of the proposed method on specific numbers and discusses how to handle extremely large primes, such as Mersenne primes.
Discussion: Evaluates the utility of the method and briefly touches upon theoretical implications regarding the distribution of primes and mathematical structures.
Appendix: Offers a step-by-step numerical illustration of the algorithm using a concrete example to verify the primality of a number.
References: Lists the external sources cited within the research work.
Keywords
Primality, Trial Division, Matrix, Odd Numbers, Mersenne Prime, Number Theory, Algorithm, Computation, Mathematical Formula, Prime Factors, Riemann Zero, Integer, Distribution, Sequence, Arithmetic.
Frequently Asked Questions
What is the primary focus of this paper?
The paper focuses on developing an accelerated version of the trial division method for determining whether a given number is prime.
What is the central theme of the research?
The research explores the structural properties of odd numbers by arranging them into a matrix, which helps in identifying composite numbers and reducing the computational effort required for primality testing.
What is the main goal of the author?
The author aims to present a simplified, efficient, and computer-friendly method to realize prime numbers, improving upon standard trial division.
Which mathematical method is utilized in this study?
The study utilizes a modified trial division method based on algebraic formulas derived from the positioning of numbers within a 15-column matrix.
What topics are discussed in the main body of the text?
The main body covers the construction of the number matrix, the derivation of mathematical formulas to locate numbers, and the application of these techniques to verify the primality of specific integers.
What keywords characterize the research?
Key terms include primality, trial division, number theory, matrix structure, and computational algorithms.
How does the matrix help in reducing calculations?
The matrix allows for the immediate identification of columns that cannot contain prime numbers, thereby effectively narrowing the search range for testing primality.
Can this method be applied to very large numbers like Mersenne primes?
Yes, the author discusses how the largest known Mersenne prime can be located within the developed matrix structure using the defined formula.
- Arbeit zitieren
- William Fidler (Autor:in), 2021, Determining of the primality of a number by the use of an accelerated version of trial division, München, GRIN Verlag, https://www.grin.com/document/1127210
