and subtract them from each other, Then we continue this method, taking the maximum and minimum numbers of each succeeding difference, as long as possible(fig. 3)
As a result of the investigation of these sequences of differences, we find that almost all differences of this kind stop after few at the most five steps with 495. An exception is the case in which the max imum three-digit number has the condition h u 0 or h u 1 In carrying out this activity, a complete list of the"number of steps" for all three digit numbers can easily be obtained