Source: Australian Mathematical Society Gazette Puzzle Corner 34
Problem: Begin with n integers x1, . . . , xn around a circle. At each turn, simultaneously replace all of them by the absolute differences
Repeat this process until every number is 0, then stop. Prove that this process always terminates if and only if n is a power of 2.
Shameless plug:
Follow CSE Blog on CSE Blog - Twitter and CSE Blog on Quora. :-)
This post first appeared on CSE Blog - Quant, Math, Computer Science Puzzles, please read the originial post: here
