Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

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

by I0 (Priest)
on Mar 31, 2004 at 09:44 UTC ( #341262=note: print w/replies, xml ) Need Help??


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

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

Replies are listed 'Best First'.
Re: Re: Re: What is the fastest pure-Perl implementation of XXX?
by dragonchild (Archbishop) on Mar 31, 2004 at 13:28 UTC
    Only by definition and because it's useful. 0! can just as easily be defined as 0, with different results.

    ------
    We are the carpenters and bricklayers of the Information Age.

    Then there are Damian modules.... *sigh* ... that's not about being less-lazy -- that's about being on some really good drugs -- you know, there is no spoon. - flyingmoose

      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).

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://341262]
help
Chatterbox?
and snow settles gently...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2016-12-11 04:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (168 votes). Check out past polls.