What Are the Real-World Applications of Even Primes and Their Variations?

AI Thread Summary
The discussion highlights the fascination with prime numbers and their various forms, such as palindromic, emirp, Mersenne, and twin primes. The interest in prime numbers extends beyond theoretical mathematics into practical applications, particularly in cryptography, where they play a crucial role in secure communication. Additionally, prime numbers are utilized in error correction methods, such as those used in PDF417 barcodes, leveraging finite fields based on prime polynomials. The conversation also notes historical figures like Fermat and Ramanujan, emphasizing that the significance of prime numbers predates their modern applications. The advancement in the commercial use of prime number mathematics has led to increased interest and research in this area. The mention of a humorous book titled "The Even Primes" illustrates the lighter side of the topic while acknowledging the depth of study surrounding prime numbers.
preceptor1919
Messages
35
Reaction score
0
Just want to know if there are applications in the derivation of prime numbers. My instructor and the textbook that we are using seems to be obsessed with it, there is at least one problem about deriving prime numbers in each chapter. And also different versions like palindromic prime, emirp, mersenne prime, twin primes etc. I am starting to be fascinated myself.

Is it just because solving primes(and variations of it) can be tough or is there a real world application?
 
Technology news on Phys.org
Prime numbers are used in cryptography so I suppose there is a practical application there for their generation
 
Thanks for the info, at least now I know why they're so interesting
 
Prime numbers have been interesting to mathematicians long before cryptography. Important names are Fermat and Ramanujan.
 
In addition to encryption, prime numbers are also used for error correction, such as 929 which is used to create a finite field (numbers modulo 929) used for the error correction on PDF417 bar codes. However, most error correction schemes use finite fields based on "prime" polynomials that use 1 bit coefficients (so add and subtract effectively become xor). AES encryption uses Rijndael S-box on 8 bit bytes, finding the multiplicative inverse of that byte modulo x^8 + x^4 + x^3 + x + 1 (hex 11B) (division by a 9 bit polynomial produces an 8 bit remainder). For a software implementation, typically a 256 byte lookup table is used. However in hardware, which may include 10 or more S-box'es in parallel, there's been a lot of effort made to reduce the gate count well below the hardware equivalent of a lookup table, using some interesting properties of fields based on 1 bit coefficients, in this case being able to map an 8 bit field into two 4 bit fields and then into four 2 bit fields. There are a lot (but not anastronomically large number) of possible mappings, and a brute force approach to simply try them all and select the one that needs the fewest number of gates has been done.

The point here is that prime numbers and finite field math at one time were just exercises in higher level mathematics, but once there was a commercial application for this stuff, a lot more people and more effort became involved, and the was significant advancement in the commercial aspect for this branch of mathematics.
 
Last edited:
Wow it seems that people can actually write a book about prime numbers
 
preceptor1919 said:
Wow it seems that people can actually write a book about prime numbers

Well, there IS a book called "The Even Primes". All the pages are blank except somewhere around the middle, one page has a big "2" on it.
 
Back
Top