Pagini recente » Concursuri Virtuale | Teorema chineza a resturilor - generalizari si aplicatii | Diferente pentru problema/portale intre reviziile 94 si 93 | Diferente pentru utilizator/znakeu intre reviziile 11 si 10 | Diferente pentru blog/probability-shortlist intre reviziile 16 si 17
Nu exista diferente intre titluri.
Diferente intre continut:
# (Coupon collector’s problem) Suppose a kid wants to collect all the cartoon characters in a kinder surprise series. Given that there are n different characters in total and they are distributed uniformly random
# (Balls and bins problem) m balls are thrown into n bins. Each ball has 1/n probability of falling into each bin. What’s the expected number of empty bins?
# What’s the expected number of times line 4 is executed if p is a uniform random permutation of numbers 1 to n.
==code(python) |
min = p[0]
for x in p:
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
