---
title: 'Dr. Square'
url: 'https://blog.recursiveprocess.com/2011/11/11/dr-square'
markdown: 'https://blog.recursiveprocess.com/2011/11/11/dr-square.md'
date: '2011-11-11'
description: "Much like the Collatz conjecture, the Dr. Square Puzzle\_(from the blog mathforlove)\_is an\_intriguing\_problem. With some playing around, we came up with what I think is an excellent (and solvable) puzzle. He dubbed it the Dr Square puzzle, because it involves one of the steps in taking the\_digital …"
taxonomy:
  category:
    - blog
---

# Dr. Square

### [Dr. Square](https://blog.recursiveprocess.com/2011/11/11/dr-square)

   November 11, 2011, 12:00 am  

Much like the [Collatz conjecture](http://en.wikipedia.org/wiki/Collatz_conjecture), the [Dr. Square Puzzle](http://mathforlove.com/2011/11/the-dr-square-puzzle/) (from the blog [mathforlove](http://mathforlove.com/blog/)) is an intriguing problem.

> With some playing around, we came up with what I think is an excellent (and solvable) puzzle. He dubbed it the Dr Square puzzle, because it involves one of the steps in taking the [digital root](http://en.wikipedia.org/wiki/Digital_root) (dr) and squaring numbers. Here’s how it goes.
> 
> Step 1: Choose a starting number.
> 
> Step 2: Square the number.
> 
> Step 3: Sum up the digits of that number.
> 
> Step 4: Repeat steps 2 and 3 until you understand what’s going on.
> 
> **Example**. Let’s take the number 26. Squaring it gives 676. The digital sum of 676 is 19. Squaring gives 361. Digital sum of 361 is 10. Squaring 10 gives 100. Digital sum of 100 is 1. Squaring gives 1. Digital sum gives 1. So we stay at 1 forever once we get there.
> 
> More briefly, we could write 26 –> 676 –> 19 –> 10 –> 100 –> 1 –> 1 –> 1 –> etc.

Naturally, I wrote a [python program](http://dl.dropbox.com/u/3646828/drsquare.py) to check the first million number and so far it looks like they are right. If you take off the comment symbol (#) from lines 6, 20, 23, and 24 then it will print the path to each number.

 [ Next Post](https://blog.recursiveprocess.com/2011/11/18/fibonacci-and-recursion) [Previous Post ](https://blog.recursiveprocess.com/2011/11/02/puzzler-20000-lights)

#### SimpleSearch

Bootstrap Theme for [Grav](http://getgrav.org)

---

## Navigation

- Parent: [A Recursive Process](https://blog.recursiveprocess.com/index.md)
- Previous: [Fibonacci and Recursion](https://blog.recursiveprocess.com/2011/11/18/fibonacci-and-recursion.md)
- Next: [Puzzler : 20,000 Lights](https://blog.recursiveprocess.com/2011/11/02/puzzler-20000-lights.md)
