Here's the question.
Starting with an integer a≥2, we write on its left, below it, the number a+1, and on its right, below it, the number a^2, and obtain four numbers, to which we continue the process. We thus obtain a binary tree, whose root is a. Prove that the numbers in every line of the...