Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:even_perfect_numbers
|
| gptkbp:compatibleWith |
odd perfect numbers
|
| gptkbp:field |
number theory
|
| gptkbp:namedAfter |
gptkb:Euclid
gptkb:Leonhard_Euler |
| gptkbp:provenBy |
gptkb:Euclid
gptkb:Leonhard_Euler |
| gptkbp:publishedIn |
gptkb:Elements_(Euclid)
Euler's work on perfect numbers |
| gptkbp:relatedTo |
gptkb:Mersenne_primes
perfect numbers |
| gptkbp:state |
An even number is perfect if and only if it is of the form 2^{p-1}(2^p-1) where 2^p-1 is prime
|
| gptkbp:yearOfEulerProof |
1747
|
| gptkbp:bfsParent |
gptkb:Perfect_Number_Problem
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euclid–Euler Theorem
|