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 arithmetic
Search options not deleted
user 51307
Challenges related to elementary arithmetic.
4
votes
How many steps does it take from n to 1 by subtracting the greatest divisor?
Haskell, 59 bytes
f 1=0;f n=1+(f$n-(last$filter(\x->n`mod`x==0)[1..n`div`2]))
Usage:
Prelude> f 30
Prelude> 6
It may be a little inefficient for big numbers because of generating the list.
- 201