Solving Problems: Combinations and Permutations

Click For Summary

Discussion Overview

The discussion revolves around two combinatorial problems: selecting books from a shelf containing multiple copies and determining the arrangements of letters in envelopes such that no letter is correctly placed. The scope includes mathematical reasoning and problem-solving strategies related to combinations and permutations.

Discussion Character

  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes a formula for the first problem as m*(m+n) but later revises it to S=m*(n+m) if m>n and S=n*(n+m) if m
  • Another participant suggests that if n=1, the answer should be 2^m and questions the examples checked by others.
  • A different participant argues that for each book, there are (n+1) possibilities, leading to a formula of (n+1)^m, with a caveat about the empty selection.
  • Concerns are raised about the validity of including the empty selection in the total count of combinations.
  • Discussion on the second problem references the inclusion-exclusion principle, with one participant explaining the relationship between events where letters are correctly or incorrectly placed.
  • Questions arise about the logic behind considering the empty selection as a valid choice and inquiries about the inclusion-exclusion principle and where to learn more about it.

Areas of Agreement / Disagreement

Participants express differing views on the correct approach to the first problem, particularly regarding the inclusion of the empty selection and the application of formulas. The second problem also generates discussion about the inclusion-exclusion principle, indicating that multiple competing views remain on both problems.

Contextual Notes

Participants have not reached consensus on the formulas for the first problem, and there are unresolved questions about the treatment of the empty selection. The discussion also highlights varying levels of familiarity with combinatorial principles.

xt
Messages
10
Reaction score
0
I got this two problems, I can't figure them out...

A bookshelf contains m different books and n copies of each. How many different selections can be made from them?

and

In how many different ways can four letters be posted in four envelopes so that no one receives the correct letter?
 
Physics news on Phys.org
xt said:
I got this two problems, I can't figure them out...

A bookshelf contains m different books and n copies of each. How many different selections can be made from them?

and

In how many different ways can four letters be posted in four envelopes so that no one receives the correct letter?
for the first question maybe it is:
m*(m+n)

but i only checked it for two specific cases.


edit:
after checking again i think the answer should be:
if m>n than S=m*(n+m)
if m<n than S=n*(n+m)
 
Last edited:
If n=1, then the answer ought to be 2^m, so which examples did you check?
 
1. For each book, you can take 0 of that book, or 1 of that book, ..., or n of that book. That is (n+1) possibilities. Since we have m books, the formula is (n+1)(n+1)(n+1)...(n+1) m times, or (n+1)^m.

One of the possibilities is that we select 0 of every book, so if "none of the books" is not a valid selection, then it is (n+1)^m - 1.
 
Last edited:
matt grime said:
If n=1, then the answer ought to be 2^m, so which examples did you check?
i didnt try it for n=1.
the cases are:
m=2 n=3
and m=2 n=4
perhaps the flaw is i should have put in the second case m different than 2.
bougar :frown:
 
matt grime said:
If n=1, then the answer ought to be 2^m, so which examples did you check?
i tried with n=1 and m=2 and here are the combinations i got:
(1,1)
(1,0)
(0,1)
if you put it in your formula it equals to 2^2=4 which is one combination more than in reality.

(unless you include (0,0) a selection which i haven't included in my two examples).
 
The empty selection is always a selection.

pig's answer is correct assuming that the wording implies that picking anyone of the n copies is the same event as picking any of the other of the n copies.


The second question follows from the inc-exc principle.

Let V_n be the event that the nth person gets the right letter, U_n the even they don't

Then doing the event you want is the intersection of the V_i which is the complement of the union of the U_i, which can be found using inclusion exclusion
 
Last edited:
matt grime said:
The empty selection is always a selection.
whats the logics behind this? why do you assume its a selection first then after the solution is done minus it off and say its not a valid selection?

matt grime said:
inc-exc principle.
what is that? where can i learn this stuff from? elementary probability?
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 31 ·
2
Replies
31
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K