We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 10 Days of Statistics
  4. Day 4: Binomial Distribution II
  5. Discussions

Day 4: Binomial Distribution II

Sort by

recency

|

159 Discussions

|

  • siddharthadas791
     + 0 comments

    Why this does not work? import math

    def binomial_prob(n, k, p): return math.comb(n, k) * (p ** k) * ((1 - p) ** (n - k))

    n = 10 p = 0.12

    no_more_than_2 = sum(binomial_prob(n,k,p) for k in range(0, 3)) atleast_2 = sum(binomial_prob(n,k,p) for k in range(2, 11)) print(f"{no_more_than_2}:.3f") print(f"{atleast_2}:.3f")

  • illogicalsleepi1
     + 0 comments
    def fac(num):
    if num == 1 or num == 0:
        return 1
    else:
        return num * fac(num - 1)

s, t = 0, 0
pcn, n = map(int, input().split())
p =pcn / 100  

for i in range(0, 3):
    t += (fac(n) / (fac(n - i) * fac(i))) * (p ** i) * ((1 - p) ** (n - i))
print(round(t, 3))

for i in range(2, n + 1):
    s += (fac(n) / (fac(n - i) * fac(i))) * (p ** i) * ((1 - p) ** (n - i))
print(round(s, 3))

  • n4m774r_d
     + 0 comments
    from math import comb
n = 10
p = 0.12
print(round(sum(comb(n, i) * (p**i) * ((1 - p)**(n - i)) for i in range(3)),3))
print(round(1 - sum(comb(n, i) * (p**i) * ((1 - p)**(n - i)) for i in range(0, 2)),3))

  • akshaymoolath
     + 1 comment
    #python
import math
p=0.12
q=1-p
case1=0
case2=0
for x in range(0, 3):
    case1+=math.comb(10, x)* (p**x)*(q**(10-x))
for x in range(2, 11):
    case2+=math.comb(10, x)* (p**x)*(q**(10-x))
print(round(case1, 3), round(case2, 3), sep='\n')

  • mateuszampili
     + 0 comments
    import math
# Read input from STDIN
input_line = input()

# Split the input into a list of values
values = input_line.split()

# Convert the values to the appropriate data types
p = int(values[0])/100
q = (1-p)
n = int(values[1])

def binomial():
    resultOne = 0
    resultTwo = 0
    
    for i in range(0,3):
        pdf = (math.factorial(n)/(math.factorial(i)*((math.factorial(n-i)))))*(p**i)*(q**(n-i))
        if i <= 2 :
            resultOne = resultOne + pdf

    for i in range(1,(n+1)):
        pdf = (math.factorial(n)/(math.factorial(i)*((math.factorial(n-i)))))*(p**i)*(q**(n-i))     
        if i >= 2:
            resultTwo = resultTwo + pdf    
    
    print(round(resultOne, 3))
    print(round(resultTwo, 3))     
    

binomial()