The apparent intended method was a recursive function, which, however, this is not. As `factorial`

goes, a recursion looks elegant but is in fact not the approach to reach for. I'm sure the jury is out on that one. Iteration is the way to go. Work to develop an iterative function that returns a factorial.

The recursion you were after looks like this (to which you were very close)

```
>>> def factorial(x):
return 1 if x == 1 else x * factorial(x - 1)
>>> factorial(7)
5040
>>>
```

`27!`

is a huge number...

```
>>> factorial(27)
10888869450418352160768000000
>>>
```

That's 28 magnitudes of 10, 5 magnitudes greater than the distance light has travelled since the start of the of known universe.

```
>>> 1.38e10 * 1e13
1.38e+23 # distance in kilometers of 13.8 billion light years
>>>
```

For the record, even Python does not use recursion in the math.factorial function.

`for (i=1 ; i<=x ; i++) { // C`

On this page, F3 math_factorial.