MHB Arrangements of numbers-odd and even positions

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    even
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! :)

I am given the following exercise:
How many arrangements of the numbers $1,2,3, \dots, 2n-1,2n$ exist such that at the even positions there are only even numbers?
How many arrangements are there,such that at least at one position there is an even number? :confused:

Since, at the set $\{1,2,3, \dots, 2n-1,2n \}$,there are $n$ even numbers and $n$ odd ones,are there $n! \cdot n!$ arrangements,such that at the even positions there are only even numbers,right?

At the second subquestion,is it maybe $\binom{n}{1} \cdot (n-1)! \cdot n!$ ,or am I wrong? (Blush)
 
Physics news on Phys.org
evinda said:
Hello! :)

I am given the following exercise:
How many arrangements of the numbers $1,2,3, \dots, 2n-1,2n$ exist such that at the even positions there are only even numbers?
How many arrangements are there,such that at least at one position there is an even number? :confused:

Since, at the set $\{1,2,3, \dots, 2n-1,2n \}$,there are $n$ even numbers and $n$ odd ones,are there $n! \cdot n!$ arrangements,such that at the even positions there are only even numbers,right?

At the second subquestion,is it maybe $\binom{n}{1} \cdot (n-1)! \cdot n!$ ,or am I wrong? (Blush)

At the second subquestion,it is $(2n)!-n! \cdot n!$,right?
 
evinda said:
Hello! :)

I am given the following exercise:
How many arrangements of the numbers $1,2,3, \dots, 2n-1,2n$ exist such that at the even positions there are only even numbers?
How many arrangements are there,such that at least at one position there is an even number? :confused:

Since, at the set $\{1,2,3, \dots, 2n-1,2n \}$,there are $n$ even numbers and $n$ odd ones,are there $n! \cdot n!$ arrangements,such that at the even positions there are only even numbers,right?

At the second subquestion,is it maybe $\binom{n}{1} \cdot (n-1)! \cdot n!$ ,or am I wrong? (Blush)

evinda said:
At the second subquestion,it is $(2n)!-n! \cdot n!$,right?

Hi! ;)

If I take the question literally, there will always be a position where there is an even number, so that would be $(2n)!$ arrangements. :eek:

It seems there is a typo in the problem statement though.
Can it be that the question should be that at least at one even position there should be an even number? (Wondering)
 
I like Serena said:
Hi! ;)

If I take the question literally, there will always be a position where there is an even number, so that would be $(2n)!$ arrangements. :eek:

It seems there is a typo in the problem statement though.
Can it be that the question should be that at least at one even position there should be an even number? (Wondering)

Yes,that's what I meant..I forgot a word... (Lipssealed)
 
evinda said:
Yes,that's what I meant..I forgot a word... (Lipssealed)

Okay. Then it's all SOLVED I guess! (Whew)
 
I like Serena said:
Okay. Then it's all SOLVED I guess! (Whew)

Yes! (Party)
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Back
Top