Well whenever you have conditions like these specified, try to consider them first as the others slots do not have any restrictions, so that we could directly do (8*7*6*5) as I did, in this case since repetition is not allowed we need to consider a lot of cases separately which would make it complicated (the way you're trying to solve)
So as a rule try to solve for given conditions (constraints) first and then you could solve for the remaining without any limitations.
Also note, any 6 digit integer without repetition can be formed in (9*9*8*7*6*5) ways = 136080.
You can clearly see options C,D and E are greater than this. We are definitely looking at an choice lesser than 136080. Hope it makes sense!!
HSPA wrote:I got differnet answer from B.. Please confirm my approach shankar (Thanks for your support)
P is for position:
P1: 5 ways
P2: 9
P3: 8
P4: 7
P5: 6
P6: 1 or 2 or 3 or 4 or 5
positions P2 till P5 can occupy 4 odd numbers or 4 even numbers
--if p2 to P5 has 4 odd numbers P6 has 5 even numbers to choose 1 out of it
--if p2 to p5 has 4 even number P6 has only 1 number to choose.