Timeline for What is the expected number of random numbers (generated uniformly) such that their sum of numbers exceeds one?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5 at 14:57 | comment | added | kjetil b halvorsen | Answered at stats.stackexchange.com/questions/194352/… | |
| Sep 13, 2013 at 2:54 | comment | added | Douglas Zare | @Greg Marks: The problem itself isn't research level. However, web_ninja asked, "Is there a shorter, more intuitive method?" Finding a short, intuitive approach to a problem you can solve in another way seems to fit. In addition, this is not an isolated puzzle as shown by the question I linked. | |
| Sep 13, 2013 at 1:05 | comment | added | Greg Marks | This question was Problem A3 of the 1958 Putnam Competition (and as such is not research-level mathematics). | |
| Sep 12, 2013 at 15:13 | vote | accept | web_ninja | ||
| Sep 12, 2013 at 14:32 | answer | added | Douglas Zare | timeline score: 8 | |
| Sep 12, 2013 at 11:46 | vote | accept | web_ninja | ||
| Sep 12, 2013 at 15:13 | |||||
| Sep 12, 2013 at 10:50 | answer | added | lmg | timeline score: 2 | |
| Sep 12, 2013 at 10:43 | history | edited | web_ninja | CC BY-SA 3.0 |
added 22 characters in body
|
| Sep 12, 2013 at 10:43 | comment | added | web_ninja | Uniformly random. Made an edit to the question mentioning that. | |
| Sep 12, 2013 at 10:30 | history | asked | web_ninja | CC BY-SA 3.0 |