Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with recreational-mathematics
Search options not deleted
user 512834
Applications of mathematics for the design and analysis of games and puzzles
0
votes
Number of collinear ways to fill a grid
Based on Zsombor Fehér's solution. Let $S$ be the set of $n \times m$ matrices that contain every integer from 1 to $nm$ exactly once. Clearly, $|S| = (nm)!$.
Let $A_{s, t} \subset S$ (for $1 \leq s \ …
- 224