Statements (53)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:musical
|
| gptkbp:applies_to |
the study of algorithms
factorization algorithms |
| gptkbp:countermeasures |
Fermat's primality test
|
| gptkbp:defines |
gptkb:Fermat's_little_theorem
|
| gptkbp:discovered_by |
1910
|
| gptkbp:example |
a number with interesting properties
a composite number that passes Fermat's test |
| gptkbp:focuses_on |
mathematical exploration
|
| gptkbp:form_factor |
nan
|
| https://www.w3.org/2000/01/rdf-schema#label |
Carmichael number
|
| gptkbp:is |
nan
|
| gptkbp:is_analyzed_in |
number theory research papers
|
| gptkbp:is_characterized_by |
the Carmichael function
|
| gptkbp:is_connected_to |
the RSA algorithm
the study of divisors |
| gptkbp:is_essential_for |
understanding number theory
|
| gptkbp:is_found_in |
mathematical literature
|
| gptkbp:is_involved_in |
gptkb:Fermat_pseudoprime
|
| gptkbp:is_known_for |
absolute pseudoprime
|
| gptkbp:is_often_depicted_as |
strong pseudoprimes
|
| gptkbp:is_part_of |
the history of mathematics
the study of pseudoprimes |
| gptkbp:is_related_to |
gptkb:prime_factorization
the distribution of primes composite numbers |
| gptkbp:is_studied_in |
gptkb:currency
modular arithmetic |
| gptkbp:is_tested_for |
the reliability of primality tests
|
| gptkbp:is_used_in |
number theory
randomized algorithms |
| gptkbp:named_after |
gptkb:Robert_Carmichael
|
| gptkbp:number |
gptkb:1729
1105 2821 561 8911 10585 2465 29341 6601 15841 b^(n-1) ≡ 1 (mod n) for all b coprime to n |
| gptkbp:produced_by |
specific algorithms
|
| gptkbp:related_concept |
abstract algebra
|
| gptkbp:research_focus |
computational number theory
|
| gptkbp:significance |
theoretical computer science
|
| gptkbp:size |
gptkb:musical
|
| gptkbp:subject |
mathematical competitions
mathematical conjectures |
| gptkbp:type_of |
gptkb:musical
|
| gptkbp:bfsParent |
gptkb:1729
|
| gptkbp:bfsLayer |
4
|