Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Properties  





2 Applications  





3 References  














Multiplicative independence







Add links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Innumber theory, two positive integers a and b are said to be multiplicatively independent[1] if their only common integer power is 1. That is, for integers n and m, implies . Two integers which are not multiplicatively independent are said to be multiplicatively dependent.

As examples, 36 and 216 are multiplicatively dependent since , whereas 2 and 3 are multiplicatively independent.

Properties[edit]

Being multiplicatively independent admits some other characterizations. a and b are multiplicatively independent if and only if is irrational. This property holds independently of the base of the logarithm.

Let and be the canonical representationsofa and b. The integers a and b are multiplicatively dependent if and only if k = l, and for all i and j.

Applications[edit]

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 . 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.

References[edit]

[2]

  1. ^ Bès, Alexis. "A survey of Arithmetical Definability". Archived from the original on 28 November 2012. Retrieved 27 June 2012.
  • ^ 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.

  • Retrieved from "https://en.wikipedia.org/w/index.php?title=Multiplicative_independence&oldid=1197394653"

    Category: 
    Number theory
    Hidden categories: 
    Articles needing additional references from April 2016
    All articles needing additional references
     



    This page was last edited on 20 January 2024, at 09:21 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki