Problem #PRU-65603

Problems Methods Examples and counterexamples. Constructive proofs Invariants and semi-invariants Calculus Number sequences

Problem

At a contest named “Ah well, monsters!”, 15 dragons stand in a row. Between neighbouring dragons the number of heads differs by 1. If the dragon has more heads than both of his two neighbors, he is considered cunning, if he has less than both of his neighbors – strong, the rest (including those standing at the edges) are considered ordinary. In the row there are exactly four cunning dragons – with 4, 6, 7 and 7 heads and exactly three strong ones – with 3, 3 and 6 heads. The first and last dragons have the same number of heads.

a) Give an example of how this could occur.

b) Prove that the number of heads of the first dragon in all potential examples is the same.