The Euro System as a (19,9,3,3)-Representation System

The Euro System as a (19, 9, 3, 3) -Representation System: N = 19A + 9B + 3C + 3D This document explains why the twelve euro denominations are not an arbitrary choice. Behind €0. 10 · €0. 20 · €0. 50 · €1 · €2 · €5 · €10 · €20 · €50 · €100 · €200 · €500 lies a precise mathematical structure, and this document makes that structure visible without requiring any prior knowledge of mathematics. What does it contain? The document consists of two parts. The first part is a description in seven steps: from the basic insight that €0. 10 is the key, via the pattern 1, 2, 5 repeated four times, to the formula N = 19A + 9B + 3C + 3D which summarises the entire system in four letters. The second part is a representation table: for every amount from €0. 10 to €10. 00, the exact number of ways to pay it using the twelve denominations is listed. The central insight The key is a single number: 10 ≡ 1 (mod 9). This means that 10 divided by 9 leaves a remainder of 1. Consequence: €0. 10, €1, €10 and €100 play exactly the same mathematical role — only at a different scale. The same holds for €0. 20/€2/€20/€200 and for €0. 50/€5/€50/€500. The twelve denominations are in reality one pattern of three numbers, repeated four times: 1, 2, 5 ×1 → €0, 10 €0, 20 €0, 50 1, 2, 5 ×10 → €1 €2 €5 1, 2, 5 ×100 → €10 €20 €50 1, 2, 5 ×1000→ €100 €200 €500 Each layer is the previous one multiplied by ten — and because 10 ≡ 1 (mod 9), the mathematical position does not change. This is also why the digital root of a number — the repeated digit sum until a single digit remains — is preserved under multiplication by 10. The four layers and the formula Each of the four layers has its own coefficient in the formula. These coefficients — 19, 9, 3, 3 — are not arbitrary: they satisfy the mathematical condition 19 ≡ 1 (mod 9) and each coefficient divides the next. This means that for every amount N (expressed in units of €0. 10) the following law holds: A₀ = N mod 9 = digital root of N This is the minimal starting value — always computable in a single step, regardless of the size of the amount. For €18. 00 (= 180 units): 180 mod 9 = 0, so €18. 00 can always be paid without small change. For €9. 50 (= 95 units): 95 mod 9 = 5, so every payment of €9. 50 starts with at least €0. 50. The period of the system is 19 × 9 = 171 units = €17, 10. Every €17. 10 added to an amount yields exactly one additional way to pay it. This is the monetary translation of the mathematical period of the (19, 9) -system. The representation table The second part of the document shows, for every amount from €0. 10 to €10. 00, the exact number of ways to pay it using the twelve euro denominations. A selection: | Amount | Units | Number of ways | Greedy ||--------|-------|----------------|--------|| €0. 10 | 1 | 1 | 1×€0. 10 || €1. 00 | 10 | 11 | 1×€1 || €5. 00 | 50 | 451 | 1×€5 || €10. 00 | 100 | 4, 563 | 1×€10 || €100. 00 | 1, 000 | 327, 631, 322 | 1×€100 | The large number of representations for higher amounts is not a mathematical trick but a direct consequence of the four layers: each layer adds new combination possibilities. For €100, this already amounts to more than 327 million ways. It is important to note that these counts are not obtained by enumeration or search. The number of representations for any amount N is computed directly in O (N × 12) time via dynamic programming — a single pass over all denominations. The result is exact and deterministic. Similarly, the minimal starting value A₀ = N mod 9 is resolved in a single arithmetic operation, O (1), regardless of the size of the amount. The system does not search for solutions; it derives them structurally from the mathematical properties of the representation system. The large number of representations for higher amounts is not a mathematical trick but a direct consequence of the four layers: each layer adds new combination possibilities. For €100, this already amounts to more than 327 million ways. How to use the document • Open the HTML file in a browser. In the top right there is a button to save it directly as a PDF. • The document is entirely self-contained: no prior mathematical knowledge required. Every concept is explained step by step. • Search for example for "€3, 50" to find all information about that amount directly). BB The Python script: euro₁9933. py The script euro₁9933. py is the computational engine behind the document. It builds directly on the previously published scripts core. py, system₁9₉. py en matryoshka. py and adds the euro system as a fourth application layer. Structure: seven layers The script is structured in seven self-contained layers, from general to specific: Three core functions analyseerbedrag (bedragₑuro) — the central function. Returns in a single call: N, A₀, digital root, reduction chain, R in the (19, 9) -core, R for all 12 denominations, symmetry point, greedy representation, and the first representations written out in full. representation table (nₘax) — generates the complete table for N=1 to nₘax. Efficient: the DP counter is computed once for the entire range, not recalculated per N. runᵥerificaties () — checks 27 assertions across all layers. Each outcome is marked ✓ or ✗. Serves as a self-test on every run. Technical properties • A₀ = N mod 9 — O (1), a single arithmetic operation, for any N however large. • DP-teller — O (N × 12): exact, no approximation. For N=10, 000 (€1, 000) this yields 7, 089, 628, 318, 292, 844 — correct and reproducible. • Greedy — O (12): always the largest denomination first. Returns the minimum number of denominations for everyday use. • Matryoshka — links every value in the reduction chain N→S (N) →dr (N) to the corresponding A-coordinate in the representations of N. • Verificaties — 27 assertions, all green on correct installation. Including known values such as R (958) =6, symmetry point (958) = (40, 22), G (10) =1683. Core of both documents: The euro system is not arbitrary. The twelve denominations are the pattern 1, 2, 5 repeated on four scales — a direct consequence of 10 ≡ 1 (mod 9). The four layers correspond to the coefficients 19, 9, 3, 3 in the formula N = 19A + 9B + 3C + 3D. The minimal starting value A₀ = N mod 9 is always computable in a single step. The period is €17. 10. Bilal el Issaoui · Amsterdam · 2026