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. Artificial Intelligence
  3. Probability & Statistics - Foundations
  4. Day 2: Basic Probability Puzzles #3
  5. Discussions

Day 2: Basic Probability Puzzles #3

Sort by

recency

|

21 Discussions

|

  • thabasvini
     + 0 comments

    check out the link for solution in python with explanation, https://youtu.be/S8OPaYOUC6s?si=-6XHBgwJUrl_BqL7

  • royabhinandan_01
     + 0 comments

    from fractions import Fraction temp_X=7 temp_Y=9 temp_Z=8 RED_X,RED_Y,RED_Z=4,5,4 BLACK_X,BLACK_Y,BLACK_Z=3,4,4 P_R_X = RED_X/temp_X P_B_X=BLACK_X/temp_X P_R_Y=RED_Y/temp_Y P_B_Y=BLACK_Y/temp_Y P_B_Z=BLACK_Z/temp_Z P_R_Z=RED_Z/temp_Z P1 = P_R_X * P_R_Y * P_B_Z P2 = P_R_X * P_B_Y * P_R_Z P3 = P_B_X * P_R_Y * P_R_Z

    temp = P1+P2+P3 print(Fraction(temp).limit_denominator(), temp)

  • jasdominika
     + 0 comments

    java

    public class Solution{

    public static void main(String[] args) {
    char[] X = {'r','r','r','r','b','b','b'};
    char[] Y = {'r','r','r','r','r','b','b','b','b'};
    char[] Z = {'r','r','r','r','b','b','b','b'};
    int denom = X.length*Y.length*Z.length;

    int reds=0;
    int count =0;

    for(char x : X){
        if(x=='r') reds++;
        for(char y : Y){
            if(y=='r') reds++;
            for(char z : Z){
                if(z=='r') reds++;
                if(reds==2) {
                    count++;
                }
                if(z=='r') reds--;
            }
            if(y=='r') reds--;
        }
        reds=0;
    }

    for (int i = 2; i < Math.sqrt(denom); i++) {
        if (denom % i == 0 && count % i == 0) {
            denom = denom / i;
            count = count / i;
            i--;

        }
    }

    System.out.println(count +"/"+denom);
}

    }

  • ayeluwin11
     + 0 comments
    from fractions import Fraction

def urns(a):
    prob = [Fraction(x[0], sum(x)) for x in a]
    prob_c = [1 - x for x in prob]
    
    n = len(a)
    ans = 0
    for i in range(n):
        p = prob_c[i] * prob[(i + 1) % n] * prob[(i + 2) % n]
        ans += p
    return ans

b =  [[4, 3], [5, 4], [4, 4]]
print(urns(b))

  • ritik_student_m1
     + 0 comments
    from fractions import Fraction
urns = [[4,3],[5,4],[4,4]]
red = []
black = []
for lst in urns:
    red.append(Fraction(lst[0],sum(lst)))
    black.append(Fraction(lst[1],sum(lst)))
doub = []
for i in range(len(red)-1):
    for j in range(i+1, len(red)):
        doub.append(red[i]*red[j])
final = []
for j in range(len(black)):
    final.append(doub[j]*black[len(black)-j-1])
print(sum(final))