Choose a mode, enter the required values, and click calculate. The generator and finder follow Euclid's formula, while verify checks the Pythagorean equation directly.

1. Select a mode.
2. Enter the required values for that mode.
3. Read the result card.

Verify 5, 12, 13 to confirm a primitive Pythagorean triple.

Use m = 4 and n = 1 to generate the same triple from Euclid's formula.

The old behavior is preserved, but the inputs are now parsed more explicitly and the layout matches the newer card pattern.

Only integer m and n values are accepted for generation, and the generator requires m > n ≥ 1.