Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: Re: Re: What is the fastest pure-Perl implementation of XXX?

by tilly (Archbishop)
on Mar 31, 2004 at 19:30 UTC ( [id://341386]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Re: What is the fastest pure-Perl implementation of XXX?
in thread What is the fastest pure-Perl implementation of XXX?

To the extent that "factorial" is an arbitrary function, you can define it any way that you like. This is trivially obvious, but not very useful.

But you will have a very hard time finding any mathematician who agrees that it either makes sense or is useful to define 0! as anything other than 1. I can think of a half-dozen reasons to make it 1. None to call it 0. If you did find such an odd mathematician, I guarantee that it won't be someone in combinatorics (which is the field of math where factorial tends to come up the most).

  • Comment on Re: Re: Re: Re: What is the fastest pure-Perl implementation of XXX?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://341386]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others admiring the Monastery: (3)
As of 2024-04-18 23:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found