paint-brush
Prime Numbers: The Unbreakable Building Blocks of Mathematicsby@damocles
136 reads

Prime Numbers: The Unbreakable Building Blocks of Mathematics

by Antică VladDecember 21st, 2023
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

The concept of prime numbers serves as a method to delineate the number line without leaving any voids. Primes can be regarded as the fundamental building blocks of all numbers. The security of certain cryptographic algorithms, such as RSA, relies on the difficulty of factoring the product of two large prime numbers back into their original primes.

Company Mentioned

Mention Thumbnail
featured image - Prime Numbers: The Unbreakable Building Blocks of Mathematics
Antică Vlad HackerNoon profile picture

In the dawn of time, long before the world unfurled its mysteries, the realm of mathematics concealed a plethora of treasures and secrets. Ancient, primordial laws seemed to govern the realm of numbers since time immemorial, revealing its most enchanting wonders through the dance of prime numbers.


You are likely acquainted with the concept of primes—numbers divisible only by 1 and themselves. Among them, we encounter such distinguished figures as 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, and 31. (It's worth noting that 1 is not considered prime, and one might argue that 2 and 3 deserve unique categorization). Among the intriguing categories of prime numbers, we find the enigmatic "twin primes"—pairs of primes differing by a mere 2, such as 5-7, 11-13, 17-19, and so forth.


For now, let's keep these notions in mind: prime numbers and their various categories, each showcasing specific similarities. Some may appear disorderly until their underlying patterns are unveiled. But until then...

What is a prime?

The concept of prime numbers serves as a method to delineate the number line without leaving any voids. Primes can be regarded as the fundamental building blocks of all numbers. Take, for instance, the number 2. Multiplying 2 by itself yields 4, then 6, 8, 10, 12, and so forth. Consequently, no even number can be prime, as it inevitably results from combining 2 with another number. We now understand that prime numbers, in their most foundational form, adopt the structure of odd numbers (2n+1). I opt for the 2n+1 format because, if we were to choose 2n-1, we would encounter -1 when considering 0. This may not necessarily violate any rules, as in the case of 2n-1, with n as 1, we obtain the result of 1, which is charming, but uncertainties persist.


Now, we have illustrated that the essence of primes, in its most general and universal form, is 2n+1 (or -). Concerning twin primes, if we locate the midpoint between them, we discover that (2n+1)+(2n+3) equals 4n+4. (4n+4)/2 is 2n+2. This midpoint, as gleaned from numerous pattern-seeking endeavors, is consistently divisible by 6 and 9. Further division by 2, yielding n+1, reveals that n+1 is always divisible by 3, 6, and 9. The proportions among their divisors are remarkably balanced, with the difference between divisors of 3 being approximately ±5% more or less than 6 and 9, and the same for 6 and 9 in relation to others, respectively.


But then, what do we find when seeking patterns? What exactly do we want to achieve?

The patterns in our interactions

I won't delve into the etymology of the word "pattern,” but I am willing to explain what it simply means to me. Patterns are self-repetitive structures or elements that define a whole structure. The emergence of patterns can be observed by an external observer focusing on the object or behavior itself—a means to predict outcomes.


But why do we seek to predict prime numbers? What is so special about them? Why are they extensively used? Here, we step into the realm of cryptography and the way primes function as an unbreakable cipher meant to resist decryption. Their resilience is anchored in the difficulty of factoring these primes into smaller primes.


This is a fundamental principle in the field of cryptography. The security of certain cryptographic algorithms, such as RSA (Rivest–Shamir–Adleman), relies on the difficulty of factoring the product of two large prime numbers back into their original primes. This process is known as integer factorization.


The larger the prime numbers involved, the more computationally challenging it becomes to factorize their product, making it difficult for unauthorized parties to decipher encrypted messages. This property forms the basis for the security of many cryptographic systems that use prime numbers in their algorithms.


Now, of course, a way of finding and playing with every single prime would indeed be an interesting avenue. But what could it mean in its very essence? What if we choose the envision this play differently?


Exploring Primes as an Unbreakable Form of Numbering:

The analogy with Squares: Imagine thinking of prime numbers in a similar way to squares. For instance, take the number 7. You can represent it as a sum of 7 smaller squares. Now, the interesting thing is that these small squares cannot be divided into any smaller ones. Unlike other numbers, there's no way to break them down further.


The Concept of Folding: Consider the idea of "folding" a number. Take the number 8 as an example. You can fold it into 2 x 4 squares, or even 4 x 2 squares, effectively changing its shape. This folding and reshaping are possible for certain numbers.


Unalterable Nature of Primes: When it comes to prime numbers, this folding or reshaping is impossible. The shape of a prime number is always static, and there's no known way to alter it. This unique property suggests that primes could be used to create a new numbering system.


Potential Benefits: Now, you might wonder, what benefits could we derive from such a system based solely on primes? One interesting application could be in communication. For example, if we send signals in the form of primes from one point to another, the receiving end would immediately recognize that the message is based on a prime number. It could then intelligently select the most similar prime to interpret the message. This process could lead to more efficient noise reduction, filtering out irrelevant information.


In Summary: By considering primes as unalterable shapes in a numbering system, we open up possibilities for unique applications. The analogy with squares helps illustrate the distinct nature of prime numbers. The idea of using primes in communication suggests a potential avenue for creating a system where the unbreakable aspects of primes contribute to efficient information transmission and noise filtering.


I like how clearly ChatGPT explains some ideas. However, who is the one who arrives at those ideas? Well, you. The one who simply sits, reads, and learns something new every day. Not for the mere purpose of learning, but to use what you learn to learn something completely new.

The end?

As we delve into the profound realm of prime numbers, a tantalizing question arises: Can we devise a form of information that harnesses the intrinsic properties of primes, effectively mitigating the impact of noise interference? Such a revolutionary system might demand larger primes with wider intervals, considering the heightened differences between them. Remarkably, even for global communication, primes up to 10,000 could prove sufficient based on our existing knowledge.


However, as complexity beckons, the necessity for larger intervals becomes apparent. Yet, this challenge invites us to redefine not only letters but entire concepts. Picture a scenario where, regardless of distance, we exchange ideas through a series of carefully crafted formulas—each recipient deciphering the concepts within their knowledge domain. The world of primes unveils not just mathematical wonders but an intriguing prospect for reshaping the very nature of information transfer.