eyeling 1.24.8 → 1.24.9

package/examples/output/auroracare.md

@@ -1,17 +1,21 @@
 # auroracare  
 
+## Source files  
+
+- [N3 rules](../auroracare.n3)  
+
 AuroraCare — Purpose-based Medical Data Exchange  
 
 ## A – Primary care visit  
 Clinician in the patient's care team accessing the patient summary for primary care management.  
 
-Answer  
+## Answer  
 PERMIT  
 
-Reason Why  
+## Reason Why  
 Permitted: clinician in the patient's care team, and the primary-care policy matched.  
 
-Check  
+## Check  
 C1 SKIPPED - not a prohibited purpose  
 C2 OK - clinician  
 C3 OK - care-team linked  
@@ -26,13 +30,13 @@ C10 INFO - matched policy: urn:policy:primary-care-001
 ## B – Quality improvement (in scope)  
 QI analyst using lab results + summary in a secure environment.  
 
-Answer  
+## Answer  
 PERMIT  
 
-Reason Why  
+## Reason Why  
 Permitted: ODRL/DPV policy matched for secondary use.  
 
-Check  
+## Check  
 C1 SKIPPED - not a prohibited purpose  
 C2 SKIPPED  
 C3 SKIPPED  
@@ -47,13 +51,13 @@ C10 INFO - matched policy: urn:policy:qi-2025-aurora
 ## C – Quality improvement (out of scope)  
 QI analyst with only lab results; policy expects labs + summary.  
 
-Answer  
+## Answer  
 DENY  
 
-Reason Why  
+## Reason Why  
 Denied: no policy matched (purpose, environment, TOMs, or categories out of scope).  
 
-Check  
+## Check  
 C1 SKIPPED - not a prohibited purpose  
 C2 SKIPPED  
 C3 SKIPPED  
@@ -68,13 +72,13 @@ C10 SKIPPED - no matched policy
 ## D – Insurance management  
 Insurance bot attempting to use health data for insurance management (prohibited purpose).  
 
-Answer  
+## Answer  
 DENY  
 
-Reason Why  
+## Reason Why  
 Denied: the requested purpose (insurance management) is prohibited by policy.  
 
-Check  
+## Check  
 C1 OK - denied prohibited purpose  
 C2 SKIPPED  
 C3 SKIPPED  
@@ -89,13 +93,13 @@ C10 SKIPPED - no matched policy
 ## E – GP checks labs  
 GP for the same patient checking lab results via the API gateway.  
 
-Answer  
+## Answer  
 PERMIT  
 
-Reason Why  
+## Reason Why  
 Permitted: clinician in the patient's care team, and the primary-care policy matched.  
 
-Check  
+## Check  
 C1 SKIPPED - not a prohibited purpose  
 C2 OK - clinician  
 C3 OK - care-team linked  
@@ -110,13 +114,13 @@ C10 INFO - matched policy: urn:policy:primary-care-001
 ## F – Research on anonymised dataset  
 Researcher using anonymised labs + summary in a secure environment, with opt-in.  
 
-Answer  
+## Answer  
 PERMIT  
 
-Reason Why  
+## Reason Why  
 Permitted: subject opted in and an ODRL/DPV policy matched (anonymised dataset in secure environment).  
 
-Check  
+## Check  
 C1 SKIPPED - not a prohibited purpose  
 C2 SKIPPED  
 C3 SKIPPED  
@@ -131,13 +135,13 @@ C10 INFO - matched policy: urn:policy:research-aurora-diabetes
 ## G – AI training (opt-out)  
 Data user wants to train AI, but the subject opted out of AI training.  
 
-Answer  
+## Answer  
 DENY  
 
-Reason Why  
+## Reason Why  
 Denied: you opted out of your data being used to train AI systems.  
 
-Check  
+## Check  
 C1 SKIPPED - not a prohibited purpose  
 C2 SKIPPED  
 C3 SKIPPED  

package/examples/output/backward-recursion.md

@@ -1,5 +1,10 @@
 # backward-recursion  
 
+## Source files  
+
+- [N3 rules](../backward-recursion.n3)  
+- [Input TriG](../input/backward-recursion.trig)  
+
 @prefix : <urn:example#> .  
 
 :a :reaches :b .  

package/examples/output/barley-seed-becoming.md

@@ -1,15 +1,19 @@
 # barley-seed-becoming  
 
+## Source files  
+
+- [N3 rules](../barley-seed-becoming.n3)  
+
 Barley seed lineage — becoming  
 
-Answer  
+## Answer  
 YES for the viable barley lineage.  
 NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.  
 
-Reason Why  
+## Reason Why  
 The main lineage can be read as a becoming: a protected dormant seed can germinate, an adult plant can become a next seed stage, and the lineage can therefore become a self-renewing cycle. Because its hereditary information is digitally instantiated and repair is available, it can also become an accurately reproduced next generation under no-design laws. And because heritable variation is present under a matching selection environment, it can become an adaptively persistent lineage. The contrast lineages mark blocked becomings: non-digital heredity blocks accurate copying, lack of repair blocks reliable renewal, lack of dormancy protection blocks closure through the seed phase, and lack of heritable variation blocks adaptive becoming.  
 
-Check  
+## Check  
 B1  OK - no-design laws are assumed  
 B2  OK - the viable genome can become accurately copied  
 B3  OK - the viable seed can become a protected dormant phase  

package/examples/output/bmi.md

@@ -1,16 +1,20 @@
 # bmi  
 
+## Source files  
+
+- [N3 rules](../bmi.n3)  
+
 BMI — ARC-style Body Mass Index example  
 
-Answer  
+## Answer  
 BMI = 22.72  
 Category = Normal  
 At height 178 cm, a healthy-weight range is about 58.6–78.9 kg (BMI 18.5–24.9).  
 
-Reason Why  
+## Reason Why  
 BMI is defined as weight in kilograms divided by height in meters squared. This program first normalizes the input to SI units, computes BMI, and then applies WHO adult categories as half-open intervals. The healthy-weight band is the weight range at the same height that corresponds to BMI 18.5 through 24.9.  
 
-Check  
+## Check  
 C1 OK - the input was normalized into positive SI values.  
 C2 OK - height squared was reconstructed from the normalized height.  
 C3 OK - the BMI value matches the BMI = kg / m² formula.  

package/examples/output/builtin-coverage.md

@@ -1 +1,7 @@
 # builtin-coverage  
+
+## Source files  
+
+- [N3 rules](../builtin-coverage.n3)  
+- [Input TriG](../input/builtin-coverage.trig)  
+

package/examples/output/calidor.md

@@ -1,5 +1,9 @@
 # calidor  
 
+## Source files  
+
+- [N3 rules](../calidor.n3)  
+
 ## Answer  
 The city is allowed to use a narrow heatwave-response insight and recommends Calidor Priority Cooling Bundle for this household.  
 case                 : calidor  

package/examples/output/collection.md

@@ -1 +1,7 @@
 # collection  
+
+## Source files  
+
+- [N3 rules](../collection.n3)  
+- [Input TriG](../input/collection.trig)  
+

package/examples/output/complex-matrix-stability.md

@@ -1,14 +1,18 @@
 # complex-matrix-stability  
 
+## Source files  
+
+- [N3 rules](../complex-matrix-stability.n3)  
+
 Complex Matrix Stability — ARC-style  
 
-Answer  
+## Answer  
 We compare three diagonal 2x2 complex matrices for discrete-time stability: A_unstable = [[(1,1),(0,0)],[(0,0),(2,0)]], A_stable = [[(1,0),(0,0)],[(0,0),(-1,0)]], and A_damped = [[(0,0),(0,0)],[(0,0),(0,0)]]. Their spectral radii are ρ(A_unstable) = 2, ρ(A_stable) = 1, and ρ(A_damped) = 0. So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.  
 
-Reason Why  
+## Reason Why  
 For a discrete-time linear system x_{k+1} = A x_k, the eigenvalues of A govern the behaviour of the modes. Because these matrices are diagonal, the eigenvalues are just the diagonal entries. The spectral radius is the maximum modulus of the eigenvalues: if it is greater than 1 a mode grows, if it equals 1 the modes remain bounded without decaying, and if it is less than 1 all modes decay to zero. Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.  
 
-Check  
+## Check  
 C1 OK - A_unstable has eigenvalues (1,1) and (2,0) with spectral radius 2, so it is unstable.  
 C2 OK - A_stable has eigenvalues (1,0) and (-1,0) with spectral radius 1, so it is marginally stable.  
 C3 OK - A_damped has eigenvalues (0,0) and (0,0) with spectral radius 0, so every mode decays to zero.  

package/examples/output/context-association.md

@@ -1,5 +1,10 @@
 # Context association  
 
+## Source files  
+
+- [N3 rules](../context-association.n3)  
+- [Input TriG](../input/context-association.trig)  
+
 ## Entailment  
 The RDF dataset associates Bob's data graph with a Data Integrity proof graph and a second metadata proof graph.  
 

package/examples/output/control-system.md

@@ -1,16 +1,20 @@
 # control-system  
 
+## Source files  
+
+- [N3 rules](../control-system.n3)  
+
 Control System — ARC explanation of two control signals  
 
-Answer  
+## Answer  
 Send both actuator commands now.  
 Actuator 1 command: 39.27346198678276  
 Actuator 2 command: 26.08  
 
-Reason Why  
+## Reason Why  
 The first sensor pair is 6 and 11, so the reading is rising and the controller normalizes the gap 5 into 2.23606797749979. That normalized value creates a feedforward term of 43.82693235899588, while the known disturbance 35766 contributes a compensation term of 4.553470372213121. Subtracting that compensation gives actuator 1 the command 39.27346198678276. For actuator 2, the target is 5 units above the measured output, so the tracking error is positive. The observed state is -2 relative units below the measured output, so the differential correction is negative. That yields a proportional feedback part of 29, a nonlinear factor of 1.46, and a differential contribution of -2.92. Together they produce actuator 2 command 26.08.  
 
-Check  
+## Check  
 C1 OK - the first sensor pair is rising, so the normalization uses the rising-branch rule.  
 C2 OK - the normalized measurement is positive and smaller than the raw gap, which is consistent with a square-root normalization.  
 C3 OK - actuator 1 is lower than its proportional feedforward term because disturbance compensation is subtracted.  

package/examples/output/deep-taxonomy-10.md

@@ -1,14 +1,18 @@
 # deep-taxonomy-10  
 
+## Source files  
+
+- [N3 rules](../deep-taxonomy-10.n3)  
+
 Deep Taxonomy - deep classification benchmark  
 
-Answer  
+## Answer  
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10 and then as A2.  
 
-Reason Why  
+## Reason Why  
 Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N10, the final rule deriving A2 fires, and that in turn makes the test true.  
 
-Check  
+## Check  
 C1 OK - the starting classification N0 is present.  
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
 C3 OK - the chain reaches the midpoint N5 and still carries both side-label branches.  

package/examples/output/deep-taxonomy-100.md

@@ -1,14 +1,18 @@
 # deep-taxonomy-100  
 
+## Source files  
+
+- [N3 rules](../deep-taxonomy-100.n3)  
+
 Deep Taxonomy - deep classification benchmark  
 
-Answer  
+## Answer  
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100 and then as A2.  
 
-Reason Why  
+## Reason Why  
 Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N100, the final rule deriving A2 fires, and that in turn makes the test true.  
 
-Check  
+## Check  
 C1 OK - the starting classification N0 is present.  
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
 C3 OK - the chain reaches the midpoint N50 and still carries both side-label branches.  

package/examples/output/deep-taxonomy-1000.md

@@ -1,14 +1,18 @@
 # deep-taxonomy-1000  
 
+## Source files  
+
+- [N3 rules](../deep-taxonomy-1000.n3)  
+
 Deep Taxonomy - deep classification benchmark  
 
-Answer  
+## Answer  
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N1000 and then as A2.  
 
-Reason Why  
+## Reason Why  
 Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N1000, the final rule deriving A2 fires, and that in turn makes the test true.  
 
-Check  
+## Check  
 C1 OK - the starting classification N0 is present.  
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
 C3 OK - the chain reaches the midpoint N500 and still carries both side-label branches.  

package/examples/output/deep-taxonomy-10000.md

@@ -1,14 +1,18 @@
 # deep-taxonomy-10000  
 
+## Source files  
+
+- [N3 rules](../deep-taxonomy-10000.n3)  
+
 Deep Taxonomy - deep classification benchmark  
 
-Answer  
+## Answer  
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10000 and then as A2.  
 
-Reason Why  
+## Reason Why  
 Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N10000, the final rule deriving A2 fires, and that in turn makes the test true.  
 
-Check  
+## Check  
 C1 OK - the starting classification N0 is present.  
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
 C3 OK - the chain reaches the midpoint N5000 and still carries both side-label branches.  

package/examples/output/deep-taxonomy-100000.md

@@ -1,14 +1,18 @@
 # deep-taxonomy-100000  
 
+## Source files  
+
+- [N3 rules](../deep-taxonomy-100000.n3)  
+
 Deep Taxonomy - very deep classification benchmark  
 
-Answer  
+## Answer  
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100000 and then as A2.  
 
-Reason Why  
+## Reason Why  
 Each rule moves the same individual one level deeper in the taxonomy and also adds two side labels. Because that chain continues all the way from N0 to N100000, the final rule deriving A2 fires, and that in turn makes the test true.  
 
-Check  
+## Check  
 C1 OK - the starting classification N0 is present.  
 C2 OK - the first expansion produced N1 together with side labels I1 and J1.  
 C3 OK - the chain reaches the midpoint N50000 and still carries both side-label branches.  

package/examples/output/delfour.md

@@ -1,5 +1,9 @@
 # delfour  
 
+## Source files  
+
+- [N3 rules](../delfour.n3)  
+
 ## Answer  
 The scanner is allowed to use a neutral shopping insight and recommends Low-Sugar Tea Biscuits instead of Classic Tea Biscuits.  
 case                 : delfour  

package/examples/output/digital-product-passport.md

@@ -1,3 +1,7 @@
 # digital-product-passport  
 
+## Source files  
+
+- [N3 rules](../digital-product-passport.n3)  
+
 ACME X1000 SN123 | recycled=13% | lifecycle=52500 gCO2e | CRM=true | hint=http://example.org/dpp#repairFriendly  

package/examples/output/dijkstra-risk-path.md

@@ -1,5 +1,10 @@
 # dijkstra-risk-path  
 
+## Source files  
+
+- [N3 rules](../dijkstra-risk-path.n3)  
+- [Input TriG](../input/dijkstra-risk-path.trig)  
+
 ## Answer  
 selected path : ClinicA -> DepotB -> LabD -> HubZ  
 raw cost : 10.00  

package/examples/output/easter.md

@@ -1,15 +1,19 @@
 # easter  
 
+## Source files  
+
+- [N3 rules](../easter.n3)  
+
 Easter — Gregorian computus  
 
 ## 2026  
-Answer  
+## Answer  
 Easter Sunday falls on April 5.  
 
-Reason Why  
+## Reason Why  
 For year 2026, the computus gives j=12, k=20, q=6, r=12, v=2, and final month/day numbers x=4, z=4. Because the day is z+1, the resulting Easter date is April 5.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -18,13 +22,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2027  
-Answer  
+## Answer  
 Easter Sunday falls on March 28.  
 
-Reason Why  
+## Reason Why  
 For year 2027, the computus gives j=13, k=20, q=6, r=1, v=5, and final month/day numbers x=3, z=27. Because the day is z+1, the resulting Easter date is March 28.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -33,13 +37,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2028  
-Answer  
+## Answer  
 Easter Sunday falls on April 16.  
 
-Reason Why  
+## Reason Why  
 For year 2028, the computus gives j=14, k=20, q=6, r=20, v=5, and final month/day numbers x=4, z=15. Because the day is z+1, the resulting Easter date is April 16.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -48,13 +52,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2029  
-Answer  
+## Answer  
 Easter Sunday falls on April 1.  
 
-Reason Why  
+## Reason Why  
 For year 2029, the computus gives j=15, k=20, q=6, r=9, v=1, and final month/day numbers x=4, z=0. Because the day is z+1, the resulting Easter date is April 1.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -63,13 +67,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2030  
-Answer  
+## Answer  
 Easter Sunday falls on April 21.  
 
-Reason Why  
+## Reason Why  
 For year 2030, the computus gives j=16, k=20, q=6, r=28, v=2, and final month/day numbers x=4, z=20. Because the day is z+1, the resulting Easter date is April 21.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -78,13 +82,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2031  
-Answer  
+## Answer  
 Easter Sunday falls on April 13.  
 
-Reason Why  
+## Reason Why  
 For year 2031, the computus gives j=17, k=20, q=6, r=17, v=5, and final month/day numbers x=4, z=12. Because the day is z+1, the resulting Easter date is April 13.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -93,13 +97,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2032  
-Answer  
+## Answer  
 Easter Sunday falls on March 28.  
 
-Reason Why  
+## Reason Why  
 For year 2032, the computus gives j=18, k=20, q=6, r=6, v=0, and final month/day numbers x=3, z=27. Because the day is z+1, the resulting Easter date is March 28.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -108,13 +112,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2033  
-Answer  
+## Answer  
 Easter Sunday falls on April 17.  
 
-Reason Why  
+## Reason Why  
 For year 2033, the computus gives j=0, k=20, q=6, r=24, v=2, and final month/day numbers x=4, z=16. Because the day is z+1, the resulting Easter date is April 17.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -123,13 +127,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2034  
-Answer  
+## Answer  
 Easter Sunday falls on April 9.  
 
-Reason Why  
+## Reason Why  
 For year 2034, the computus gives j=1, k=20, q=6, r=13, v=5, and final month/day numbers x=4, z=8. Because the day is z+1, the resulting Easter date is April 9.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  
@@ -138,13 +142,13 @@ C5 OK - the final date is inside the legal Gregorian Easter window.
 Easter — Gregorian computus  
 
 ## 2035  
-Answer  
+## Answer  
 Easter Sunday falls on March 25.  
 
-Reason Why  
+## Reason Why  
 For year 2035, the computus gives j=2, k=20, q=6, r=2, v=1, and final month/day numbers x=3, z=24. Because the day is z+1, the resulting Easter date is March 25.  
 
-Check  
+## Check  
 C1 OK - the Golden Number remainder j is inside the 0–18 cycle.  
 C2 OK - the epact-style remainder r is inside the 0–29 cycle.  
 C3 OK - the weekday adjustment v is inside the 0–6 cycle.  

package/examples/output/eco-route-insight.md

@@ -1,5 +1,10 @@
 # eco-route-insight  
 
+## Source files  
+
+- [N3 rules](../eco-route-insight.n3)  
+- [Input TriG](../input/eco-route-insight.trig)  
+
 ## Answer  
 insight status : issue  
 show eco banner : yes  

package/examples/output/flandor.md

@@ -1,5 +1,9 @@
 # flandor  
 
+## Source files  
+
+- [N3 rules](../flandor.n3)  
+
 ## Answer  
 Name: Flandor  
 Region: Flanders  

package/examples/output/french-cities.md

@@ -1,14 +1,18 @@
 # french-cities  
 
+## Source files  
+
+- [N3 rules](../french-cities.n3)  
+
 French cities — ARC style graph reachability  
 
-Answer  
+## Answer  
 Four cities in this small network can reach Nantes: Paris, Chartres, Le Mans, and Angers.  
 
-Reason Why  
+## Reason Why  
 The original example says that every :oneway link is also a :path, and that :path is transitive. So once Angers can reach Nantes directly, longer routes can be built by chaining earlier links. Angers reaches Nantes directly. Le Mans reaches Nantes through Angers. Chartres reaches Nantes through Le Mans and Angers. Paris reaches Nantes through Chartres, Le Mans, and Angers.  
 
-Check  
+## Check  
 C1 OK - Angers has a direct one-way connection to Nantes.  
 C2 OK - Le Mans reaches Nantes by chaining Le Mans → Angers → Nantes.  
 C3 OK - Chartres reaches Nantes by chaining Chartres → Le Mans → Angers → Nantes.  

package/examples/output/fundamental-theorem-arithmetic.md

@@ -1,14 +1,18 @@
 # fundamental-theorem-arithmetic  
 
+## Source files  
+
+- [N3 rules](../fundamental-theorem-arithmetic.n3)  
+
 Fundamental Theorem of Arithmetic — ARC-style  
 
-Answer  
+## Answer  
 For n = 202692987, the prime factors are 3 * 3 * 7 * 829 * 3881, the prime-power form is 3^2 * 7 * 829 * 3881, and the product of these factors is 202692987 with 4 distinct primes.  
 
-Reason Why  
+## Reason Why  
 Existence in this run comes from repeated smallest-divisor decomposition: 202692987 factors as 3 * 3 * 7 * 829 * 3881. Each distinct factor is prime. For uniqueness up to order, the reverse traversal gives 3881 * 829 * 7 * 3 * 3, and both traversals sort to the same multiset of primes. So this concrete case exhibits the Fundamental Theorem of Arithmetic for 202692987: a prime factorization exists and is unique up to order. The extreme prime factors are 3 and 3881.  
 
-Check  
+## Check  
 C1 OK - repeated smallest-divisor decomposition produced the expected smallest-first factor list (3 3 7 829 3881).  
 C2 OK - the product of the computed factors reconstructs n = 202692987.  
 C3 OK - every distinct factor in the decomposition is prime by trial division.  

package/examples/output/genetic-algorithm-knapsack.md

@@ -1,3 +1,7 @@
 # genetic-algorithm-knapsack  
 
+## Source files  
+
+- [N3 rules](../genetic-algorithm-knapsack.n3)  
+
 Knapsack GA best genome 101000000101 (feasible=true): weight=50 value=101 after 4 generations.