0! = 1 (1 Viewer)

Iruka

Member
Joined
Jan 25, 2006
Messages
544
Gender
Undisclosed
HSC
N/A
Its true by definition.

They define it that way so that most of the formulae using factorials will still work out nice.

Alternately, you can think of n! being the number of ways to arrange n distinct objects in some order. In which case, if n=0, there is only one way to arrange no objects in order - i.e., not at all.
 

DJel

Member
Joined
Dec 3, 2006
Messages
96
Location
Central Coast, N.S.W
Gender
Male
HSC
2008
Stevo. said:
Good work... :rolleyes:

Iruka said:
Its true by definition.

They define it that way so that most of the formulae using factorials will still work out nice.

Alternately, you can think of n! being the number of ways to arrange n distinct objects in some order. In which case, if n=0, there is only one way to arrange no objects in order - i.e., not at all.
Thanks for that. I was unable to find a definitive proof and assumed this was so the formulas would work out.
 

Poad

Member
Joined
Oct 17, 2007
Messages
188
Gender
Male
HSC
2008
The actual proof is:

n! = n(n-1)!
let n = 1

1! = 1(1-1)!
.:. 1 = 0!
 

Templar

P vs NP
Joined
Aug 11, 2004
Messages
1,979
Gender
Male
HSC
2004
Poad said:
1! = 1(1-1)!
.:. 1 = 0!
If we're going to be completely rigorous here, the last line doesn't follow from the above, since then you are assuming 1!=1 and that n! is defined to be n(n-1)! even for n=1.
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top