Timeline for The program that will find the next prime number
Current License: CC BY-SA 3.0
65 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4 at 4:36 | answer | added | aitzazisstuffed | timeline score: 0 | |
| Oct 30, 2024 at 0:52 | comment | added | l4m2 | @Jodrell In a universe where typing cost most time than thinking and computing, code golfing do helps :) | |
| Aug 27, 2023 at 17:07 | answer | added | The Thonnu | timeline score: 1 | |
| Aug 27, 2023 at 17:06 | answer | added | The Thonnu | timeline score: 1 | |
| May 2, 2023 at 13:10 | answer | added | lyxal ♦ | timeline score: 1 | |
| May 2, 2023 at 12:57 | answer | added | emirps | timeline score: 2 | |
| Jul 25, 2022 at 20:33 | answer | added | Deadcode | timeline score: 8 | |
| Feb 10, 2021 at 17:52 | answer | added | James Brotherhood | timeline score: 1 | |
| Feb 8, 2021 at 22:55 | answer | added | Dominic van Essen | timeline score: 1 | |
| Feb 8, 2021 at 22:53 | answer | added | hakr14 | timeline score: 1 | |
| Feb 8, 2021 at 22:45 | answer | added | Makonede | timeline score: 1 | |
| Mar 1, 2019 at 20:38 | answer | added | Oliver | timeline score: 0 | |
| Feb 2, 2017 at 0:03 | answer | added | Value Ink | timeline score: 0 | |
| Feb 1, 2017 at 12:27 | comment | added | Offtkp | For all the "wtf there isnt any biggest prime number"-esque edits, the title obviously meant "next currently known biggest prime number so your sarcasm is not valid here :) | |
| Feb 1, 2017 at 12:25 | history | edited | Offtkp | CC BY-SA 3.0 |
added 115 characters in body
|
| Jan 30, 2017 at 22:19 | answer | added | ATaco | timeline score: 2 | |
| Jan 30, 2017 at 19:15 | answer | added | Ismael Miguel | timeline score: 0 | |
| Jan 30, 2017 at 18:13 | answer | added | Zaid | timeline score: 1 | |
| Jan 30, 2017 at 17:15 | comment | added | mbomb007 | So does pretty much any question tagged with [prime]. | |
| Jan 30, 2017 at 17:13 | comment | added | Wheat Wizard♦ | @mbomb007 why? All of the answers except the builtin ones seen to just add an extra wrapper. | |
| Jan 30, 2017 at 17:08 | comment | added | mbomb007 | @WheatWizard No way. Finding the next prime is different. | |
| Jan 30, 2017 at 17:06 | review | Close votes | |||
| Jan 30, 2017 at 17:43 | |||||
| Jan 30, 2017 at 16:47 | comment | added | Wheat Wizard♦ | Possible duplicate of Is this number a prime? | |
| Jan 30, 2017 at 16:36 | comment | added | Jodrell | If there were a machine with infinite processing power and memory it could instantly calculate the next prime with any program that actually works. There would no point in making programs either small or efficient any more, indeed, I suspect that in such a universe computers would be so cheap that I'd have better things to do than try to recoup the cost of one. I assume this is the case in your example, where a stick of gum may cost 100,000ドル. I'd probably just ask a nearby computer to project all the great entertainment I missed into my mind before I notice my family have all died. | |
| Jan 30, 2017 at 16:30 | answer | added | Kevin Cruijssen | timeline score: 1 | |
| Jan 30, 2017 at 15:55 | answer | added | Magic Octopus Urn | timeline score: 1 | |
| Jan 30, 2017 at 15:46 | answer | added | mbomb007 | timeline score: 0 | |
| Jan 30, 2017 at 11:38 | history | tweeted | twitter.com/StackCodeGolf/status/826031802632503296 | ||
| Jan 30, 2017 at 8:48 | comment | added | drolex | Downvoting because I don't get the point of the challenge. Is it about finding the next prime number (trivial, and it has been done before) or manipulating large numbers in the context of prime number searching? It looks like none of the answers actually adresses this latter issue (which looks like the interestingone to me) - maybe because the question is unclear | |
| Jan 30, 2017 at 7:53 | history | reopened |
FlipTack 0 ' ATaco Timtech steenbergh |
||
| Jan 30, 2017 at 3:00 | comment | added | NoOneIsHere | How would this be tested anyway? No machines have infinite resources. | |
| Jan 30, 2017 at 2:31 | comment | added | Wheat Wizard♦ | How is this different from the primality test question? Any reasonable method is just going to be a fairly simple wrapper of the original or a builtin. | |
| Jan 29, 2017 at 22:19 | review | Reopen votes | |||
| Jan 30, 2017 at 2:59 | |||||
| Jan 29, 2017 at 20:11 | history | closed |
Taylor Raine Peter Taylor Riker george Community Bot |
Needs details or clarity | |
| Jan 29, 2017 at 19:26 | comment | added | bright-star | Weird, there's not a single Lisp answer to this question... | |
| Jan 29, 2017 at 18:30 | comment | added | Greg Martin | Side note: there isn't a 100,000ドル bounty for every new world-record prime—only a few benchmarks, like the first prime found with a million digits. See mersenne.org | |
| Jan 29, 2017 at 17:37 | review | Close votes | |||
| Jan 29, 2017 at 20:11 | |||||
| S Jan 29, 2017 at 17:37 | history | edited | DJMcMayhem | CC BY-SA 3.0 |
wtf, there's no such thing as a "biggest" prime number
|
| S Jan 29, 2017 at 17:37 | history | suggested | user36219 | CC BY-SA 3.0 |
wtf, there's no such thing as a "biggest" prime number
|
| Jan 29, 2017 at 17:24 | review | Suggested edits | |||
| S Jan 29, 2017 at 17:37 | |||||
| Jan 29, 2017 at 17:21 | answer | added | Will Ness | timeline score: 0 | |
| Jan 29, 2017 at 17:18 | comment | added | Peter Taylor | "Your program MUST NOT be limited" but on the basis of the example I suspect that every single language in existence counts as limited if fit no other reason than using a finite type to address memory. | |
| Jan 29, 2017 at 16:35 | answer | added | Conor O'Brien | timeline score: 1 | |
| Jan 29, 2017 at 16:20 | comment | added | FlipTack | I think you should add some serious test cases. | |
| Jan 29, 2017 at 15:39 | answer | added | smls | timeline score: 2 | |
| Jan 29, 2017 at 15:22 | answer | added | Suever | timeline score: 0 | |
| Jan 29, 2017 at 14:16 | comment | added | Offtkp | @theonlygusti It doesnt have to validate inputs primality. | |
| Jan 29, 2017 at 14:03 | answer | added | Fatalize | timeline score: 4 | |
| Jan 29, 2017 at 13:44 | answer | added | Dennis | timeline score: 13 | |
| Jan 29, 2017 at 13:38 | comment | added | user36219 | Does the program have to validate that the input is actually a prime? Or can we just get the next prime after any input? | |
| Jan 29, 2017 at 12:45 | answer | added | Mitchell Spector | timeline score: 4 | |
| Jan 29, 2017 at 12:37 | answer | added | Jonathan Allan | timeline score: 3 | |
| Jan 29, 2017 at 12:06 | answer | added | Adnan | timeline score: 4 | |
| Jan 29, 2017 at 11:38 | answer | added | ovs | timeline score: 7 | |
| Jan 29, 2017 at 11:17 | answer | added | Luke | timeline score: 0 | |
| Jan 29, 2017 at 11:02 | answer | added | steenbergh | timeline score: 0 | |
| Jan 29, 2017 at 10:49 | answer | added | sagiksp | timeline score: 2 | |
| Jan 29, 2017 at 10:45 | answer | added | Greg Martin | timeline score: 25 | |
| Jan 29, 2017 at 10:44 | answer | added | rahnema1 | timeline score: 3 | |
| Jan 29, 2017 at 10:40 | answer | added | steenbergh | timeline score: 6 | |
| Jan 29, 2017 at 10:39 | answer | added | Blue | timeline score: 2 | |
| Jan 29, 2017 at 10:35 | comment | added | Offtkp | Yes it has to be exactly the next prime @FlipTack. Not the next mersenne prime or anything. This is why I advised bruteforcing, (due to infinite resources, it would be ideal) but any algorithm is fine, as long as it finds the next prime. | |
| Jan 29, 2017 at 10:34 | history | edited | Offtkp | CC BY-SA 3.0 |
added 26 characters in body
|
| Jan 29, 2017 at 10:34 | comment | added | FlipTack | Does it have to specifically be the next prime? Lots of prime searching algorithms for large primes only search certain types of numbers and therefore sometimes miss out primes... | |
| Jan 29, 2017 at 10:32 | history | asked | Offtkp | CC BY-SA 3.0 |