User blog comment:Denis Maksudov/Generator of Googologisms/@comment-25337554-20160813043017/@comment-28606698-20160813064755

Just for simplification of the program.

j=1 as well as k=1 are a special cases, because

If j=1 then  this is not


 * 1) - unult - #

this is



as well as if k=1 this is not


 * 1) - # - unexom

this is


 * 1) - #om

as well as if  k=1 and j=1 this is not


 * 1) -unult-unexom

this is


 * om

After description of cases for j = 1, amount of  googologisms would increased only 5%,

but it would significant increasing of text of program