Timeline for Looking for primes with all-different digits
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Jul 12, 2016 at 11:18 | history | tweeted | twitter.com/StackCodeReview/status/752824493123506176 | ||
| Jul 11, 2016 at 19:23 | comment | added | BusyAnt | @BradThomas "always" was employed because the player needs a winning strategy, therefore they must "always"/"in all cases" be able to choose a number that leads to them winning. Perhaps is it more clear in the original question that I linked. | |
| Jul 11, 2016 at 19:06 | comment | added | Bradley Thomas | I'm confused by this part of your question: "the second last digit can always be chosen". Is it the case that there is some (one) specific 2nd to last digit that we can use that will lead to all 6 digit numbers with all digits different being non-prime? Then why use the word "always"? | |
| Jul 11, 2016 at 15:11 | answer | added | Daerdemandt | timeline score: 4 | |
| Jul 11, 2016 at 13:43 | vote | accept | BusyAnt | ||
| Jul 11, 2016 at 12:52 | answer | added | machine yearning | timeline score: 8 | |
| Jul 11, 2016 at 12:40 | comment | added | BusyAnt | Sure ! About which part do you need more explanations ? The output will be a list of numbers that satisfy the property, that is to say all the digits until the hundreds are different, and each ten of this hundred has a prime. The goal is to figure out if there can be a winning strategy to the game described in the linked question. | |
| Jul 11, 2016 at 12:37 | comment | added | SylvainD | Your question seems interesting. Would you be able to tell us a bit more about the expected output and some explanation ? | |
| Jul 11, 2016 at 11:24 | history | asked | BusyAnt | CC BY-SA 3.0 |