In how many ways can one write the numbers 1, 2, 3, 4, 5, and 6 in a row so that given any number in the row, all of its divisors (not including itself) are not adajcent to it?
i think 25 man
