Timeline for Natural Pi #0 - Rock
Current License: CC BY-SA 3.0
44 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2023 at 15:14 | answer | added | Kip the Malamute | timeline score: 2 | |
| Feb 9, 2018 at 11:28 | answer | added | Shaggy | timeline score: 1 | |
| Feb 9, 2018 at 0:09 | answer | added | Bolce Bussiere | timeline score: 1 | |
| Dec 25, 2017 at 20:43 | answer | added | mudkip201 | timeline score: 1 | |
| Sep 8, 2017 at 17:02 | answer | added | Robert Benson | timeline score: 1 | |
| Apr 13, 2017 at 12:58 | history | edited | Community Bot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| S Mar 16, 2017 at 16:03 | history | edited | Community Bot |
replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/
|
|
| S Mar 16, 2017 at 16:03 | history | edited | Community Bot |
replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/
|
|
| Mar 16, 2017 at 16:03 | history | edited | Community Bot |
replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/
|
|
| Mar 16, 2017 at 16:03 | history | edited | Community Bot |
replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/
|
|
| Feb 26, 2017 at 22:09 | answer | added | smls | timeline score: 1 | |
| Feb 26, 2017 at 18:40 | history | edited | NonlinearFruit |
added appr. tag
|
|
| Oct 6, 2016 at 6:28 | answer | added | maybeso | timeline score: 1 | |
| Oct 5, 2016 at 13:38 | history | edited | NonlinearFruit | CC BY-SA 3.0 |
clear-er goal
|
| Oct 5, 2016 at 9:33 | history | edited | user45941 | CC BY-SA 3.0 |
better explanation of goal
|
| Oct 5, 2016 at 4:16 | comment | added | 2012rcampion |
I agree with @immibis, something like "check if N random pairs of integers are relatively prime" might be clearer.
|
|
| S Oct 4, 2016 at 20:55 | history | suggested | Glorfindel | CC BY-SA 3.0 |
correct link to Newton's Method - it pointed to the GCD Wikipedia before
|
| Oct 4, 2016 at 20:48 | review | Suggested edits | |||
| S Oct 4, 2016 at 20:55 | |||||
| Oct 4, 2016 at 14:07 | answer | added | AdmBorkBork | timeline score: 4 | |
| Oct 4, 2016 at 14:07 | answer | added | plannapus | timeline score: 4 | |
| Oct 4, 2016 at 13:25 | answer | added | NonlinearFruit | timeline score: 3 | |
| Oct 4, 2016 at 13:15 | comment | added | NonlinearFruit | @Sok A larger upper limit is acceptable | |
| Oct 4, 2016 at 12:31 | answer | added | rnso | timeline score: 5 | |
| Oct 4, 2016 at 12:24 | comment | added | Sok | Does the upper limit to the random numbers generated need to be exactly 1000000? Would a larger upper limit be acceptable? | |
| Oct 4, 2016 at 11:48 | answer | added | primo | timeline score: 4 | |
| Oct 4, 2016 at 4:23 | comment | added | NonlinearFruit |
@immibis I meant the goal to be a short overview with exact details in the specification. I thought the #coprime might indicate multiple pairs.
|
|
| Oct 4, 2016 at 2:08 | comment | added | Stack Exchange Broke The Law | The goal is misleading, it states only one pair of integers is checked. | |
| Oct 3, 2016 at 17:44 | history | tweeted | twitter.com/StackCodeGolf/status/782999842264145920 | ||
| Oct 3, 2016 at 16:59 | answer | added | rturnbull | timeline score: 8 | |
| Oct 3, 2016 at 16:14 | answer | added | alephalpha | timeline score: 8 | |
| Oct 3, 2016 at 15:27 | answer | added | Jonathan Allan | timeline score: 11 | |
| Oct 3, 2016 at 15:23 | answer | added | PurkkaKoodari | timeline score: 6 | |
| Oct 3, 2016 at 14:53 | answer | added | aross | timeline score: 5 | |
| Oct 3, 2016 at 14:30 | answer | added | Kade | timeline score: 9 | |
| Oct 3, 2016 at 14:20 | answer | added | ETHproductions | timeline score: 5 | |
| Oct 3, 2016 at 14:19 | answer | added | corvus_192 | timeline score: 6 | |
| Oct 3, 2016 at 14:18 | answer | added | marinus | timeline score: 12 | |
| Oct 3, 2016 at 14:16 | history | edited | NonlinearFruit | CC BY-SA 3.0 |
typo
|
| Oct 3, 2016 at 14:01 | comment | added | Luis Mendo | Related | |
| Oct 3, 2016 at 13:59 | answer | added | Luis Mendo | timeline score: 7 | |
| Oct 3, 2016 at 13:43 | comment | added | NonlinearFruit |
@Fatalize if it is a limitation of the language, sure. Otherwise, you need to handle N=10^6.
|
|
| Oct 3, 2016 at 13:43 | answer | added | user45941 | timeline score: 7 | |
| Oct 3, 2016 at 13:41 | comment | added | Fatalize |
Does our answer need to work for N = 1000000 or is it ok if the program returns e.g. a stack overflow if N is too big?
|
|
| Oct 3, 2016 at 13:32 | history | asked | NonlinearFruit | CC BY-SA 3.0 |