Recent content by blackle

  1. B

    Hypothesis Testing for Error Rate at Amazoogle.com

    I am not sure whether this falls in this section or the other. But as the calculation of likelihood usually involves calculus, posting it here. Homework Statement The Big Boss at Amazoogle.com says that based on long experience, the best model for errors in software is that experienced...
  2. B

    Poisson Distribution and slot machine

    Homework Statement A casino slot machine costs C dollars per play. On each play, it generates random variable X ~ Poisson with parameter λ < 1, and pays the player X! (X factorial) dollars. As a function of the fixed parameters λ and C, how much money would you expect to win (or lose) per turn...
  3. B

    Calculating n with Super-Fast Computing: P1-P4

    Thanks everyone for the reply, especially Sammy :)
  4. B

    Calculating n with Super-Fast Computing: P1-P4

    • P1 takes n days to run • P2 takes n^2 days to run • P3 takes 2^n days to run • P4 takes log(n) in base 2 days to run So, to run P2 on an n of 4 would take 16 days. a. For each version of the program, calculate the value of n (rounded down) we could compute if we let the program run for...
  5. B

    Calculating Connectivity Patterns in a Computer Network

    Right! Thank you. Reminds of of binary representation. 5 computers, each two possible states 0 or 1. So 2^5 is all the possible number of states. Now to doing the rest of the parts of the problem. Thanks again :)
  6. B

    Calculating Connectivity Patterns in a Computer Network

    Homework Statement [A computer network consisting of five computers is to be formed by connecting each computer to each of the others by a direct ("point-to-point") network cable. a) How many network cables are needed? b) Unfortunately, some of the cables may be faulty ("dead") while...
  7. B

    Prove/Disapprove n2 + 3n + 1 is prime for n > 0

    Thank you! That was of great help :)
  8. B

    Prove/Disapprove n2 + 3n + 1 is prime for n > 0

    Prove or disprove that n2 + 3n + 1 is always prime for integers n > 0. I am at a complete loss. I don't even know where to begin. Following are the formulas that I feel might be relevant: 1) a and b are relatively prime if their GCD(a, b) = 1 2) If a and b are positive integers, there...
Back
Top