Editing Friedman number (section)

== Finding 2-digit Friedman numbers ==
There usually are fewer 2-digit Friedman numbers than 3-digit and more in any given base, but the 2-digit ones are easier to find. If we represent a 2-digit number as ''mb'' + ''n'', where ''b'' is the base and ''m'', ''n'' are integers from 0 to ''b''−1, we need only check each possible combination of ''m'' and ''n'' against the equalities ''mb'' + ''n'' = ''m''<sup>''n''</sup>, and ''mb'' + ''n'' = ''n''<sup>''m''</sup> to see which ones are true. We need not concern ourselves with ''m'' + ''n'' or ''m'' × ''n'', since these will always be smaller than ''mb'' + ''n'' when ''n'' < ''b''. The same clearly holds for ''m'' − ''n'' and ''m'' / ''n''.