for

Recherche

Voici les résultats de votre recherche.

simulations_random_walks_codes
21 Occurrences trouvées, Dernière modification :
valeurpiece = [0.01,0.02,0.05,0.1,0.2,0.5,1.,2.] for i in range(1): # choice : random choice of an... ock value to "randomly" initiate the generator ! for j in range(3): #seed('ma chaîne personnielle'... seed() # to randomly initiate the generator for i in range(10): print(randint(1000,9999))... # reproducible initialization seed() rval = [] for j in range(100000): rval.append(randint(0,99)
poker_menteur
12 Occurrences trouvées, Dernière modification :
y: return 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 excep... comptage = sorted([[lancer.count(valeur), valeur] for valeur in range(1,7)]) #print comptage, # dé... par ordre croissant signature = tuple([nombre for nombre, valeur in comptage if nombre != 0]) #
paradoxe_anniversaires
8 Occurrences trouvées, Dernière modification :
p = poss ! / ( (poss-n) ! * poss^n) pcomp = 1. for i in range(poss, poss-n, -1): pcomp = pcomp *... t back, shuffle well, and choose another. Do this for only 9 draws, and more likely than not, you've pu... uted). With more than 250 people, its >95%. Ditto for ATM pin codes. * The number of possible poker hands is 2,598,960. One hand for every person in Chicago, or 10 for each mile betw
lancer_pieces
6 Occurrences trouvées, Dernière modification :
def nheads(n): """ return number of heads for n equally likely outcomes coin flipping """ return sum([random.choice(values) for i in range(n)]) values = [0,1] # tail or head n... flips = 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[nf
rotation_vibration_molecules_biatomiques
4 Occurrences trouvées, Dernière modification :
1021/acs.jchemed.8b00431|Simple Acid Vapor Method for Production of HCl and DCl Gas for IR Spectroscopy]] Han Jung Park, Neethu M. Kurien, and Thomas R. Ryb... 0.1021/acs.jchemed.8b00702|A Simplified Technique for the Collection of an HCl/DCl Gas Mixture]] Nichol... tds/7/|High Resolution Spectra of Carbon Monoxide, Propane and Ammonia for Atmospheric Remote Sensing]]
sequences_brins_adn
4 Occurrences trouvées, Dernière modification :
j) - j + 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)/f... e en thermodynb : ln(j!) ~= j ln(j) - j print(pi) for i in range(100,100*n,100): print(i,logfactsti... (i), 4*i*log(4)) # très grands nombres print(pi) for i in range(10000,10000*n,10000): print(i,logf
rappels-proba-stat
2 Occurrences trouvées, Dernière modification :
* [[https://towardsdatascience.com/6-ways-to-test-for-a-normal-distribution-which-one-to-use-9dcf47d8fa93|6 ways to test for a Normal Distribution — which one to use?]] 13/12
thermodynamique_statistique-exercices
2 Occurrences trouvées, Dernière modification :
ed.7b00395|Introduction to Stochastic Simulations for Chemical and Physical Processes: Principles and A... Explain These Differences: A Spreadsheet Exercise for Physical Chemistry Students]] Arthur M. Halpern a