The 3𝑥+1 Problem as a String Rewriting System
The 3𝑥+1 problem can be viewed, starting with the binary form for any 𝑛∈𝐍, as a string of “runs” of 1s and 0s, using methodology introduced by Błażewicz and Pettorossi in 1983. A simple system of two unary operators rewrites the length of each run, so that each new string represents the next odd int...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2010-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2010/458563 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|