.oO( why does this smell like homework? )
Anyway: for each possible 32 bit value there is exactly one other value which XOR's it to zero, so if you assume uniform probability for all values and no correlation between adjacent words the probability is 2**(-32)
In reply to Re: (OT): Probability problem
by moritz
in thread (OT): Probability problem
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |