OurBigBook About$ Donate
 Sign in Sign up

Base dependence of regularity for representations of powers of two

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Formal language theory Pumping lemma for regular languages
Created 2026-09-29 Updated 2026-10-03  0 By others on same topic  0 Discussions Create my own version
The base-two representations of powers of two form the regular language 10∗. Their base-ten representations are not regular. Pumping a fixed decimal substring of length d would produce powers of two ai​ satisfying ai+1​−10dai​=C. After division by ai​ and passage to large i, integrality would force a power of two to equal 10d, contradicting unique factorization.

 Ancestors (6)

  1. Pumping lemma for regular languages
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook