in

Recherche

Voici les résultats de votre recherche.

simulations_random_walks_codes
31 Occurrences trouvées, Dernière modification :
piece = [0.01,0.02,0.05,0.1,0.2,0.5,1.,2.] for i in range(1): # choice : random choice of an elem... andom number generator with any (constant) data # in order to generate reproducible random sequences. ... lue to "randomly" initiate the generator ! for j in range(3): #seed('ma chaîne personnielle') # ... # to randomly initiate the generator for i in range(10): print(randint(1000,9999))
poker_menteur
12 Occurrences trouvées, Dernière modification :
urn tuple(sorted([random.randint(1, nfaces) for i in range(ndes)])) # retourne un tuple try: return sorted([random.randint(1, nfaces) for i in range(ndes)]) # retourne une liste except: re... sorted([[lancer.count(valeur), valeur] for valeur in range(1,7)]) #print comptage, # décommenter ... signature = tuple([nombre for nombre, valeur in comptage if nombre != 0]) #print signature,
thermodynamique_statistique-exercices
10 Occurrences trouvées, Dernière modification :
5.030.html|Statistical analysis of cell migration in 3D using the anisotropic persistent random walk m... 1|Anomalous diffusion of self-propelled particles in directed random environments]] (we also carried o... .org/le-nguyen-hoang/the-amazing-physics-of-water-in-trees/|La physique de l'eau dans les arbres]] (yc... 3/PhysRevE.98.062311|Pedestrian stepping dynamics in single-file movement]] Yi Ma, Ying Ying Sun, Eric
paradoxe_anniversaires
7 Occurrences trouvées, Dernière modification :
oss ! / ( (poss-n) ! * poss^n) pcomp = 1. for i in range(poss, poss-n, -1): pcomp = pcomp * i / ... 3blue1brown: "The birthday paradox is very famous in probability. If you take 23 people, there's about... <blockquote> The birthday paradox is very famous in probability. If you take 23 people, there's about... hances are over 90%. Try it! * Next time you're in an event with more than 118 people, think to your
lancer_pieces
5 Occurrences trouvées, Dernière modification :
""" return sum([random.choice(values) for i in range(n)]) values = [0,1] # tail or head nflips... = 10 # Pascal's triangle : pt = [[1],[1,1]] for i in range(len(pt),nflips+1): pt.append([1]+[pt[i-1][j-1] + pt[i-1][j] for j in range(1,i)]+[1]) print(pt[nflips], sum(pt[nflips]... ution nb = 102400 heads = [nheads(nflips) for j in range(nb)] #print heads c = collections.Counter(h
sequences_brins_adn
4 Occurrences trouvées, Dernière modification :
+ log(2.*pi*j)/2. n=101 # petits nombres for i in range(1,n): print(i,factorial(4*i)/factorial(i)**4, 4**(4*i)) # petits nombres, en log for i in range(1,n): print(i,log(factorial(4*i)/factor... hermodynb : ln(j!) ~= j ln(j) - j print(pi) for i in range(100,100*n,100): print(i,logfactstir(4*i... *i*log(4)) # très grands nombres print(pi) for i in range(10000,10000*n,10000): print(i,logfactst
rotation_vibration_molecules_biatomiques
3 Occurrences trouvées, Dernière modification :
rg/doi/10.1021/acs.jchemed.7b00281|Misconceptions in the Exploding Flask Demonstration Resolved throug... ge.com/questions/165218/why-does-band-heads-arise-in-vibrational-rotational-spectra|Why does band heads arise in vibrational-rotational spectra?]] ===== Autres
physicochimie2-exercices
1 Occurrences trouvées, Dernière modification :
.org/le-nguyen-hoang/the-amazing-physics-of-water-in-trees/|La physique de l'eau dans les arbres]] (yc
plus_ca_rate_plus_on_a_de_chance_que_ca_marche
1 Occurrences trouvées, Dernière modification :
I discuss the underlying assumptions that result in a geometric distribution, the formula, and the me
rotation_molecules_biatomiques
1 Occurrences trouvées, Dernière modification :
tml|Cette référence]] indique : <blockquote>Lines in the pure rotational Raman spectrum of oxygen are
vdemery_espci
1 Occurrences trouvées, Dernière modification :
d Computations]] Werner Krauth, Series : Oxford Master Series in Physics, 13. ISBN-13: 9780198515364