Difference between revisions of "Semiprime"
(Created page with "In mathematics, a '''semiprime''' is a number that is the product of two primes. ==Examples== *<math>9</math> is an example of a semiprime as it is the...") |
Duck master (talk | contribs) (Put more information about semiprimes.) |
||
Line 1: | Line 1: | ||
− | In [[mathematics]], a '''semiprime''' is a [[number]] that is the [[product]] of two [[prime|primes]]. | + | In [[mathematics]], a '''semiprime''' is a [[number]] that is the [[product]] of two not necessarily distinct [[prime|primes]]. These integers are important in many contexts, including [[cryptography]]. |
==Examples== | ==Examples== | ||
Line 6: | Line 6: | ||
Other examples include: <math>25</math>, <math>15</math>, <math>39</math>, <math>221</math>, <math>437</math>, and <math>1537</math>. | Other examples include: <math>25</math>, <math>15</math>, <math>39</math>, <math>221</math>, <math>437</math>, and <math>1537</math>. | ||
− | == | + | ==Examples of non-semiprimes== |
− | + | *<math>17</math>, as it is only a prime number. | |
− | <math>12</math> | + | *<math>12</math>, not a semiprime because it can obtained by <math>3*4</math> or <math>2*6</math>. |
+ | |||
+ | ==See Also== | ||
+ | *[[Prime]] | ||
+ | *[[Factor]] | ||
+ | *[[Prime factorization]] | ||
+ | |||
+ | [[Category:Number theory]] | ||
+ | {{stub}} |
Revision as of 16:05, 25 January 2020
In mathematics, a semiprime is a number that is the product of two not necessarily distinct primes. These integers are important in many contexts, including cryptography.
Examples
- is an example of a semiprime as it is the product of two threes. .
- is also an example as it is obtained by .
Other examples include: , , , , , and .
Examples of non-semiprimes
- , as it is only a prime number.
- , not a semiprime because it can obtained by or .
See Also
This article is a stub. Help us out by expanding it.