Question 2
Context: Look at the following numbers: . They are arranged such that each pair of adjacent numbers adds up to a square: , , , .
Q. Can you do the same with numbers from to (again, without repetition), but this time arranging all the numbers in a circle?

- We need to arrange all numbers from to (each used exactly once) in a circle.
- Every pair of adjacent numbers in the circle must add up to a perfect square.
- Since the arrangement is circular, the first and last numbers in the sequence must also add up to a perfect square.
Step 1 · Identify Possible Perfect Square Sums
The minimum sum of two distinct numbers is . The maximum sum of two distinct numbers is .
The perfect squares between and are:
Thus, each adjacent pair must sum to one of: .
Step 2 · Construct the Circular Arrangement
By analyzing the possible square-sum connections for each number from to , we can form a continuous loop.
A valid circular sequence of the numbers is:
Verifying adjacent pair sums:
Yes, they can be arranged in a circle as:
- Forgetting the Circular Condition: Ensure the last number () and the first number () also add up to a square ().
- Duplicate or Missing Numbers: Each integer from to must appear exactly once.
- Ignoring Constrained Numbers: Numbers with only two valid square partners (such as ) must be placed adjacent to their exact paired neighbors.
More questions in A
Context: Look at the following numbers: 3 6 10 15 1. They are arranged such that each pair of adjacent numbers adds up to a square: , , , .
Q. Try arranging the numbers 1 to 17 (without repetition) in a row in a similar way — the sum of every adjacent pair of numbers should be a square. Can you arrange them in more than one way? If not, can you explain why?
Context: Look at the following numbers: . They are arranged such that each pair of adjacent numbers adds up to a square: , , , .
Q. Can you do the same with numbers from to (again, without repetition), but this time arranging all the numbers in a circle?