Prove that 0!=10!=1

0!=10!=1

1!=11!=1

2!=2×12!=2\times 1

3!=3×2×13!=3\times 2\times 1

4!=4×3×2×14!=4\times 3\times 2\times 1

    ~~~~ \vdots

#NumberTheory

Note by Nazmus Sakib
3 years, 6 months ago

No vote yet
1 vote

  Easy Math Editor

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.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

(n1)!=n!n(n-1)! = \dfrac{n!}{n}

Putting n=1n =1

(11)!=1!1(1-1)! = \dfrac{1!}{1}

0!=10! = 1 [Proved]

Munem Shahriar - 3 years, 6 months ago

Another method of Proving this can be:

We know that the number of ways of selecting rr objects from nn distinct objects (nr)(n \ge r) are (nr)=n!r!(nr)!\displaystyle {n \choose r}= \dfrac{n!}{r!(n-r)!} .

We also know that the number of ways of choosing nn objects from nn objects is of course 11.

\therefore n!n!(nn)!=10!=1\dfrac{n!}{n!(n-n)!}=\dfrac{1}{0!}=1     0!=1\implies 0!=1

Vilakshan Gupta - 3 years, 6 months ago

I think of 0!0! as being 'defined' as 11, rather than it being able to be proved that it is 11.

I think of 0!=10!=1 as being true as the factorial function is 'multiplicative' in the sense that it is all about multiplication, and 11 is defined as the identity element of multiplication.

Arthur Conmy - 3 years, 6 months ago
×

Problem Loading...

Note Loading...

Set Loading...