|
gptkbp:instance_of
|
gptkb:textiles
|
|
gptkbp:can_be_found_in
|
mathematical literature
|
|
gptkbp:concept
|
abstract algebra
|
|
gptkbp:discovered_by
|
1910
|
|
gptkbp:example
|
a number with interesting properties
a composite number that passes Fermat's test
|
|
gptkbp:has_a_focus_on
|
mathematical exploration
|
|
gptkbp:has_at_least_three_distinct_prime_factors
|
nan
|
|
gptkbp:has_produced
|
specific algorithms
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Carmichael number
|
|
gptkbp:includes_the_number
|
gptkb:1729
1105
2821
561
8911
10585
2465
29341
6601
15841
|
|
gptkbp:is_a_counterexample_to
|
Fermat's primality test
|
|
gptkbp:is_a_number_that_satisfies
|
b^(n-1) ≡ 1 (mod n) for all b coprime to n
|
|
gptkbp:is_a_subject_of
|
mathematical competitions
mathematical conjectures
|
|
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_defined_by
|
gptkb:Fermat's_little_theorem
|
|
gptkbp:is_essential_for
|
understanding number theory
|
|
gptkbp:is_not_prime
|
nan
|
|
gptkbp:is_often_seen_in
|
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_relevant_to
|
the study of algorithms
factorization algorithms
|
|
gptkbp:is_significant_for
|
theoretical computer science
|
|
gptkbp:is_studied_in
|
gptkb:crypt
modular arithmetic
|
|
gptkbp:is_tested_for
|
the reliability of primality tests
|
|
gptkbp:is_used_in
|
number theory
randomized algorithms
|
|
gptkbp:known_as
|
absolute pseudoprime
|
|
gptkbp:named_after
|
gptkb:Robert_Carmichael
|
|
gptkbp:research_focus
|
computational number theory
|
|
gptkbp:size
|
gptkb:1
|
|
gptkbp:type_of
|
gptkb:Compass
|
|
gptkbp:was_involved_in
|
gptkb:Fermat_pseudoprime
|
|
gptkbp:bfsParent
|
gptkb:1729
|
|
gptkbp:bfsLayer
|
5
|