Timeline for Solving This Vietnamese Mathematical Puzzle for 8-Year-Old Children
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 14, 2017 at 17:09 | comment | added | David Conrad | I get 272 solutions (in about 5 milliseconds) in Java on an i7-7500U, without reusing digits, counting duplicates that would otherwise be eliminated due to commutation. (Running on just one core, no attempt to parallelize it.) | |
Sep 23, 2015 at 18:19 | comment | added | SirParselot |
Oh i figured it out. It has to do with the fact that g*h is the same as h*g but my code thinks they are different since they are in a different order
|
|
Sep 23, 2015 at 18:03 | comment | added | SirParselot |
I wrote a python script to solve this and I get a lot more answers than what you have and I'm following order of operations. This is my calculation x = a+((13*b)/c)+d+(12*e)-f-11+((g*h)/i)-10 which gives me 128 unique solutions. I don't see a problem in mine but I might be missing something
|
|
May 21, 2015 at 14:39 | history | answered | Kevin | CC BY-SA 3.0 |