Skip to main content
removed unnecessary MathJax https://puzzling.meta.stackexchange.com/q/7421/
Source Link
bobble
  • 10.6k
  • 4
  • 34
  • 86

Suppose I have a $3*3$3 by 3 grid. Can you fill the grid with numbers from 1 to 9 in such a way that the product of each row corresponds to each column? Is this possible for any $n * n$n by n grid with numbers till $n^2$n2? If so, why? Is there an efficient algorithm to do it? Is there a formula? I want more mathematically inclined answers.

Suppose I have a $3*3$ grid. Can you fill the grid with numbers from 1 to 9 in such a way that the product of each row corresponds to each column? Is this possible for any $n * n$ grid with numbers till $n^2$? If so, why? Is there an efficient algorithm to do it? Is there a formula? I want more mathematically inclined answers.

Suppose I have a 3 by 3 grid. Can you fill the grid with numbers from 1 to 9 in such a way that the product of each row corresponds to each column? Is this possible for any n by n grid with numbers till n2? If so, why? Is there an efficient algorithm to do it? Is there a formula? I want more mathematically inclined answers.

grammar/punctuation
Source Link
Stevo
  • 3k
  • 1
  • 11
  • 36

Suppose I have a $3*3$ grid. Can you fill the grid with numbers from 1 to 9 in such a way that the product of each row corresponds to each column? Is this possible for any $n * n$ grid with numbers till $n^2$. Is? If so, why? Is there an efficient algorithm to do it? Is there a formula.? I want more mathematically inclined answers.

Suppose I have a $3*3$ grid. Can fill the grid with numbers from 1 to 9 in such a way that product of each row corresponds to each column? Is this possible for any $n * n$ grid with numbers till $n^2$. Is so, why? Is there an efficient algorithm to do it? Is there a formula. I want more mathematically inclined answers.

Suppose I have a $3*3$ grid. Can you fill the grid with numbers from 1 to 9 in such a way that the product of each row corresponds to each column? Is this possible for any $n * n$ grid with numbers till $n^2$? If so, why? Is there an efficient algorithm to do it? Is there a formula? I want more mathematically inclined answers.

Source Link

A curious magic square puzzle

Suppose I have a $3*3$ grid. Can fill the grid with numbers from 1 to 9 in such a way that product of each row corresponds to each column? Is this possible for any $n * n$ grid with numbers till $n^2$. Is so, why? Is there an efficient algorithm to do it? Is there a formula. I want more mathematically inclined answers.