Here's how to add two functions in normal form:
where 
unless 
and 
for all 
(in which case 
). Also, technically, we might need to
pad out either a or b so they are the same length and then drop
the trailing zeros from c.
Example:
, 
, 
, 
, 
, 
.
, 
, 
.
.
Idea: Whichever function has the largest power of n wins, with
ties broken by the largest power of 
, then 
, and
so on.
Note: Maximization is the same.
