Printable View
This is meant to be a very simple question and i am sure it is however once a few of us have come togther to share answers there has been a disagreement so we needed some help.
Q) Find in how many ways three distinct numbers can be chosen from
{1,2,3,4,5,6,7,8,9,10}
so that no two are consectutive..
How many ways are there to arrange the string '1110000000' so no two 1's are together?Quote:
Originally Posted by lat87
You could have 0100100001. That represents {2,5,10}.
You cannot have 0011001000. That represents {3,4,7}.
thankyou for taking the time to look over question.
i was just wondering..
the answer i have was 79 which i got using 120-48+7
if this correct?
once again many thanks
No. The answer is the one I gave.Quote:
Originally Posted by lat87
How many ways can a string of seven zeros and three one be arranged so no two ones are together.
_0_0_0_0_0_0_0_ there are eight places to put the 1's.
No use reposting the question, it was already solved a thread below. I made an arithmetic mistake prolly due to lack of coffee. The method however was correct and you can apply it yourself. Plato's method is also very valid and results in the same answer.