Changes

Jump to navigation Jump to search
23 bytes added ,  07:39, November 27, 2023
move discussion of composite numbers to the end
Line 3: Line 3:     
As the foundation of all numbers, prime numbers have a [[spiritual]] quality that have fascinated [[mathematicians]] and others for all time.  Prime numbers are a great way to learn and teach [[math]], to improve mental acuity and focus, and to understand great works such as the [[Bible]].  The two greatest unsolved mysteries in [[mathematics]] relate to prime numbers: whether ever odd number is the sum of two primes ([[Goldbach's conjecture]]). and whether there are [[infinity|infinitely]] many [[twin primes]].
 
As the foundation of all numbers, prime numbers have a [[spiritual]] quality that have fascinated [[mathematicians]] and others for all time.  Prime numbers are a great way to learn and teach [[math]], to improve mental acuity and focus, and to understand great works such as the [[Bible]].  The two greatest unsolved mysteries in [[mathematics]] relate to prime numbers: whether ever odd number is the sum of two primes ([[Goldbach's conjecture]]). and whether there are [[infinity|infinitely]] many [[twin primes]].
−
  −
The opposites of a prime number are a [[composite number]] and a [[highly composite number]]. A [[composite number]] is the ''general'' opposite to a prime number. And a [[highly composite number]] is the ''special'', or ''extreme'', opposite to a prime number.
      
[[Leonhard Euler]] wrote: <blockquote>
 
[[Leonhard Euler]] wrote: <blockquote>
Line 70: Line 68:     
==Open problems about prime numbers==
 
==Open problems about prime numbers==
−
      
===Twin primes===
 
===Twin primes===
Line 94: Line 91:  
==Cryptography==
 
==Cryptography==
 
The security of [[public-key cryptography]] schemes such as [[RSA]] depend on the difficulty of prime factorization, if a pattern in the distribution of prime numbers is discovered, then such [[cryptographic]] schemes could become vulnerable to attack.
 
The security of [[public-key cryptography]] schemes such as [[RSA]] depend on the difficulty of prime factorization, if a pattern in the distribution of prime numbers is discovered, then such [[cryptographic]] schemes could become vulnerable to attack.
 +
 +
== Composite numbers ==
 +
The opposites of a prime number are a [[composite number]] and a [[highly composite number]]. A [[composite number]] is the ''general'' opposite to a prime number. And a [[highly composite number]] is the ''special'', or ''extreme'', opposite to a prime number.
    
==See also==
 
==See also==
Anthony, Irenaeus, Siteadmin, apieditor, Bureaucrats, Check users, nsAm_Govt_101RO, nsAm_Govt_101RW, nsAm_Govt_101_ta, nsJudgesRO, nsJudgesRW, nsJudges_talkRO, nsJudges_talkRW, nsTeam2RO, nsTeam2RW, nsTeam2_talkRO, nsTeam2_talkRW, oversight, Administrators
126,194

edits

Navigation menu