The Even Primes: Exploring the Fascinating World of Prime Numbers

In summary: The book is a hoax, but it's an interesting one.In summary, the author of the book says that all of the prime numbers up to 2,000,000,000 have been found, and that they are all listed in the book.
  • #1
preceptor1919
35
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
  • #2
Prime numbers are used in cryptography so I suppose there is a practical application there for their generation
 
  • #3
Thanks for the info, at least now I know why they're so interesting
 
  • #4
Prime numbers have been interesting to mathematicians long before cryptography. Important names are Fermat and Ramanujan.
 
  • #5
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:
  • #6
Wow it seems that people can actually write a book about prime numbers
 
  • #7
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.
 

Related to The Even Primes: Exploring the Fascinating World of Prime Numbers

1. What is the significance of prime numbers in mathematics?

Prime numbers are crucial in mathematics because they are the building blocks of all other numbers. Every composite number can be broken down into a unique combination of prime numbers. This property is used in many mathematical concepts and algorithms, such as the fundamental theorem of arithmetic and prime factorization.

2. Why are prime numbers important in cryptography?

Prime numbers play a critical role in cryptography because they are used in the creation of public and private keys. These keys are then used for secure communication and data encryption. The large size and unbreakable nature of prime numbers make them essential in ensuring the security of sensitive information.

3. How do prime numbers relate to patterns in nature?

Prime numbers have long been studied for their relationship to patterns in nature. For example, the Fibonacci sequence, which is a series of numbers found in many natural phenomena, is closely related to prime numbers. Prime numbers also appear in the study of patterns in plant growth, animal behavior, and other natural phenomena.

4. What is the importance of prime numbers in computer science?

Prime numbers are used in various algorithms and data structures in computer science. They are particularly relevant in cryptography, as mentioned earlier, but also in areas such as data compression and error-correcting codes. Prime numbers also have applications in random number generation and data hashing.

5. Are there any real-world applications of prime numbers?

Yes, prime numbers have numerous real-world applications, including in finance, telecommunications, and internet security. They are also used in various fields of science, such as physics and chemistry, for modeling and predicting patterns and behavior. Prime numbers also have practical uses in fields such as engineering and architecture for creating efficient and sturdy structures.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
2K
  • Linear and Abstract Algebra
Replies
11
Views
2K
Replies
7
Views
3K
  • Linear and Abstract Algebra
Replies
7
Views
3K
  • Linear and Abstract Algebra
7
Replies
228
Views
32K
  • Linear and Abstract Algebra
Replies
6
Views
3K
  • Math Proof Training and Practice
4
Replies
105
Views
12K
  • Programming and Computer Science
Replies
29
Views
6K
  • Electrical Engineering
Replies
4
Views
925
  • STEM Academic Advising
Replies
6
Views
902
Back
Top