Rearranging nothing!

In how many ways can we arrange 0 things?

Undefined 1 0

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Tapas Mazumdar
Apr 9, 2017

No. of ways to arrange n n objects is n ! n! and hence for no objects it is 0 ! = 1 0! = \boxed{1} .

Let the no. of ways of arranging n distinct objects = Tn .
It's well known that Tn+1=(n+1)Tn.T1=1 is quite trivial.
Plugging n=0,one can get T0=T1=1.
That's merely an algebraic approach.I'll have to think a lot to explain it logically.
But that's a nice question,liked it.

rajdeep brahma - 4 years, 1 month ago

I don't think that you can go directly by the formula.

Like - The number of ways of choosing 150 objects from 3 is 0. But according to the formula , it is 3 c 150. which makes it undefined.

SO , you can't always abide by the formula...SO , I think that it should be undefined, because there is no object , what you will arrange?? Lets hear it from some other people also to clarify.

@Calvin Lin @Pi Han Goh @Chew-Seong Cheong @Md Zuhair @Rahil Sehgal

Ankit Kumar Jain - 4 years, 1 month ago

Log in to reply

Dont you think Philosophically, the number of ways to arrange nothing is only by keeping nothing thus 1 \boxed{1} . way.

Md Zuhair - 4 years, 1 month ago

Log in to reply

I agree to it a bit, but still , what do you mean by arranging nothing?? Its something strange. I am not sure about it.

Ankit Kumar Jain - 4 years, 1 month ago

Log in to reply

Log in to reply

@Md Zuhair Mathematically,

4 ! = 5 ! 5 , 3 ! = 4 ! 4 , 2 ! = 3 ! 3 , 1 ! = 2 ! 2 , 0 ! = 1 ! 1 = 1 4! = \dfrac{5!}{5}, 3! = \dfrac{4!}{4}, 2! = \dfrac{3!}{3}, 1! = \dfrac{2!}{2}, 0! = \dfrac{1!}{1} = 1 .

Since this pattern yields a definite value for 0 ! 0! , if we acknowledge the formula and interpretation for n 1 n \ge 1 , then why shouldn't we acknowledge it for n = 0 n = 0 ? If we try to extend it to ( 1 ) ! (-1)! we would have the undefined 0 ! 0 \dfrac{0!}{0} , so the pattern stops at 0 0 .

Philosophically, there is one way to not arrange something, namely to not arrange it. So there is one way to arrange nothing.

Brian Charlesworth - 4 years, 1 month ago

Log in to reply

@Brian Charlesworth Thankyou sir!

Ankit Kumar Jain - 4 years, 1 month ago

@Brian Charlesworth @Brian Charlesworth sir, Why dont we take " one way to not arrange something, namely to not arrange it" in our regular problems and add +1 to the solutions?

Md Zuhair - 4 years, 1 month ago

Log in to reply

@Md Zuhair In our "regular" problems we seek to arrange things, i.e., to not n o t not arrange them, so the one way to not arrange them is not part of the solution to regular problems.

What happens with 0 0 objects is an interesting thought process. I have inferred a numerical equivalence between the number of ways of "not arranging something" and "arranging nothing". I'm not sure that they are logically equivalent, though. I'll have to think some more about that.

Brian Charlesworth - 4 years, 1 month ago

Log in to reply

@Brian Charlesworth Okay, Thank you sir!

Md Zuhair - 4 years, 1 month ago

@Md Zuhair Lets wait.:) :)

Ankit Kumar Jain - 4 years, 1 month ago
Rajdeep Ghosh
May 23, 2017

Simple. There is only one way of arranging 0 objects. That is to leave the objects as they are. In fact, this is one of the reasons of why 0 ! = 1 0!=1

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...