Problem #PRU-110103

Problems Number Theory Divisibility Division with remainders. Arithmetic of remainders Arithmetic of remainders Methods Pigeonhole principle Pigeonhole principle (other)
 12–14  4.0

Problem

Is it possible to arrange the numbers 1, 2, ..., 60 in a circle in such an order that the sum of every two numbers, between which lies one number, is divisible by 2, the sum of every two numbers between which lie two numbers, is divisible by 3, the sum of every two numbers between which lie six numbers, is divisible by 7?