Serving the Quantitative Finance Community
-
- animeshsaxena
- Posts: 18
- Joined:
Binary Machine
A binary machine generates 1 & 0 numbers for making large binary numbers. For a n digit binary number we have k One's and (1-k) Zero's. Find k such that probability of the sequence generated (for that k) is Maximumized. Given Probability of generating a 1 = 0.6 Probability of generating a 0 = 0.4Assume n = 100.
Binary Machine
Fix n. Let p=prob of generating 1's and p_k = prob of generating k 1's out of n independent trials. Then p_k reaches its maximum at around p(n+1)-1.
-
- animeshsaxena
- Posts: 18
- Joined:
Binary Machine
U r rite, so a more interesting question would be to maximize probability when all those 0 sequences (sequence with 0's at the front) are rejected!
-
- animeshsaxena
- Posts: 18
- Joined:
Binary Machine
I also was just about to edit the post.....with "Hard Luck".....same question....