Abstract [eng] |
In this work, the frequency of multiplicatively dependent and independent algebraic numbers is investigated by providing possible algorithms for its calculation. One application of multiplicative independence, namely its use for proving the algorithmic decidability of logical sentences in formal arithmetic using Cobham's theorem, is presented, along with an overview of a proof of multiplicative independence for bases of a number system in ℤ[𝜁_𝑘]. |