This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.

When posting on Brilliant:

Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .

Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.

Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.

Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

Markdown

Appears as

*italics* or _italics_

italics

**bold** or __bold__

bold

- bulleted- list

bulleted

list

1. numbered2. list

numbered

list

Note: you must add a full line of space before and after lists for them to show up correctly

Comments

0! is a conjecture..it is just like u cannot define a point or define infinity in classical mathematics!it is an assumption that 0!=1. and again the factorial function is one-many as seen in case of 0! and 1!.so while proving both equals 1,u have to do the inverse which doesnt always exist and x!=y! doesnt imply x=y.

If f(x1)=yf(x_1)=yf(x1​)=y and f(x2)=yf(x_2)=yf(x2​)=y, do we say x1=x2x_1=x_2x1​=x2​? No.

For an example, 32=93^2=932=9 and (−3)2=9(-3)^2=9(−3)2=9, but −3≠3-3\neq3−3​=3.

As explaining why 0!=10!=10!=1, Bruce has the exact explaination. The concept for n!n!n! is the number of ways to arrange nnn distinct object. Try imagine an empty space with no object, how many arrangements are there? The image in your mind, which is AN EMPTY SPACE, is the ONLY arrangement for 0 object. Thus, 0!=10!=10!=1

The factorial function is a special case of what is called the Gamma function
Γ(x)=∫0∞tx−1e−tdtx>0 \Gamma(x) \; = \; \int_0^\infty t^{x-1}\,e^{-t}\,dt \qquad x > 0 Γ(x)=∫0∞​tx−1e−tdtx>0
(Actually, the Gamma function can be defined for all complex numbers except 0,−1,−2,−3,…0,-1,-2,-3,\ldots0,−1,−2,−3,…, but that is more complicated). Integration by parts shows that
Γ(x+1)=xΓ(x)x>0 \Gamma(x+1) = x\Gamma(x) \qquad x > 0Γ(x+1)=xΓ(x)x>0
and Γ(1)=1\Gamma(1) = 1Γ(1)=1. It is easy to see from these properties that Γ(n+1)=n!\Gamma(n+1) = n!Γ(n+1)=n! for any nonnegative integer nnn (including n=0n=0n=0).

While this is true, the sticking point is that the gamma function was motivated by the definition of the factorial function on the positive integers, so to then define the factorial in terms of the gamma is pedagogically and historically inverted, even though it is perfectly valid from a mathematical standpoint. So, in order to motivate the value of 0! 0! 0! using the gamma function, we would need to discuss concepts like continuity, limits, and integrability--i.e., most of the fundamentals of calculus on the real line, much in the same way that to motivate the value of Γ(z) \Gamma(z) Γ(z) for complex z z z, we'd need to talk about analytic continuation.

What the usual combinatorial and elementary definitions of factorial have going for them is that they can more intuitively justify 0!=1 0! = 1 0!=1, even though such reasoning may not be rigorously derived from established axioms.

Firstly, we do not need to use analytic continuation to study the Gamma function for Rz>0\mathfrak{R}z > 0Rz>0, and that is all it takes to handle n!n!n! for n≥0n \ge 0n≥0.

As to your main point, yes and no. There are times where it is both necessary and useful to invert the historical development of a subject - just because something was done first does not mean it was done better that way.

For example, the "definition" of π\piπ as the ratio between the circumference and diameter of a circle is a bad definition of π\piπ, since it can only be used to calculate π\piπ by a process of measurement, which is inherently inaccurate. The "definitions" of the trigonometric functions in terms of the sides of a right-angled triangle are similarly flawed. At some stage, you have to change your point of view and define the trigonometric functions in terms of their Maclaurin series; π\piπ then appears in terms of the periodicity of the trig functions, which can be established from the series definitions. You can then go on to prove that the circumference/diameter stuff, or the triangle ratio results, are all consequences of these definitions.

Similarly, at some stage you have to realise that the factorial function is only a portion of the truth and that, seen in the light of the Gamma function, the identity 0!=10!=10!=1 is not in the least mysterious, and does not have to be explained by linguistic sleight of hand of the "there is just one way to do nothing" variety, or by "believe me, it works, and it makes the formulae for the binomial coefficients neat" arguments. If you choose to make the argument that "the value of 0!0!0! is chosen so that the identity n!=n×(n−1)!n! \,=\, n \times (n-1)!n!=n×(n−1)! is valid for n=1n=1n=1", then you are doing a little bit of analytic continuation yourself!

It is important pedagogically to offer both, and complement these utilitarian arguments with the observation (if only as a passing comment) that there is a better reason out there.

You must be careful, for some function fff, there doesn't always exist a unique inverse f−1f^{-1}f−1, other than for some domain. In this case, we may assume x>0x>0x>0, or, alternatively that x≠1x\ne1x​=1

By the way, it is defined to be so. The basic idea of combinatorics is reducing the large list into a recognisable pattern which doesn't have to repeated time and again. So, when we observe somthing like this, we have to define it in such a way that it agrees with our recognized pattern.
There is one way to take a single object.(1!)
There is one way Not to take that object.(a possibility).( 0!)
So, even though the number of ways are same, it doesn't mean that the ways are same!

1!1!1! is the number of ways of arranging 1 item, which is 1. 0!0!0! is the number of ways of arranging 0 items. Since there is only 1 way to do NOTHING, (that is to not do it) we have 0!=10!=10!=1. So by comparing 0!0!0! and 1!1!1!, we are comparing the number of ways of arranging 1 and 0 items respectively. Just because the result is same doesn't mean that the number of items has to be same. So 0≠10\neq10​=1.