LargestMissingPart
The largest integer below the largest part that is not a part; 0 if every smaller integer is.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001392via IntegerPartition✓LargestMissingPart(partition)The largest integer below the largest part that is not a part; 0 if every smaller integer is.Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer_partition) -> number | combinatorics | always |
Details
- Defined over
IntegerPartitionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
IntegerPartitionand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer. - 0 counts as a candidate, so the value is 0 when every smaller positive integer is a part.
Definition
Epsil, as the implementation runs it.
on IntegerPartition, over _x
0 if Length(_x) < 1 else Max(Map(
Function(k if Count(Filter(
Range(
1,
Length(_x),
),
Function(_x[i] ==
k, i),
)) == 0 else 0, k),
Range(1, Max(_x)),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |