HALOWERKDatenvertragswerk
shortest bounded unit fraction family
From an original nonnegative rational numerator0..16/denominator1..32 and maximum denominator1..12, derive ALL minimum-cardinality subsets of distinct denominators from1..ceiling whose reciprocal sum equals the normalized target. Each family sorts denominators increasing; all optimal families sort numeric lexicographically. Return exact minimum term count, whole family/count and solvable flag. Zero has one empty representation with0terms; no bounded representation is a complete known result.
POST https://datenvertrag.halowerk.com/v1/shortest-bounded-unit-fraction-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| target | Siehe Schema | Ja | |
| max_denominator | Siehe Schema | Ja | |
| claimed_families | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"target",
"max_denominator",
"claimed_families"
],
"properties": {
"target": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"num",
"den"
],
"properties": {
"num": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"den": {
"type": "integer",
"minimum": 1,
"maximum": 32
}
}
},
{
"type": "null"
}
]
},
"max_denominator": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 12
},
{
"type": "null"
}
]
},
"claimed_families": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 12
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"target": {
"num": 4,
"den": 5
},
"max_denominator": 12,
"claimed_families": [
[
2,
5,
10
]
]
}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