Combinatoric discussion

Sort:
Avatar of Jomsup
TheCosmos999 wrote:

In how many ways can 7 English men and 7 Americans sit down at a round table provided that no two Americans shall be together, I.e. their needs to be at least 1 English men between 2 subsequent Americans.

Note- different orientation don't count as distinct ways, that is when the same people are neighbour's.

The answer is 7!6! ways (about 3.63×10⁶)


Explain: Because of the same number of English and American people. So the English and American people had to sit 1-1 alternately.

I set the first Englishmen position. The remaining ones are then viewed as an arrangement on a straight line.

Permutate the remaining 6 Englishmen on their positions for 6! ways and 7 Americans for 7! ways. So, there is a permutation of all people 7!6! ways.

Avatar of Jomsup

Problem 7:

In a solid box there is set of white and black chess pieces, each color contains 8 pawns, 2 knights, 2 Bishops, 2 Rooks, 1 queen and 1 king. Find the probability of these events.

(1) Randomly pick 1 piece and get a minor piece.

(2) Randomly pick 2 pieces at the same time and get 2 pawns of different colors.

(3) Randomly pick 2 pieces one by one by picking and putting them back and get both minor and major pieces are of the same color.

Note: bishop and knight are minor pieces, rook and queen are major pieces.

Avatar of Jomsup
TheCosmos999 wrote:

Since there are 8 pawns of each colour, the the chance of getting, a pawn in the first place is 8/32 or 1/4 and then there are 31 pieces and 8 pawns of the opposite colour, so the chance of getting a pwan of the opposing colour after taking out a pawn is 8/31.

So its 8/31 of 8/32 = 8/124 = 1/15 + 1/2

Notice that the first pick It is not determined whether to pick white or black, so the probability of the first pawn is 16/32.

The probability of picking both times according to problem 2 is 8/31 × 16/32 = 4/31.

Avatar of Jomsup
TheCosmos999 wrote:

So now again getting minor or major pieces of that is again 7/16 but that includes the probability of getting major pieces pr minor pieces in succesion. So subtract thatthe probability of getting them in succesion is

6/32 × 3/32 + 8/32 × 4/32 = 18/1024 + 1/32

GREAT! thumbup

Avatar of Jomsup

Problem 8:

6 dices are rolled at the same time, find the probability that all dices will have different points.

Avatar of Lincoy3304

Would it be like going 6/6*5/6*4/6*3/6*2/6*1/6?

It seems to me to be so because the probability for each one not being a previously checked number decreases by 1/6.

If so, it’s 1.543%

Avatar of Jomsup

Yes!

number of event = 6!

number of sample space = 6⁶

So pobability is 6!/6⁶ = 5/324 ~ 0.0154

Avatar of Jomsup

Problem 9:

There are 9 different books, how many ways can be divided into 3 piles, 3 books each?

Avatar of Lincoy3304

It seems to me that a factorial would suffice. Although, if you want to consider each pile as it’s own entity and shuffle those around idk how to do that. Maybe you would just multiply it by 3 factorial.

Regardless, if my way is correct, the answer would be 362,880. If you want to include the 3 factorial part, it would be 2,177,280.

Avatar of Jomsup
Lincoy3304 wrote:

It seems to me that a factorial would suffice. Although, if you want to consider each pile as it’s own entity and shuffle those around idk how to do that. Maybe you would just multiply it by 3 factorial.

Regardless, if my way is correct, the answer would be 362,880. If you want to include the 3 factorial part, it would be 2,177,280.

If this problem is to find the number of permutations of all books, the answer is 9! you are correct

However, this problem is only focused on dividing the book into sections, 3 sections, ignoring internal permutations.

Avatar of Lincoy3304

What’s the new problem?

Avatar of Jomsup
TheCosmos999 wrote:

So we have 84 × 20 × 1 combinations, right? 84 = (80+4) so 84×20 = (8×10×2×10) + 2×4×10 = 1600+80 = 1680?

Almost right, since each pile had 3 equal books, there was no difference. So permutation of piles A,B,C does not occur. That makes the way to divide the group into 1680/3! = 280

Avatar of Jomsup
TheCosmos999 wrote:

Problem:10

Figure out the number of possible Relations from a set A to a Set b

Choose a domain from set A by n(A) ways.

Choose a range from set B by n(B) ways.

So, the total number of relations is n(A)×n(B).

Avatar of Jomsup

Problem 11:

Given the relative universe 𝕌 = {1,2,3,4} and A, B are subsets of 𝕌

If S = { (A,B) | n(A∩B)=2 } then find the number of elements of S.

Avatar of Jomsup
TheCosmos999 wrote:
JomsupVora2020 wrote:
TheCosmos999 wrote:

Problem:10

Figure out the number of possible Relations from a set A to a Set b

Choose a domain from set A by n(A) ways.

Choose a range from set B by n(B) ways.

So, the total number of relations is n(A)×n(B).

Iincorrrect!. It should be 2^ {n(A)×n(B)}. To illustrate let set A = { 1 , 3} and set B = { 2, 4}

The Distinct relations are as-

  1. R = NULL
  2. R = { (1,2)}
  3. R = { (1,4)}
  4. R= {(3,2)}
  5. R = {(3,4)}
  6. R = {(1,2),(3,4)
  7. R = {(1,2),(3,2)}
  8. R = {(1,4),(3,2)}
  9. R = {(1,4),(3,4)}
  10. R = {(1,2),(1,4)}
  11. R = {(3,2),(3,4)}
  12. R = {(1,2),(3,2),(3,4)}
  13. R = {(1,4),(3,2),(3,4)}
  14. R = {(1,2),(1,4),(3,2)}
  15. R = {(1,2),(1,4),(3,4)}
  16. R = {(1,2),(1,4),(3,2),(3,4)} 

so here we have it, 16 ( 2^(2×2)) relations

Thank you. I've always misunderstood the definition of "relation".

Relation from A to B is a set of ordered pairs (a, b) such that a ∈ A and b ∈ B.

Avatar of Jomsup
TheCosmos999 wrote:

Hoew many Bishops can you place on a chessboard (8×8) such that there ranges (the diagonals they cover) don't intersext

The answer is 14, see the solution here.

https://www.chess.com/clubs/forum/view/combinatoric-discussion?page=2#comment-83592549

Avatar of Jomsup
JomsupVora2020 wrote:

Theory 2.1

"Permutations of n objects on a line have n! different ways."


Theory 2.2

"Permutations of n objects on a circle have (n-1)! different ways."

Explain: To permutate n objects on a circle, we can fix the point of the first object because turning the first piece doesn't make a difference.

Then n-1 objects are viewed as linear arrangements because the remaining object positions are referenced to the first object.

The arrangement of n objects on a circle are 1×(n-1)! = (n-1)! ways.


Avatar of Jomsup

Problem 12:

Round table with 5 seats requires one type of food and drink to be served at each seat.

There are 5 different types of food and the drinks have the same 3 glasses of water and the same 2 glasses of tea, how many ways are there to serve the food and drink?


Hint : Consider the placement of the two tea cups. Then notice the rotation of the food position while maintaining the drink position. It will make the sorting format all different.

Avatar of Jomsup

Problem 13:

There are 3 pairs of socks in a box. Randomly pick 2 socks. Find the probability that both socks are the same pair.

Avatar of Jomsup

Problem 14:

How many ways can 4 couples sit around a round table? When each couple must sit next to each other.