Examples
Examples
Try the starting example
- Measured pole path lengths (cm)
- 400,300
- Nominal segment length (cm)
- 50
- Length lost at each inserted joint (cm)
- 2
- Extra spare segments
- 2
- Segments for each path
- 9, 7
- Uncut assembled length for each path (cm)
- 434, 338
- Excess length before trimming (cm)
- 34, 38
- Segments to obtain including spares
- 18
- Joints in assembled paths
- 14
Try another scenario
- Measured pole path lengths (cm)
- 400,300
- Nominal segment length (cm)
- 50
- Length lost at each inserted joint (cm)
- 0
- Extra spare segments
- 2
- Segments for each path
- 8, 6
- Uncut assembled length for each path (cm)
- 400, 300
- Excess length before trimming (cm)
- 0, 0
- Segments to obtain including spares
- 16
- Joints in assembled paths
- 12
Calculation method
Calculation method
Segments for each path
For n≥1, usable length is n×segment−(n−1)×joint loss. Choose the smallest whole n covering each path.
Uncut assembled length for each path (cm)
n×segment−(n−1)×joint loss.
Excess length before trimming (cm)
Assembled length − required measured path.
Segments to obtain including spares
Sum path segment counts + extra spares.
Joints in assembled paths
Sum(n−1) across paths, excluding unassembled spares.
Symbols and units
- a
- Measured pole path lengths (cm)
- b
- Nominal segment length (cm)
- c
- Length lost at each inserted joint (cm)
- d
- Extra spare segments
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- An inventory calculation for identical straight segments with a supplied insertion loss per joint. It does not approve segment trimming, pole strength, bend radius or joint compatibility.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
OpenStax: arithmetic and geometry ↗
Background reading; this does not imply endorsement or independent review of SumFizz.