Skip to content
HALOWERK

Datenvertragswerk

inverse euler product prefix

For one integer coefficient prefix b1,.,bN with N 0..6 and each coefficient -1, 0 or 1, inverts the Euler product transformation. Returns the unique integer exponent vector a1,.,aN such that 1+SUM(b_n*x^n, n 1..N) = PRODUCT((1-x^k)^(-a_k), k 1..N) modulo x^(N+1); the constant term 1 is implicit and must not be supplied. For prefix [1,0] the exponents are [1,-1]. This is an exact formal power-series factorization, not an analytical Euler product over primes.

POST https://datenvertrag.halowerk.com/v1/inverse-euler-product-prefix

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
prefixSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "prefix": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": -1,
            "maximum": 1
          },
          "minItems": 0,
          "maxItems": 6
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": -1000,
            "maximum": 1000
          },
          "minItems": 0,
          "maxItems": 6
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "prefix",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "prefix": [],
  "claim": []
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’