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...
 

Similar threads

B Combinatorics and Magic squares
Replies
2
Views
2K
I Can New Theorems Predict Incomplete 5x5 Magic Square Solutions?
2
Replies
68
Views
11K
MHB Square Number Pairs from 1-50: Counting Rules
Replies
1
Views
1K
MHB Dimension of the cut-out squares that result in largest possible side area
Replies
3
Views
3K
MHB Compute $\sum_{n=1}^{2020} (f(n)-g(n))$
Replies
1
Views
1K
MHB Challenge problem #2 Show that 5φ^2n+4(−1)^n is a perfect square
Replies
3
Views
2K
Can distinct integers with 8 subsets of 3 always form a magic square?
Replies
8
Views
2K
I Why can't I reach every cell in a 3x3 square?
Replies
8
Views
3K
I Are there any two pairs of integers with the same result in a specific function?
Replies
7
Views
2K
MHB [Unsolved] How many "magic squares" (combinatorial)?
Replies
6
Views
2K