WOLFRAM LANGUAGE FEATURED EXAMPLE

Packet Transmission

A packet consisting of a string of symbols is transmitted over a noisy channel. Each symbol has a probability 0.0001 of being transmitted in error. Find the largest for which the probability of incorrect transmission (at least one symbol in error) is less than 0.001.

In[1]:=
Click for copyable input
The probability of an error in the transmission:
In[2]:=
Click for copyable input
Out[2]=
In[3]:=
Click for copyable input
Out[3]=
Find the largest for which the probability of incorrect transmission is less than :
In[4]:=
Click for copyable input
Out[4]=