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..
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.