Dear Tomasz,
You have to calculate n! , any way. This will cause integer overflow. But
any way if you cheat the def factorial to be fp as follows;
def fac(n):
if n == 1. then
return 1.
return n*fac(n-1.)
It works, but I don't like this way. Smalltalk can perform this calculation
very fast without losing its significance.
tawee