Timeline for Find the smallest positive integer that satisfies a certain condition
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2014 at 16:16 | answer | added | Daniel Lichtblau | timeline score: 3 | |
| Jun 19, 2014 at 7:33 | answer | added | Basheer Algohi | timeline score: 5 | |
| Jun 19, 2014 at 4:55 | answer | added | Brian Megquier | timeline score: 2 | |
| Jun 19, 2014 at 3:28 | answer | added | Feras Awad | timeline score: 0 | |
| Jun 19, 2014 at 1:40 | history | tweeted | twitter.com/#!/StackMma/status/479438618964922368 | ||
| Jun 18, 2014 at 23:07 | comment | added | Artes | Look at a related problem: Finding the largest integer that cannot be partitioned in a certain way | |
| Jun 18, 2014 at 21:46 | answer | added | Mr.Wizard | timeline score: 1 | |
| Jun 18, 2014 at 21:05 | answer | added | mfvonh | timeline score: 9 | |
| Jun 18, 2014 at 21:03 | comment | added | RunnyKine | @Öskå I think it's safe to say most people are bad with Compile and that just shows that it's implementation and documentation are terrible @Kuba. | |
| Jun 18, 2014 at 20:49 | answer | added | b.gates.you.know.what | timeline score: 3 | |
| Jun 18, 2014 at 20:46 | answer | added | eldo | timeline score: 1 | |
| Jun 18, 2014 at 20:45 | answer | added | george2079 | timeline score: 1 | |
| Jun 18, 2014 at 20:37 | comment | added | cartonn | @george2079 I like to have individual statements for the readability of the code. | |
| Jun 18, 2014 at 20:35 | comment | added | george2079 | just tightening it up helps a little: ` While[Total@(IntegerDigits[++myInt]^2) < SumLimit] | |
| Jun 18, 2014 at 20:18 | comment | added | cartonn | No, you can't use Range[100]. What would you use if I said 10^5 instead of 10^2? | |
| Jun 18, 2014 at 20:07 | history | asked | cartonn | CC BY-SA 3.0 |