Idiom # 336 Exponent
Code
The following example shows how to implement exponentiation recursively in Fuzion. Results of b^n comes by multiplying the base 'b' recursively 'n' times.
Altough it is not shown in this example, Fuzion includes a built-in exponentiation operator **
You are able to learn more about it here: link