Help: Perms and combs (1 Viewer)

[leehuan]

Can't find the trick.

 

[Carrotsticks]

Hint: For every choice of three cards, there exists exactly one permutation where the numbers are descending.

 

[Drsoccerball]

Can't find the trick.

Is the answer 1/4

 

[InteGrand]

Is the answer 1/4

Simply 1/3! = 1/6.

 

[leehuan]

Hint: For every choice of three cards, there exists exactly one permutation where the numbers are descending.

Wow. Golden. Thanks.

 

[InteGrand]

Wow. Golden. Thanks.

Or, given any hand, there's 3! = 6 ways to order them, and exactly one is in descending order, so 1/6.

 

[leehuan]

Or, given any hand, there's 3! = 6 ways to order them, and exactly one is in descending order, so 1/6.

Yep that makes sense too. I completely overlooked that only one option out of 6 is in descending order.

 

[leehuan]

Just going to post my next question in this original thread..
________________________________________________
My friend gave me this question and I'm stumped again.


Oh and 0 can be the first number.

 

[rand_althor]

Do you know the answer? I'm getting 5860.

 

[leehuan]

Nope, he made it up.

Sorry also 0 can be the first number. But otherwise mind showing working?

 

[kawaiipotato]

I got 549 but I'm not confident with this. nevermind, it's definitely wrong if 0 can be the first number
I got 670 including 0 as first number

 

[rand_althor]

Oh, well here's what I did:
Case 1: 4 unique numbers (1234)
10*9*8*7 = 5040. 10 numbers for the first (0-9), 9 for the second (0-9 excluding the first number) etc.
Case 2: 2 unique numbers (1123)
10*1*9*8 = 720
Case 3: 1 unique numbers (1112)
10*1*1*9 = 90
Case 4: 0 unique numbers (1111)
10*1*1*1 = 10

In total: 5040 + 720 + 90 + 10 = 5860 combinations.

Edit: Didn't know 0 could be the first number. Fixed now.

 

[leehuan]

Oh, well here's what I did:
Case 1: 4 unique numbers (1234)
9*9*8*7 = 4536. 9 numbers for the first (1-9, assuming 0123 is not a 4 digit number), 9 for the second (0-9 excluding the first number) etc.
Case 2: 2 unique numbers (1123)
9*1*8*7 = 504
Case 3: 1 unique numbers (1112)
9*1*1*8 = 72
Case 4: 0 unique numbers (1111)
9*1*1*1 = 9

In total: 4536 + 504 + 72 + 9 = 5121 combinations.

Hm, so if 0 can be the first number would you just replace 9->10, 8->9 and 7->8?

And 2 x 2 unique numbers what about those?

 

[rand_althor]

Hm, so if 0 can be the first number would you just replace 9->10, 8->9 and 7->8?

And 2 x 2 unique numbers what about those?

Yep I changed it.

My bad, didnt consider that case:

Case 5: 2 pairs of unique numbers (1122)
10*1*9*1 = 90

Total ways = 5860 + 90 = 5950 combinations.

 

[leehuan]

Coolio. I'll assume that is true until if someone like InteGrand corrects you. Thanks

 

[leehuan]

Hang on. If the order doesn't matter, take case 1 is there any need to divide by 4! ?

 

[Zlatman]

I got 715, I think the 5950 accounts for the order of the number, which we don't need to worry about.

No repeated numbers: 10C4 = 210 (pick any 4 from the 10)
2 unique numbers: 9C2 x 10 = 360 (pick one from the 10 to have 2 digits, then pick 2 from the remaining 9)
1 unique number: 10 x 9 = 90 (pick one from the 10 to have 3 digits, then pick one of the remaining 9)
No unique number: 10 = 10 (pick one of the 10 to have 4 digits)
Two pairs of repeated numbers: 10C2 = 45 (pick two of the 10 to have 2 digits)

Total numbers = 715

 

[InteGrand]

Just going to post my next question in this original thread..
________________________________________________
My friend gave me this question and I'm stumped again.


Oh and 0 can be the first number.

 

[leehuan]

Would not have thought about using stars and bars for this. That interpretation is correct. But how come it doesn't agree with Ziatman?

 

[Zlatman]

Would not have thought about using stars and bars for this. That interpretation is correct. But how come it doesn't agree with Ziatman?

My answer was wrong, but I fixed it. For the last case, I assumed there was order (which I was correcting rand for, lol).