MHB Finding Squares in a Square Box: n > 1

Click For Summary
The discussion focuses on identifying integers n greater than 1 for which an n x n square can be filled with distinct integers, ensuring that the sums of each row and column are perfect squares and all 2n sums are unique. Participants express confusion about the problem's complexity and request examples for clarity. An example is needed to illustrate the concept effectively. The challenge lies in both the mathematical constraints and the uniqueness of the sums. Clear examples would greatly aid understanding of this intricate problem.
Anita6363
Messages
2
Reaction score
0
Determine all integers n> 1, for which in the square box of dimensions (n x n) you can enter different squares of integers, so that the sum of numbers in each row and in each column of the array is a square of an integer, and all the 2n sums are different.
 
Mathematics news on Phys.org
I get a headache reading that...
can you PLEASE post an example...merci beaucoup...
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 68 ·
3
Replies
68
Views
11K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
3
Views
2K
Replies
8
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K