PrimeColumnSums
Positions i with i + p(i) prime.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001285via Permutation✓PrimeColumnSums(p)Positions i with i + p(i) prime.Typed signatures
| Type | Package | Applies |
|---|---|---|
(permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutationand 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.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 1 else Count(Filter(
Range(1, Length(_x)),
Function(i + _x[i] >= 2 && Count(Filter(
Range(2, i + _x[i]),
Function(d <
i + _x[i] &&
(i + _x[i]) %
d ==
0, d),
)) ==
0, i),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |