Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17083547> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q17083547 subject Q7012332.
- Q17083547 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.".
- Q17083547 wikiPageWikiLink Q1169249.
- Q17083547 wikiPageWikiLink Q241015.
- Q17083547 wikiPageWikiLink Q2654835.
- Q17083547 wikiPageWikiLink Q3156088.
- Q17083547 wikiPageWikiLink Q319400.
- Q17083547 wikiPageWikiLink Q50695.
- Q17083547 wikiPageWikiLink Q50707.
- Q17083547 wikiPageWikiLink Q5505102.
- Q17083547 wikiPageWikiLink Q57228.
- Q17083547 wikiPageWikiLink Q583461.
- Q17083547 wikiPageWikiLink Q7012332.
- Q17083547 wikiPageWikiLink Q769124.
- Q17083547 wikiPageWikiLink Q829546.
- Q17083547 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.".
- Q17083547 label "Quadratic Frobenius test".