Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Chinese_hypothesis> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Chinese_hypothesis abstract "In number theory, the Chinese hypothesis is a disproven conjecture stating that an integer n is prime if and only if it satisfies the condition that 2n−2 is divisible by n. In other words, that integer n is prime if and only if . It is true that if n is prime, then (this is a special case of Fermat's little theorem). However, the converse (if then n is prime) is false, and therefore the hypothesis as a whole is false. The smallest counter example is n = 341 = 11×31. Composite numbers n for which 2n−2 is divisible by n are called Poulet numbers. They are a special class of Fermat pseudoprimes.".
- Chinese_hypothesis wikiPageID "11301011".
- Chinese_hypothesis wikiPageRevisionID "544806378".
- Chinese_hypothesis hasPhotoCollection Chinese_hypothesis.
- Chinese_hypothesis subject Category:Conjectures_about_prime_numbers.
- Chinese_hypothesis subject Category:Disproved_conjectures.
- Chinese_hypothesis subject Category:Pseudoprimes.
- Chinese_hypothesis type Abstraction100002137.
- Chinese_hypothesis type Cognition100023271.
- Chinese_hypothesis type Concept105835747.
- Chinese_hypothesis type ConjecturesAboutPrimeNumbers.
- Chinese_hypothesis type Content105809192.
- Chinese_hypothesis type DisprovedConjectures.
- Chinese_hypothesis type Hypothesis105888929.
- Chinese_hypothesis type Idea105833840.
- Chinese_hypothesis type PsychologicalFeature100023100.
- Chinese_hypothesis type Speculation105891783.
- Chinese_hypothesis comment "In number theory, the Chinese hypothesis is a disproven conjecture stating that an integer n is prime if and only if it satisfies the condition that 2n−2 is divisible by n. In other words, that integer n is prime if and only if . It is true that if n is prime, then (this is a special case of Fermat's little theorem). However, the converse (if then n is prime) is false, and therefore the hypothesis as a whole is false. The smallest counter example is n = 341 = 11×31.".
- Chinese_hypothesis label "Chinese hypothesis".
- Chinese_hypothesis label "Hipótesis china".
- Chinese_hypothesis sameAs Hipótesis_china.
- Chinese_hypothesis sameAs m.02r6x7x.
- Chinese_hypothesis sameAs Q5100807.
- Chinese_hypothesis sameAs Q5100807.
- Chinese_hypothesis sameAs Chinese_hypothesis.
- Chinese_hypothesis wasDerivedFrom Chinese_hypothesis?oldid=544806378.
- Chinese_hypothesis isPrimaryTopicOf Chinese_hypothesis.