There are 10 candidates for an examination out of which 4 are appearing in Mathematics and remaining 6 are appearing indifferent subjects. In how many ways can they be seated in a row so that no two Mathematics candidates are together?

Explanation

To solve the problem of seating 10 candidates in a row such that no two Mathematics candidates are together, we can follow these steps:

### Step 1: Arrange the Non-Mathematics Candidates
First, we arrange the 6 candidates who are not appearing for Mathematics. The number of ways to arrange these 6 candidates is given by the factorial of the number of candidates:

\[ 6! = 720 \]
...