Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Proth's_theorem> ?p ?o. }
Showing items 1 to 42 of
42
with 100 items per page.
- Proth's_theorem abstract "In number theory, Proth's theorem is a primality test for Proth numbers.It states that if p is a Proth number, of the form k2n + 1 with k odd and k < 2n, then if for some integer a,then p is prime (called a Proth prime). This is a practical test because if p is prime, any chosen a has about a 50 percent chance of working.If a is a quadratic nonresidue modulo p then the converse is also true, and the test is conclusive. Such an a may be found by iterating a over small primes and computing the Jacobi symbol until:".
- Proth's_theorem wikiPageID "3225985".
- Proth's_theorem wikiPageRevisionID "595647992".
- Proth's_theorem hasPhotoCollection Proth's_theorem.
- Proth's_theorem title "Proth's Theorem".
- Proth's_theorem urlname "ProthsTheorem".
- Proth's_theorem subject Category:Primality_tests.
- Proth's_theorem subject Category:Theorems_about_prime_numbers.
- Proth's_theorem type Abstraction100002137.
- Proth's_theorem type Cognition100023271.
- Proth's_theorem type Communication100033020.
- Proth's_theorem type Experiment105798043.
- Proth's_theorem type HigherCognitiveProcess105770664.
- Proth's_theorem type Inquiry105797597.
- Proth's_theorem type Message106598915.
- Proth's_theorem type PrimalityTests.
- Proth's_theorem type ProblemSolving105796750.
- Proth's_theorem type Process105701363.
- Proth's_theorem type Proposition106750804.
- Proth's_theorem type PsychologicalFeature100023100.
- Proth's_theorem type Statement106722453.
- Proth's_theorem type Theorem106752293.
- Proth's_theorem type TheoremsAboutPrimeNumbers.
- Proth's_theorem type Thinking105770926.
- Proth's_theorem type Trial105799212.
- Proth's_theorem comment "In number theory, Proth's theorem is a primality test for Proth numbers.It states that if p is a Proth number, of the form k2n + 1 with k odd and k < 2n, then if for some integer a,then p is prime (called a Proth prime). This is a practical test because if p is prime, any chosen a has about a 50 percent chance of working.If a is a quadratic nonresidue modulo p then the converse is also true, and the test is conclusive.".
- Proth's_theorem label "Proth's theorem".
- Proth's_theorem label "Teorema de Proth".
- Proth's_theorem label "Teorema di Proth".
- Proth's_theorem label "Théorème de Proth".
- Proth's_theorem label "Теорема Прота".
- Proth's_theorem label "مبرهنة بروث".
- Proth's_theorem sameAs Teorema_de_Proth.
- Proth's_theorem sameAs Théorème_de_Proth.
- Proth's_theorem sameAs Teorema_di_Proth.
- Proth's_theorem sameAs 프로트의_정리.
- Proth's_theorem sameAs m.08_n3k.
- Proth's_theorem sameAs Q3771212.
- Proth's_theorem sameAs Q3771212.
- Proth's_theorem sameAs Proth's_theorem.
- Proth's_theorem wasDerivedFrom Proth's_theorem?oldid=595647992.
- Proth's_theorem isPrimaryTopicOf Proth's_theorem.