Triple
T5570565
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fermat's little theorem |
E146189
|
entity |
| Predicate | usedIn |
P98
|
FINISHED |
| Object |
Fermat primality test
The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
|
E530310
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c008ffed108190a084602227af6157 |
elicitation | completed |
| NER | batch_69c020502a288190af37f9ebb88fccae |
ner | completed |
| NED1 | batch_69c0284bb71881908c0ac4ea2a302327 |
ned_source_triple | completed |
| NED2 | batch_69c04141ea408190aba1463d56ad6b7d |
ned_description | completed |
| NEDg | batch_69c040a395488190bea2fd651c3aeef7 |
nedg | completed |
Created at: March 22, 2026, 3:37 p.m.