1,145 reputation
217
bio website
location United States
age
visits member for 2 years, 3 months
seen 2 days ago

2d
comment Why is the expected number of steps to finish this game $O(n^2)$?
Oh, why does it take an infinite number of steps?
2d
accepted How can we prove that $k! \ge k^{k/2}$?
2d
asked Why is the expected number of steps to finish this game $O(n^2)$?
Apr
10
asked How can we prove that $k! \ge k^{k/2}$?
Apr
10
asked For a binomial distribution, where does this upper bound come from?
Apr
9
accepted How do these two summations equate?
Apr
9
asked How do these two summations equate?
Apr
9
asked How do I compute the number of people in closed form for the birthday problem?
Apr
8
accepted How does one compute how big the cycle of modding by a prime number is?
Apr
8
comment How does one compute how big the cycle of modding by a prime number is?
Thanks! How do I use Fermat's Little Theorem to obtain a suboptimal order? If $a^p \equiv a~mod~p$, does that imply we cycle every $p$ elements?
Apr
8
asked How does one compute how big the cycle of modding by a prime number is?
Apr
7
awarded  Popular Question
Mar
18
revised What's the probability that Tom's bag will weigh more than Sally's?
deleted 43 characters in body
Mar
18
comment What's the probability that Tom's bag will weigh more than Sally's?
Yeah, that's what I meant. K.
Mar
17
comment What's the probability that Tom's bag will weigh more than Sally's?
Yeah, they're numbers.
Mar
17
comment What's the probability that Tom's bag will weigh more than Sally's?
Yeah, selection is without replacement. 50's relevant since I'm given the 50 weights for each person.
Mar
17
asked What's the probability that Tom's bag will weigh more than Sally's?
Mar
9
awarded  Popular Question
Mar
1
comment How do I find the lowest $k$ for which a graph is $k$-partite?
Oh, and all events occur within a day, so no event intervals cross 12am or span multiple days.
Mar
1
comment How do I find the lowest $k$ for which a graph is $k$-partite?
Ok, here's my underlying motivation. :) I'm writing a script to plan events for a conference. The times (but not the days) of each event are set in stone, so for instance, we know event $e$ must occur from 1pm to 3pm on some day. My script will determine the fewest number of days we can make the conference happen given that no events can overlap. My first attempt is to model the problem with an undirected graph with events being vertices. Edges between vertices occur if two events overlap (and thus cannot occur on the same day). Does that make the problem more feasible? Thanks!