meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 11 months |
| seen | Jun 24 '12 at 3:59 | |
| stats | profile views | 4 |
|
Aug 23 |
awarded | Commentator |
|
Aug 23 |
comment |
Intuition on the sum of first (n-1) numbers is equal to the number of ways of picking 2 items out of n. This answer is perfectly fine! The number of dots is the arithmetic sum of the rows: (n-1)+(n-2)+(n-3)+...+2+1. |
|
Feb 29 |
comment |
Is there an algorithm that can tell whether the power of two rational numbers is rational? @Gurgeh: though cstheory.stackexchange is also a reasonable forum in the future. Too bad SO isn't like Quora. |
|
Feb 29 |
comment |
Is there an algorithm that can tell whether the power of two rational numbers is rational? Note: This answer was given in response to the question before it was (unreasonably) migrated from stackoverflow. |
|
Feb 29 |
comment |
Is there an algorithm that can tell whether the power of two rational numbers is rational? I suggest that this be migrated back to stackoverflow.com |
|
Feb 29 |
answered | Is there an algorithm that can tell whether the power of two rational numbers is rational? |
|
Feb 29 |
comment |
Is there an algorithm that can tell whether the power of two rational numbers is rational? Why the close votes? This isn't off-topic, it was clearly stated as relating to implementing fractions. I personally find it useful. |
|
Feb 29 |
comment |
Is there an algorithm that can tell whether the power of two rational numbers is rational? @senderle: ah, silly me, thank you =) |
|
Feb 29 |
comment |
Is there an algorithm that can tell whether the power of two rational numbers is rational? @Gurgeh: Could you please give an example of where irrational^irrational = rational, without complex numbers, if you know of one? |
|
Oct 8 |
awarded | Student |
|
Jun 8 |
comment |
Solution to rarity-generalized coupon-collector's problem? @Byron: ah interesting! I managed to find online the textbook example 5.17 on p322 in Introduction to Probability Models 10th edition by Sheldon Ross, as cited in your answer, and it does indeed give a general solution to the coupon collector's problem with unequal probabilities. I'd be happy to accept any answer which stated it with reference, along with whether it generalized to continuous distributions (and what that would mean). |
|
Jun 8 |
comment |
How to calculate the middle of a line? Generalization: You can get any point along the line by doing a weighted average of the vectors (e.g. $0.1*p1 + 0.9*p2$, to get 90% of the way towards p2). |
|
Jun 8 |
asked | Solution to rarity-generalized coupon-collector's problem? |
|
Jun 8 |
comment |
Expected time to roll all 1 through 6 on a die If anyone's curious, simulating reveals $E[$ time until all values rolled$]$ for two dice is roughly $61.2$. |
|
May 22 |
awarded | Supporter |
