is prime
From Dontopedia, the open, paraconsistent wiki. (Last updated 2026-07-04.)
is prime has 15 facts recorded in Dontopedia across 3 references.
Mostly:assumes positive i(1), correctly identifies primes up to42(1), inefficient for large n(1)
Maturity scale
raw canonical shape-checked rule-derived certifiedInbound mentions (2)
Other subjects in dontopedia point AT this entity as a value. These are inverse relationships — e.g. "X motherOf this subject" — and answer questions the forward facts can't. Grouped by predicate.
conditionCondition(1)
- Rule 3
ex:rule-3
containsContains(1)
- Else If Greater Than 1
ex:else-if-greater-than-1
Other facts (14)
The long tail: predicates that appear too rarely to warrant their own section. Filter or scroll to find a specific one. Each row links to its source.
| Predicate | Value | Ref |
|---|---|---|
| Assumes Positive I | Loop Variable I | [1] |
| Correctly Identifies Primes Up To42 | Integers 1 to 42 | [1] |
| Inefficient for Large N | Integers 1 to 42 | [1] |
| Trial Division Method | From 2 to Sqrt | [1] |
| If Prime Action | printf("Prime\n"); | [2] |
| Implements | Rule Prime Prints Prime | [2] |
| Sound Algorithm | Correct Prime Test | [2] |
| Initializes Flag | int isPrime = 1; | [2] |
| Optimizes to Sqrt | j*j <= i | [2] |
| Presupposes1 Not Prime | Mathematical Convention | [2] |
| Contains Inner Loop | Inner Prime Loop | [2] |
| Skipped for | 1 | [2] |
| Rdf:type | Prime Condition | [3] |
| Has Inner Loop | Prime Loop | [3] |
Timeline
Timeline axis is valid_time — when each source says the fact was true in the world, not when Dontopedia learned about it. Retracted rows are kept for provenance; coloured stripes indicate the context kind.
References (3)
ctx:discord/blah/omega/part-647ctx:discord/blah/omega/part-651ctx:claims/document/031e3fb3-56ef-4e7d-8f07-600f47644757- full textuncloseai: **Generated Code** (block 1/1): ```c #include <stdio.h> int main() { // Fiztext/plain1 KB
discord:msg/1552993f-dc39-48ef-b849-1a123b55b349Show excerpt
uncloseai: **Generated Code** (block 1/1): ```c #include <stdio.h> int main() { // Fizz Buzz implementation up to 42 with 3 new rules for (int i = 1; i <= 42; i++) { // Rule 1: If number is divisible by 7, print "Bazz" …
See also
Keep researching
Missing something or suspicious of what's here? Kick off a research session — a Claude agent will investigate, cite its sources, and file new facts into a dedicated context you can review before accepting into the shared view.