Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Multiplicative independence

In number theory, two positive integers a and b are said to be multiplicatively independent if their only common integer power is 1. That is, for integers n and m, a n = b m {\displaystyle a^{n}=b^{m}} implies n = m = 0 {\displaystyle n=m=0} . Two integers which are not multiplicatively independent are said to be multiplicatively dependent.

As examples, 36 and 216 are multiplicatively dependent since 36 3 = ( 6 2 ) 3 = ( 6 3 ) 2 = 216 2 {\displaystyle 36^{3}=(6^{2})^{3}=(6^{3})^{2}=216^{2}} , whereas 2 and 3 are multiplicatively independent.

We don't have any images related to Multiplicative independence yet.
We don't have any YouTube videos related to Multiplicative independence yet.
We don't have any PDF documents related to Multiplicative independence yet.
We don't have any Books related to Multiplicative independence yet.
We don't have any archived web articles related to Multiplicative independence yet.

Properties

Being multiplicatively independent admits some other characterizations. a and b are multiplicatively independent if and only if log ⁡ ( a ) / log ⁡ ( b ) {\displaystyle \log(a)/\log(b)} is irrational. This property holds independently of the base of the logarithm.

Let a = p 1 α 1 p 2 α 2 ⋯ p k α k {\displaystyle a=p_{1}^{\alpha _{1}}p_{2}^{\alpha _{2}}\cdots p_{k}^{\alpha _{k}}} and b = q 1 β 1 q 2 β 2 ⋯ q l β l {\displaystyle b=q_{1}^{\beta _{1}}q_{2}^{\beta _{2}}\cdots q_{l}^{\beta _{l}}} be the canonical representations of a and b. The integers a and b are multiplicatively dependent if and only if k = l, p i = q i {\displaystyle p_{i}=q_{i}} and α i β i = α j β j {\displaystyle {\frac {\alpha _{i}}{\beta _{i}}}={\frac {\alpha _{j}}{\beta _{j}}}} for all i and j.

Applications

Büchi arithmetic in base a and b define the same sets if and only if a and b are multiplicatively dependent.

Let a and b be multiplicatively dependent integers, that is, there exists n,m>1 such that a n = b m {\displaystyle a^{n}=b^{m}} . The integers c such that the length of its expansion in base a is at most m are exactly the integers such that the length of their expansion in base b is at most n. It implies that computing the base b expansion of a number, given its base a expansion, can be done by transforming consecutive sequences of m base a digits into consecutive sequence of n base b digits.

2

References

  1. Bès, Alexis. "A survey of Arithmetical Definability". Archived from the original on 28 November 2012. Retrieved 27 June 2012. https://archive.today/20121128154616/http://130.203.133.150/viewdoc/summary?doi=10.1.1.2.2136

  2. Bruyère, Véronique; Hansel, Georges; Michaux, Christian; Villemaire, Roger (1994). "Logic and p-recognizable sets of integers" (PDF). Bull. Belg. Math. Soc. 1: 191--238. /wiki/V%C3%A9ronique_Bruy%C3%A8re