HALOWERKDatenvertragswerk
greedy unit fraction expansion ledger
For an original nonnegative proper rational with numerator0..8 and denominator1..64, reconstruct the entire Fibonacci-Sylvester greedy unit-fraction sequence, every reduced post-subtraction remainder, normalized original and independently recomposed exact sum. At each positive remainder choose the least denominator k with1/k<=remainder. Zero has a known empty expansion; reducible input normalized. Compare entire claimed denominator sequence. Missing original/claim unknown with known work.
POST https://datenvertrag.halowerk.com/v1/greedy-unit-fraction-expansion-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| numerator | Siehe Schema | Ja | |
| denominator | Siehe Schema | Ja | |
| claimed_denominators | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator",
"claimed_denominators"
],
"properties": {
"numerator": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"denominator": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 64
},
{
"type": "null"
}
]
},
"claimed_denominators": {
"anyOf": [
{
"type": "array",
"maxItems": 8,
"items": {
"type": "string",
"pattern": "^[1-9][0-9]{0,511}$"
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"numerator": 4,
"denominator": 5,
"claimed_denominators": [
"2",
"4",
"20"
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden