Besides the programming problem for (^) for natural numbers; there is also the algorithmic question in that can the recursive case be done better than m ^ n = m * m ^ (n -1)? -- -- Regards, KC