Kaprekar’s constant

A student talked about Kaprekar’s constant (6174) during their my favorite presentation. Really cool. Steps (from wikipedia): Take any four-digit number, using at least two different digits. (Leading zeros are allowed.) Arrange the digits in descending and then in ascending order to get two four-digit numbers, adding leading zeros if necessary. Subtract the smaller number […]

Euclid GCD

Darker pixel = longer Euclidean algorithm to find GCD(x,y). Here x & y range from 1 to 500. So many questions… pic.twitter.com/k8N6jiGxSd — Matt Enlow (@CmonMattTHINK) September 24, 2014 I saw this toot by Matt yesterday morning and I loved the visual of the color based on the number of steps of Euclid’s GCD algorithm. […]