Massimiliano Sala edited bits1.tex  over 7 years ago

Commit id: 69d51d7ae48ad3fed5b0f4788c798322488b9bfd

deletions | additions      

       

We can easily find a similar rational for each \emph{nonzero} element of $\QQ$ (while we cannot for $0$).  \\  It is of utmost interest to observe that bits behave like rational numbers rather than integers.   Indeed,in $\Fb$  $1 \cdot 1=1$, 1=1$ in $\Fb$,  but we cannot find any bit $b$ such that $1 \cdot b = b \cdot 1 =1$. \\  We can formalize this property, saying that each nonzero element of $\QQ$ (resp $\Fb$) has a \emph{multiplicative inverse}, i.e.  $$\forall a \in \QQ\setminus \{0\}\, (\textrm{ resp } \Fb\setminus \{0\}),\, \exists a^{-1} \in \QQ\setminus \{0\}\, (\textrm{ resp } \Fb\setminus \{0\}) \textrm{ s.t. } a\cdot a^{-1} =a^{-1} \cdot a =1. $$