Mersenne prime

短语

发音

/mɛə(ɹ)ˈsɛn ˈpɹaɪm/

词形变化

Mersenne primes 复数 Mersenne primes

释义与例句

n.
  1. 1.

    A prime number which is one less than a power of two (i.e., is expressible in the form 2ⁿ-1; for example, 31=2⁵-1).

    数学

    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ᵐ-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).

词源

Named after French theologian, philosopher, mathematician, and music theorist Marin Mersenne (1588–1648).

来源：wiktionary