翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

semiprime : ウィキペディア英語版
semiprime
In mathematics, a semiprime (also called biprime or 2-almost prime, or pq number) is a natural number that is the product of two (not necessarily distinct) prime numbers. The semiprimes less than 100 are 4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, and 95. . Semiprimes that are not perfect squares are called discrete, or distinct, semiprimes.
By definition, semiprime numbers have no composite factors other than themselves. For example, the number 26 is semiprime and its only factors are 1, 2, 13, and 26.
==Properties==
The total number of prime factors Ω(''n'') for a semiprime ''n'' is two, by definition. A semiprime is either a square of a prime or square-free. The square of any prime number is a semiprime, so the largest known semiprime will always be the square of the largest known prime, unless the factors of the semiprime are not known. It is conceivable, but unlikely, that a way could be found to prove a larger number is a semiprime without knowing the two factors.〔Chris Caldwell, (''The Prime Glossary: semiprime'' ) at The Prime Pages. Retrieved on 2013-09-04.〕 A composite n non-divisible by primes \le \sqrt() is semiprime. Various methods, such as elliptic pseudo-curves and the Goldwasser-Kilian ECPP theorem have been used to create provable, unfactored semiprimes with hundreds of digits. These are considered novelties, since their construction method might prove vulnerable to factorization, and because it is simpler to multiply two primes together.
For a semiprime ''n'' = ''pq'' the value of Euler's totient function (the number of positive integers less than or equal to ''n'' that are relatively prime to ''n'') is particularly simple when ''p'' and ''q'' are distinct:
: φ(''n'') = (''p'' − 1) (''q'' − 1) = ''p'' ''q'' − (''p'' + ''q'') + 1 = ''n'' − (''p'' + ''q'') + 1.
If otherwise ''p'' and ''q'' are the same,
: φ(''n'') = φ(''p''2) = (''p'' − 1) ''p'' = ''p''2 − ''p'' = ''n'' − ''p''.
The concept of the prime zeta function can be adapted to semiprimes, which defines constants like
: \sum_ \frac \approx 0.1407604
: \sum_ \frac \approx 0.17105
: \sum_ \frac \approx 0.28360

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「semiprime」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.