Finding Squares in a Square Box: n > 1

Anita6363 · Oct 31, 2018

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.

Wilmer · Oct 31, 2018

I get a headache reading that...
can you PLEASE post an example...merci beaucoup...

Finding Squares in a Square Box: n > 1

Discussion

Undergrad Is infinity a necessary concept?

High School Ant on a stretchy rope puzzle

High School Potato paradox

Undergrad Descartes’ Geometry of Square Roots

High School Three Squares Problem

Mathematica NDSolve with forcing function via "digital waveguide"

MATLAB Unable to produce desired results using state-space model with observer for inverted pendulum

Insights Revisiting the Velocity-Time Function

Insights Remote Operated Gate Control System

Insights AI Enriched Problem Solving

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Finding Squares in a Square Box: n > 1

Discussion

Similar threads

Undergrad Can New Theorems Predict Incomplete 5x5 Magic Square Solutions?

Undergrad A formula for the number of structures composed of n squares

Finding Perfect Squares with $n^4 + 33$

High School Combinatorics and Magic squares

Graduate Lagrange's Four-Square Theorem: 8n-1 Sum of 4 Squares?

An integer n>1 is square-free if and only if?

Every integer n>1 is the product of a square-free integer?

How Do You Determine the Number of Toothpicks in a Stack of Squares?

Undergrad Find Out How Many Combinations of n Squares Exist

Graduate Number of squares in a grid of dots.