Papers
Topics
Authors
Recent
Search
2000 character limit reached

Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology

Published 20 Mar 2019 in math.GM | (1903.08570v1)

Abstract: It is known that prime numbers occupy specific geometrical patterns or moduli when numbers from one to infinity are distributed around polygons having sides that are integer multiple of number 6. In this paper, we will show that not only prime numbers occupy these moduli, but non-prime numbers sharing these same moduli have unique prime-ness properties. When utilizing digital root methodologies, these non-prime numbers provide a novel method to accurately identify prime numbers and prime factors without trial division or probabilistic-based methods. We will also show that the icositetragon (24-sided regular polygon) is a unique polygon pertaining to prime numbers and their ultimate incidence and distribution.

Authors (2)
Citations (3)

Summary

  • The paper introduces a geometric approach aligning numbers along polygonal distributions to reveal consistent prime positions.
  • It defines quasi-primes as products of primes (≥5) and employs digital root analysis to construct a Q-grid for efficient prime detection.
  • The methodology, if robust, offers potential to streamline prime generation in cryptography and stimulate further research in number theory.

Insights on Accurate Prime Prediction via Quasi-Primes

The paper "Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology" by Grant and Ghannam introduces a non-traditional technique for identifying and analyzing prime numbers using geometrical patterns and the concept of quasi-primes. This approach is delineated through the observation of numbers distributed around integer-based polygonal structures, specifically focusing on those with sides that are multiples of six, with a particular emphasis on the icositetragon (a 24-sided polygon).

In summary, the authors propose that both prime and non-prime numbers lie within these specific moduli, and, leveraging digital root methodologies, the non-prime numbers can be used to detect prime numbers and factors without resorting to conventional trial division or probabilistic methods. The study primarily attributes special importance to a 24-based distribution, which ostensibly reveals unique properties related to prime numbers, including that every prime number greater than three is of the form 6k±16k \pm 1. This finding facilitates a novel method to predict prime numbers through an intricate matrix called the Q-grid, which can predict primes with asserted accuracy.

Key Contributions

  1. Polygonal Distribution Patterns: By aligning natural numbers along polygons with integer multiples of six sides, the paper claims that prime numbers occupy consistent positions. This method adds a geometric dimension to the study of primes.
  2. Introduction of Quasi-Primes: The novel terminology of quasi-primes is defined as numbers that are products of primes greater than or equal to five. This classification is purported to assist in identifying primes through their positional relationship in the Q-grid.
  3. Digital Root Methodology: The digital root analysis provides a deterministic method to filter out non-primes. The paper points out that numbers with a digital root of 3, 6, or 9 cannot be prime, supporting this with a proof provided in the appendix.
  4. Q-Grid for Prime Detection: The data structure called the Q-grid allows for efficient sorting and testing of numbers to certify primality without excessive computational labor compared to traditional methodologies.

Practical Implications

The implications of these findings are multifaceted. Practically, if proven robustly accurate, the presented methodology could streamline processes in cryptography that rely on prime number generation and factorization, which are traditionally computationally intensive operations. The introduction of the Q-grid and digital root-based methods offers potential reductions in searching space, thereby enhancing the efficiency of algorithms deployed in secure communication systems that utilize prime numbers.

Theoretical Implications and Future Directions

The authors' conclusions also present several theoretical implications, suggesting that more patterns exist in prime number distribution than previously acknowledged. Such findings underscore the possibility of revisiting established number theory concepts, potentially spurring fresh research into quasicrystals in mathematical structures or expanded studies into non-linear number distributions.

Future research should focus on empirical testing of the proposed methods across larger numerical datasets to validate accuracy claims and ensure robustness against contemporary probabilistic methods. Further, it would be constructive to explore the scalability of these methods to mesh with quantum computing paradigms, potentially broadening the application scope.

Overall, the paper's introduction of the quasi-primes and associated methodologies offers a distinctive perspective on prime number analysis, deserving rigorous peer evaluation and experimental verification within the mathematics and computer science communities.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.