Mersenne prime - Weblio 英和・和英辞典 (original) (raw)
単語を追加
× この辞書を今後表示しない
※辞書の非表示は、設定画面から変更可能
Mersenne prime
出典:『Wiktionary』 (2026/04/02 16:25 UTC 版)
発音
名詞
Mersenne prime (plural Mersenne primes)
- (number theory) A prime number which is one less than a power of two (i.e., is expressible in the form 2 n − 1 {\displaystyle 2^{n}-1}
; for example, 31 = 2 5 − 1 {\displaystyle 31=2^{5}-1}
).
Coordinate terms: Fermat prime, Sophie Germain prime- 2004, Sheldon Axler, “3: Mathematicians Versus the Silicon Age: Who Wins?”, in David F. Hayes, Tatiana Shubin, editors, Mathematical Adventures for Students and Amateurs, American Mathematical Society, page 20:
- 2005, Jean-Claude Bajard, Laurent Imbert, Thomas Plantard, Modular Number Systems: Beyond the Mersenne Family, Helena Handschuh, M. Anwar Hasan (editors), Selected Areas in Cryptography: 11th International Workshop, SAC 2004, Revised Selected Papers, Springer, LNCS 3357, page 159,
Mersenne numbers of the form 2 m − 1 {\displaystyle 2^{m}-1}are well known examples, but they are not useful for cryptography because there are only a few primes (the first Mersenne primes are 3, 7, 31, 127, 8191, 131071, 524287, 2147483647, etc).
- 2013, Louis Komzsik, Magnificent Seven: The Happy Number, Trafford Publishing, page 71:
Further reading
Mersenne primeのページの著作権
英和・和英辞典 情報提供元は参加元一覧 にて確認できます。
| ピン留めアイコンをクリックすると単語とその意味を画面の右側に残しておくことができます。 | | | ------------------------------------------- | |