The 3x+1 problem as a string rewriting system

DOI10.1155/2010/458563MaRDI QIDQ623692zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Joseph Sinyor

Publication date 8 February 2011

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2010/458563

zbMATH Keywords

\(3x+1\) problem

Mathematics Subject Classification ID

Recurrences (11B37) Grammars and rewriting systems (68Q42)

Review text

Let \(T^k(n)\) be the value after \(k\) iterations in the \(3x+1\) problem. The author reformulates the conjecture in two assertions: (I) Every odd \(n\) lies on a distinct \(3x+1\) trajectory between two Mersenne numbers \(2^k-1\) or their equivalents; (II) If \(T^r(2^k-1)\to 2^l-1\) for any \(r,k,l>0\) then \(l<k\).

Recommendations

• The 3x + 1 Problem and Its Generalizations
• On the \(3x+1\) problem
• scientific article; zbMATH DE number 1934404
• scientific article; zbMATH DE number 58307
• The congruence structure of the 3x+1 map

Cites work

• scientific article; zbMATH DE number 3871450 (Why is no real title available?)
• scientific article; zbMATH DE number 51916 (Why is no real title available?)
• scientific article; zbMATH DE number 58307 (Why is no real title available?)
• Maximum excursion and stopping time record-holders for the problem: Computational results
• On the \(3x+1\) problem
• On the Collatz 3n + 1 Algorithm
• The 3x + 1 Problem and Its Generalizations
• The dynamical system generated by the \(3n+1\) function

Cited in

(1)

• Three one-way heads cannot do string matching

This page was built for publication: The \(3x+1\) problem as a string rewriting system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623692)