About: Quadratic Frobenius test

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

The quadratic Frobenius test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial – the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met. A composite passing this test is a Frobenius pseudoprime, but the converse is not necessarily true.

Property Value
dbo:abstract
  • The quadratic Frobenius test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial – the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met. A composite passing this test is a Frobenius pseudoprime, but the converse is not necessarily true. (en)
  • Тест простоты Фробениуса — это вероятностный тест простоты натурального числа n. Тест простоты Фробениуса позволяет с наибольшей вероятностью определить простоту числа. Доказано, что для чисел меньших тест простоты Фробениуса выполняется всегда. (ru)
dbo:wikiPageID
  • 39004533 (xsd:integer)
dbo:wikiPageLength
  • 3577 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 967321532 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The quadratic Frobenius test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial – the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met. A composite passing this test is a Frobenius pseudoprime, but the converse is not necessarily true. (en)
  • Тест простоты Фробениуса — это вероятностный тест простоты натурального числа n. Тест простоты Фробениуса позволяет с наибольшей вероятностью определить простоту числа. Доказано, что для чисел меньших тест простоты Фробениуса выполняется всегда. (ru)
rdfs:label
  • Quadratic Frobenius test (en)
  • Метод простоты Фробениуса (ru)
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