Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

About: Solinas prime

An Entity of Type: Class107997703, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics, a Solinas prime, or generalized Mersenne prime, is a prime number that has the form , where is a low-degree polynomial with small integer coefficients. These primes allow fast modular reduction algorithms and are widely used in cryptography. They are named after Jerome Solinas. This class of numbers encompasses a few other categories of prime numbers: * Mersenne primes, which have the form , * Crandall or pseudo-Mersenne primes, which have the form for small odd .

Property Value
dbo:abstract
  • El Primo de Solinas nombrado en honor de , es un tipo de número primo con la forma: 2a ± 2b ± 1, donde 0 < b < a.​ Por ejemplo, los primeros cinco pares de números primos gemelos también son números primos de Solinas. (es)
  • In mathematics, a Solinas prime, or generalized Mersenne prime, is a prime number that has the form , where is a low-degree polynomial with small integer coefficients. These primes allow fast modular reduction algorithms and are widely used in cryptography. They are named after Jerome Solinas. This class of numbers encompasses a few other categories of prime numbers: * Mersenne primes, which have the form , * Crandall or pseudo-Mersenne primes, which have the form for small odd . (en)
  • Inom matematiken är ett Solinasprimtal, uppkallat efter , ett primtal på formen 2a ± 2b ± 1, där 0 < b < a. Till exempel är de första fem paren av primtalstvillingar också Solinasprimtal. De första Solinasprimtalen är: 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 59, 61, 67, 71, 73, 79, 97, 113, 127, 131, 137, 191, 193, 223, 239, 241, 251, 257, 263, 271, 383, 449, 479, 503, 509, 521, 577, 641, , , , , , , , , , , , , , … (talföljd i OEIS). Det första udda primtalet som inte är ett Solinasprimtal är 43. (sv)
dbo:wikiPageID
  • 24257463 (xsd:integer)
dbo:wikiPageInterLanguageLink
dbo:wikiPageLength
  • 4435 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1058778182 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdf:type
rdfs:comment
  • El Primo de Solinas nombrado en honor de , es un tipo de número primo con la forma: 2a ± 2b ± 1, donde 0 < b < a.​ Por ejemplo, los primeros cinco pares de números primos gemelos también son números primos de Solinas. (es)
  • In mathematics, a Solinas prime, or generalized Mersenne prime, is a prime number that has the form , where is a low-degree polynomial with small integer coefficients. These primes allow fast modular reduction algorithms and are widely used in cryptography. They are named after Jerome Solinas. This class of numbers encompasses a few other categories of prime numbers: * Mersenne primes, which have the form , * Crandall or pseudo-Mersenne primes, which have the form for small odd . (en)
  • Inom matematiken är ett Solinasprimtal, uppkallat efter , ett primtal på formen 2a ± 2b ± 1, där 0 < b < a. Till exempel är de första fem paren av primtalstvillingar också Solinasprimtal. De första Solinasprimtalen är: 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 59, 61, 67, 71, 73, 79, 97, 113, 127, 131, 137, 191, 193, 223, 239, 241, 251, 257, 263, 271, 383, 449, 479, 503, 509, 521, 577, 641, , , , , , , , , , , , , , … (talföljd i OEIS). Det första udda primtalet som inte är ett Solinasprimtal är 43. (sv)
rdfs:label
  • Primo de Solinas (es)
  • Solinas prime (en)
  • Solinasprimtal (sv)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License