Peter wishes to write down a list of different positive integers less than or equal to $10$ in such a way that for each pair of adjacent numbers one of the numbers is divisible by the other.
What is the length of the longest list that Peter could write down?
If you liked this problem, here is an NRICH task which challenges you to use similar mathematical ideas.