Counting permutations where the difference between entries located \(r\) places apart can never be \(s\) (for any given positive integers \(r\) and \(s\)) (Q6659947)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s) |
scientific article; zbMATH DE number 7964404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting permutations where the difference between entries located \(r\) places apart can never be \(s\) (for any given positive integers \(r\) and \(s\)) |
scientific article; zbMATH DE number 7964404 |
Statements
Counting permutations where the difference between entries located \(r\) places apart can never be \(s\) (for any given positive integers \(r\) and \(s\)) (English)
0 references
9 January 2025
0 references
inclusion-exclusion
0 references
permutations
0 references
symbolic-computation
0 references
0.733238697052002
0 references
0.7262181639671326
0 references
