Timeline for Insert $+$, $-$, $\times$, $/$, $($, $)$ into $123456789$ to make it equal to $100$
Current License: CC BY-SA 4.0
25 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 19, 2021 at 11:57 | history | bounty ended | xzczd♦ | ||
| S Sep 19, 2021 at 11:57 | history | notice removed | xzczd♦ | ||
| S Sep 12, 2021 at 8:59 | history | bounty started | xzczd♦ | ||
| S Sep 12, 2021 at 8:59 | history | notice added | xzczd♦ | Reward existing answer | |
| Sep 12, 2021 at 8:53 | answer | added | xzczd♦ | timeline score: 2 | |
| Sep 7, 2021 at 5:42 | answer | added | chyanog | timeline score: 7 | |
| Feb 14, 2021 at 12:58 | history | edited | J. M.'s missing motivation | CC BY-SA 4.0 | edited tags |
| Dec 9, 2015 at 2:58 | history | edited | J. M.'s missing motivation | edited tags | |
| Dec 1, 2012 at 10:30 | vote | accept | xzczd♦ | ||
| Nov 23, 2012 at 20:51 | answer | added | whuber | timeline score: 40 | |
| Nov 23, 2012 at 15:47 | answer | added | rcollyer | timeline score: 5 | |
| Nov 23, 2012 at 10:43 | comment | added | xzczd♦ | @acl Well, this question is mainly for fun, no deeper intention lies behind it, so, yes, I just want do find all the solutions :). | |
| Nov 22, 2012 at 19:47 | comment | added | acl | any method that goes down branches will fail for a long enough string of digits. I have stochastic code to try to obtain the minima in much larger systems (using a monte carlo approach); is that interesting or do you only want exhaustive search techniques? | |
| Nov 22, 2012 at 16:39 | answer | added | Rojo | timeline score: 11 | |
| Nov 22, 2012 at 15:45 | answer | added | xzczd♦ | timeline score: 5 | |
| Nov 22, 2012 at 10:36 | answer | added | Niki Estner | timeline score: 17 | |
| Nov 22, 2012 at 7:54 | answer | added | Ernst Stelzer | timeline score: 3 | |
| Nov 22, 2012 at 7:43 | history | tweeted | twitter.com/#!/StackMma/status/271519368553320448 | ||
| Nov 22, 2012 at 6:05 | history | edited | xzczd♦ | CC BY-SA 3.0 | correct the mistake in the first code sample |
| Nov 22, 2012 at 6:04 | comment | added | xzczd♦ | @kguler Oh! That's a mistake of the code, let me correct it. | |
| Nov 22, 2012 at 5:57 | history | edited | xzczd♦ | CC BY-SA 3.0 | added 379 characters in body |
| Nov 22, 2012 at 5:55 | comment | added | kglr | Strictly speaking, the "easy" case still needs a solution:) In your example, you are dropping the first operator in every 8-tuple. That is, your method is always concatenating 1 and 2, but concatenation is not allowed for other other digit. So, solutions like 1*2*3 - 4*5 + 6*7 + 8*9 (which violate the de facto restriction to treat 1 and 2 as 12) are missed. Did you intend to allow concatenation of digits as an allowed operation? (Like the question btw .. +1) | |
| Nov 22, 2012 at 5:43 | history | edited | xzczd♦ | CC BY-SA 3.0 | added 4 characters in body |
| Nov 22, 2012 at 4:09 | comment | added | wxffles | By my back of the envelope calculation, you'd be looking at over 600 million combinations. This would take about 10 hours to run on my computer. Maybe I should try 1,2,3,4 = 10 or something. | |
| Nov 22, 2012 at 3:13 | history | asked | xzczd♦ | CC BY-SA 3.0 |