10217

# A Procedure to Compute the Digit Sequence of a Rational Number

This Demonstration visualizes a procedure for generating the base 2-digit sequence for the rational number , , . From A New Kind of Science, p. 139: "The idea is to have a number which essentially keeps track of the remainder at each step in the division. One starts by setting equal to . Then at each step, one compares the values of and . If is less than , the digit generated at that step is 0, and is replaced by . Otherwise, is replaced by . With this procedure, the value of is always less than . And as a result, the digit sequence obtained always repeats at most every steps." On the left, the row shows the binary digits of at the step in the algorithm, and on the right, the binary digits of are shown vertically. Black cells represent 1's, and gray cells represent 0's.

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.