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 permutations
Search options not deleted
user 8505
Permutations are arrangements of the numbers $1,\ldots,n$ in an arbitrary order.
2
votes
1
answer
322
views
Permuting natural numbers
Now we have to find total number of permutations of this sequence such that the sum of any two adjacent numbers is $ \le k$
( $z \leq 10^6$, $\;\;z < k < 2*z$ )
Here is what I have been able to think …
- 329