Is the equation 0!=1 based on flawed reasoning?

  • Context: Undergrad 
  • Thread starter Thread starter Pete Mcg
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the equation 0! = 1 and the reasoning behind its validity. Participants explore the implications of the factorial function, particularly in relation to its definition and application for different values of n, including 0. The conversation includes both conceptual and mathematical reasoning, with some participants expressing skepticism about the established definitions.

Discussion Character

  • Debate/contested
  • Conceptual clarification
  • Mathematical reasoning

Main Points Raised

  • One participant argues that the equation n! = n(n-1)! should only apply for numbers greater than 2, suggesting that using it for smaller numbers leads to flawed reasoning.
  • Another participant asserts that 0! = 1 is defined as such and that n! = n(n-1)! holds for n ≥ 1.
  • A different viewpoint introduces the Gamma function as a generalization of the factorial, implying that there are broader contexts to consider.
  • Some participants discuss the concept of an empty product, stating that it is logical to define 0! as 1 since it serves as the neutral element of multiplication.
  • There is mention of the idea that if 0! were defined as 5, it would lead to cumbersome mathematical expressions, indicating a preference for the definition of 0! as 1.
  • One participant questions whether their pattern reasoning constitutes a proof and expresses uncertainty about the nature of mathematical proofs and authority in mathematics.
  • Another participant emphasizes that 0! = 1 is essentially a definition, similar to the recursive definition of factorial.
  • There is a request for simpler explanations of the concepts discussed, indicating a desire for clarity in understanding the reasoning behind these definitions.

Areas of Agreement / Disagreement

Participants express a range of opinions on the validity of the reasoning behind 0! = 1, with some supporting the established definition and others questioning its logical foundation. The discussion remains unresolved, with competing views on the application and implications of the factorial function.

Contextual Notes

Some participants highlight the limitations of the factorial function's recursive definition, particularly regarding its initial conditions. The discussion also touches on the philosophical aspects of defining mathematical concepts, indicating that the reasoning may depend on interpretations and definitions that are not universally agreed upon.

  • #31
 
  • Like
Likes   Reactions: BWV and PeroK
Mathematics news on Phys.org
  • #32
Pete Mcg said:
I am interested in why some Mathematicians use the formula n!=n(n-1)! - please see my original post.
We want to abbreviate ##1\cdot 2\cdot 3 \cdots n## and choose the notation ##n!## for this product. There are 3 possible ways to do so:
  • by words
  • by dots, like I just did
  • by recursion
The latter means basically by its precedessor, i.e. ##(n-1)!## This is commonly seen as the most elegant way since it avoids dots or phrases like 'and so on'. As explained before, this needs an anchor, a starting point, which is ##0!=1## for various reasons.
 
  • Like
Likes   Reactions: Pete Mcg and sysprog
  • #33
@fresh_42, so do you suppose it would be more explanatory or just more inelegant (or something else) to write ##0!=0.9^* =1## instead of just writing ##0!=1##? :wink:
 
  • #34
sysprog said:
@fresh_42, so do you suppose it would be more explanatory or just more inelegant (or something else) to write ##0!=0.9^* =1## instead of just writing ##0!=1##? :wink:
In general, we have a universal constant ##0! = f_0##, which appears as a factor in the relevant equations. E.g. $$\binom n k = \frac{(n!)f_0}{(n-k)!k!}$$For simplicity, mathematicians generally work with the choice of ##f_0 = 1##.
 
Last edited:
  • Like
Likes   Reactions: sysprog and fresh_42
  • #35
fresh_42 said:
We want to abbreviate ##1\cdot 2\cdot 3 \cdots n## and choose the notation ##n!## for this product. There are 3 possible ways to do so:
  • by words
  • by dots, like I just did
  • by recursion
The latter means basically by its precedessor, i.e. ##(n-1)!## This is commonly seen as the most elegant way since it avoids dots or phrases like 'and so on'. As explained before, this needs an anchor, a starting point, which is ##0!=1## for various reasons.
Thank you.
 
  • #36
sysprog said:

Yes. I have seen this one. It's good.
 
  • #37
Thank you. You have been very helpful.
 
  • Like
Likes   Reactions: PeroK
  • #38
MidgetDwarf said:
Yup, that is the gist of it.

If you want to understand what mathematicians call a proof https://www.people.vcu.edu/~rhammack/BookOfProof/

It is pdf made free by the author. Happy reading.
Thank you so much!It all makes sense now...
 
  • #39
Pete Mcg said:
Thank you so much!It all makes sense now...
My God! I've just had a peek at Book Of Proof and it's marvellous. Can I write you into my will?
 
  • Like
Likes   Reactions: berkeman
  • #40
Pete Mcg said:
please correct me if I'm wrong. 0!=1 is a 'definition' in the same way that 1=1 or any other self evident statement is a definition and 'You do no prove a definition in Mathematics'.
1 = 1 is not a definition. In general for all kinds of definitions, including words found in a dictionary, you can't define something in terms of itself.
The equation 1 = 1 is an example of the reflexive property of the equality relation. This property says that any number is equal to itself. Other relations, such as < or >, do not have this property. For example, ##5 \nless 5## and ##2 \ngtr 2##.
 
Last edited:
  • Like
Likes   Reactions: Pete Mcg, sysprog and PeroK
  • #41
Pete Mcg said:
My God! I've just had a peek at Book Of Proof and it's marvellous. Can I write you into my will?
Yes :woot:.
 
  • Like
Likes   Reactions: Pete Mcg
  • #42
Throughout this thread I see; n! = n(n-1)!
But that is sloppy since the complete recursive definition of factorial is;
n! = n(n-1)! for n≥1 and 0!=1
Everything here is a definition.
Do not attempt to use the definition as a self referential proof of itself.
 
  • Skeptical
  • Like
Likes   Reactions: Pete Mcg and PeroK
  • #43
PeroK said:
:welcome:

##0! = 1## (by definition)

##n! = n(n-1)!## (for ##n \ge 1##)
You obviously failed to see post #2.
 
  • #44
@PeroK
I did see post #2. You got it right, but most of the thread ignores the complete definition and so becomes incomplete or self-referential.
 
  • Like
Likes   Reactions: Lord Jestocost
  • #45
Baluncore said:
@PeroK
I did see post #2. You got it right, but most of the thread ignores the complete definition and so becomes incomplete or self-referential.
I apologize for not meeting your standards.
 
  • #46
caz said:
I apologize for not meeting your standards.
No apology is necessary in hindsight if it gets people to think. My standards are lower than yours.

This interesting thread gave me the uncanny feeling that we were contemplating the proof of a definition, from inside a fishbowl, while looking at our different reflections in the curved wall.

Meanwhile some find the difference between antimony and an antinomy.
 
  • Haha
Likes   Reactions: sysprog
  • #47
caz said:
I apologize for not meeting your standards.
Hmm ##\dots -## here's an observation not especially related to meeting standards, but at least ancillarily related to this thread topic: computationally, for e.g. card-deck-sized non-zero factorials, e.g. between euchre, poker, and pinochle or canasta sized decks, an iterative method is a little faster than recursive, but for zero, there's no comparison necessary between those methods, because we just hardcode zero factorial to 1 ##-## it's so by definition, as @PeroK said, and reasonably so, as @fresh_42, @PeroK, @Baluncore, @Mark44, and maybe others, explained.
 
  • #48
@sysprog Is the definition of n! iterative or recursive ?
I think you are saying that, even if I knew the difference between an iterative and a recursive definition, I could not apply either to the definition of 0!
 
  • #49
Baluncore said:
Is the definition of n! iterative or recursive ?
Iterative (or explicit) definition:
$$ n! = \begin{cases}
\prod\limits_{k=1}^n k, & \text{if}\ n>0 \\
1, & \text{if}\ n = 0
\end{cases}
$$
Recursive (or implicit) definition:
$$ n! = \begin{cases}
n(n-1)! , & \text{if}\ n>0 \\
1, & \text{if}\ n = 0
\end{cases}
$$
So ## 0! ## is defined identically in each case.
 
  • Like
Likes   Reactions: Klystron, sysprog and Baluncore
  • #50
Or simply $$n!=\prod\limits_{k=1}^n k$$ with the understanding that a product indexed from one to zero is the empty product which is, by definition, the neutral element for multiplication.

The meaning of the empty product was already belabored up-thread.

Edit:

In the world of computing, the Ada programming language makes explicit the notion of an empty array slice such as a[1:0]. If the initial index is one greater than the final index, the result is explicitly the empty array and no bounds checking on either index is performed.

In VAX Fortran-77 the same would work and was needed to create an empty string, but one needed to compile with bounds checking disabled.
 
Last edited:
  • #51
MidgetDwarf said:
Yes :woot:.
How does 10% of almost nothing sound?
 
  • #52
Mark44 said:
1 = 1 is not a definition. In general for all kinds of definitions, including words found in a dictionary, you can't define something in terms of itself.
The equation 1 = 1 is an example of the reflexive property of the equality relation. This property says that any number is equal to itself. Other relations, such as < or >, do not have this property. For example, ##5 \nless 5## and ##2 \ngtr 2##.
Thank you for that. As stated previously in my original post, I'm not a Mathematician and am learning, every little bit counts and I appreciate your and everybody's input . (Learned today that you when you multiply a negative number by a negative number the result is a positive number - they didn't teach this in Maths @ school I went to so it took a bit of getting my head round it - at first I went HUH?? but it's starting to makes sense.) This a new world to me, good fun -talk about fun - this Godel incompleteness thing has got me intrigued!
As in learning any new 'language' one needs to understand the rules and conventions (another thing learned today was BOMDAS / PEMDAS)Even the supposedly simplest thing like 'number' has a myriad of different 'meanings' - natural numbers, rational numbers, irrational etc etc etc ...Anyway, enough of my rambling. Cheers.
 
  • #53
Pete Mcg said:
they didn't teach this in Maths @ school I went to so it took a bit of getting my head round it - at first I went HUH??
A product is an area. An area is oriented. It makes a difference whether you circle it clockwise or counter-clockwise, one is noted as a positive number, the other one by a negative number. Which is which is up to you. The lines are oriented, too, up and down, left and right. Now ##(+1)\cdot (+1)## has the same orientation as ##(-1)\cdot (-1),## and ##(+1)\cdot (-1)## is of opposite orientation.
 
  • #54
Another motivation is the distributive law: ##a \times (b+c) = a \times b + a \times c##

Say you have ##-2 \times (1-1)## then clearly that should evaluate as ##-2 \times 0 = 0##. If we apply the distributive law, it should be equal to ##( -2 \times 1 ) + ( -2 \times -1 )##. But if a negative times a negative is a negative, that formula evaluates as ##-2 + -2## for a result of ##-4## which is wrong.

So if a negative times a negative yields a negative, the distributive law breaks.
 
  • #55
Pete Mcg said:
(Learned today that you when you multiply a negative number by a negative number the result is a positive number - they didn't teach this in Maths @ school I went to so it took a bit of getting my head round it
Sorry to hear that it wasn't taught at your school. My first exposure to signed-number arithmetic was in ninth grade, back when I was 14.
 
Last edited:
  • #56
jbriggs444 said:
Another motivation is the distributive law: ##a \times (b+c) = a \times b + a \times c##

So if a negative times a negative yields a negative, the distributive law breaks.
If a negative times a negative yields a negative there are no multiplicative inverses for negative numbers so we haven't even got a group.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
Replies
8
Views
2K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K