Correct Combination Thought Logic Being Followed

  • Context: Undergrad 
  • Thread starter Thread starter iamhumble
  • Start date Start date
  • Tags Tags
    Combination Logic
Click For Summary

Discussion Overview

The discussion revolves around a probability problem involving the assignment of treatments to laboratory mice. Participants explore the combinatorial logic required to determine the number of ways to assign two drugs and a control treatment to a group of 60 mice, addressing potential miscalculations and logical errors in the approach.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant initially calculates the number of ways to assign drug A to 22 mice from a total of 60, using the formula n! / r!(n-r) and arrives at a very large number, expressing concern about its validity.
  • Another participant confirms that the initial calculation for drug A is acceptable but prompts further inquiry into the assignment of the remaining mice.
  • A subsequent response provides calculations for the number of ways to assign drug B and the control group, but the participant expresses doubt about the correctness of these numbers.
  • One participant points out a logical error in the approach, noting that mice cannot be assigned to both drug A and drug B simultaneously, which leads to a reconsideration of the counting method.
  • A later reply introduces the concept of using bits to represent the assignment of treatments, suggesting a different perspective on the size of the numbers involved.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the correct method for calculating the total number of assignments. There are competing views on the validity of the initial calculations and the logic behind the assignment process.

Contextual Notes

Participants highlight the importance of avoiding double counting when assigning treatments and the need to adjust the total number of mice available for subsequent assignments. The discussion reflects uncertainty regarding the correct combinatorial approach.

Who May Find This Useful

Readers interested in probability theory, combinatorial mathematics, or those seeking to understand common pitfalls in assignment problems may find this discussion relevant.

iamhumble
Messages
28
Reaction score
0
For fun this semester I decided to take a probability class and doing a lot of the random problems from the book to learn the material. I am finding that sometimes I am over complicating some of these problems.

Here is a problem I came across. When I punched in the numbers it didn't seemed valid to me. Unfortunately, the book being used doesn't have odd or even answers in the back of the book.

The problem says.

"Two new drugs are to be tested using a group of 60 laboratory mice, each tagged with a number for identification purposes. Drug A is to be given to 22 mice, drug B is to be given to another 22 mice, and the remaining 16 mice are to be used as controls. How many ways can the assignment of treatments to mice be made? A single assignment involves specifying the treatment for each mouse -- whether drug A, drug B or no drug."


My logic.

I asked myself how many different ways can drug A be taken? I say that 22 mice have to be given it and there are 60 mice total. To mean, that means taking n! / r!(n-r)!

n is 60
r is 22

Using these values I get this

14,154,280,149,473,100

Seeing that number sent red flags here.


Is my logic faulty here? I think it is but looking for some reassurance from others. Thanks.
 
Physics news on Phys.org
That looks fine. Now how many ways can the remaining mice be assigned?
 
Last edited:
Really, this is fine? If it is that number just amazes me.

CRGreathouse,

Using my logic here is my response.

There are 14,154,280,149,473,100 ways for 22 unique mice to use drugA.
There are 14,154,280,149,473,99 ways for 22 unique mice to use drugB.
There are 1.49608 X 10^14 ways for 16 unique mice to use no drugs.

Given this I need to add up all these numbers.

However, these numbers still don't seem right to me. I am still working on this problem.
 
Your answer is not correct. You first choose 22 of 60 mice to assign to drug A... good. You then assign any of the 60 to drug B... not so good. Some mice are being assigned two drugs!


As far as the largeness of the numbers is concerned, you can think of things in terms of the information needed to specify the assignment. A bit can store 2 different values. If there were 2 groups that each mouse could be assigned to (and you could have any number of mice in either group) then it would take 60 bits to specify which assignment was chosen since there are 2^60 ways to assign them. In your case it takes lg(14,154,280,149,473,100) = 53.6... bits to specify which 22 of 60 mice are assigned to drug A. So if 14,154,280,149,473,100 seems large, instead think about 54 bits (7 bytes). Does that seem reasonable?
 
Oh, I see now.

- 22 mice for drug A
- then when i do drug B I can only use 38 (for n) to prevent double counting
- then when i do no drugs I have to use 18 (for n)

Yes, you bit example seems very reasonable. Thanks.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 30 ·
2
Replies
30
Views
4K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K