Timeline for "Utopian Tree" challenge optimization
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2014 at 12:58 | vote | accept | mathlearner | ||
| Oct 1, 2014 at 22:44 | comment | added | Flambino | @mjolka I've updated the answer. And thanks :) | |
| Oct 1, 2014 at 22:43 | history | edited | Flambino | CC BY-SA 3.0 |
Added mjolka's elegant solution
|
| Oct 1, 2014 at 22:29 | comment | added | mjolka | Sure thing :) nice answer btw | |
| Oct 1, 2014 at 22:19 | comment | added | Flambino | @mjolka Wow... now I feel stupid. I guess I should've looked at that for a couple of seconds more. If it's alright with you, I'll add your solution (including code) to my answer | |
| Oct 1, 2014 at 21:30 | comment | added | mjolka | "there may be a purely mathematical, loop-less solution to this" is spot-on. Look at the first few terms: 1, 2, 3, 6, 7, 14, 15, 30, 31, ... and compare that to powers of two: 2, 4, 8, 16, 32, .... | |
| Oct 1, 2014 at 20:29 | history | edited | Flambino | CC BY-SA 3.0 |
added 43 characters in body
|
| Oct 1, 2014 at 18:27 | history | edited | Flambino | CC BY-SA 3.0 |
deleted 22 characters in body
|
| Oct 1, 2014 at 18:18 | history | edited | Flambino | CC BY-SA 3.0 |
added 285 characters in body
|
| Oct 1, 2014 at 18:08 | history | edited | Flambino | CC BY-SA 3.0 |
added 285 characters in body
|
| Oct 1, 2014 at 18:02 | history | answered | Flambino | CC BY-SA 3.0 |