Difference between revisions of "Latin square"
(New page: A '''Latin square''' is an <math>n \times n</math> table filled with <math>n</math> copies of each of the integers between <math>1</math> and <math>n</math> in such a way that each row...) |
Jadon jung (talk | contribs) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | A '''Latin square''' is an <math>n \times n</math> table filled with <math>n</math> copies of each of the [[integer]]s between <math>1</math> and <math>n</math> in such a way that each row and column contains exactly one copy of each integer. | + | A '''Latin square''' of size <math>n</math> is an <math>n \times n</math> table filled with <math>n</math> copies of each of the [[integer]]s between <math>1</math> and <math>n</math> in such a way that each row and column contains exactly one copy of each integer. |
The problem of counting the number of Latin squares of size <math>n</math> seems to be extremely difficult. | The problem of counting the number of Latin squares of size <math>n</math> seems to be extremely difficult. | ||
| + | ==Examples== | ||
| + | The Sudoku puzzle is an example of a latin square | ||
{{stub}} | {{stub}} | ||
Latest revision as of 11:50, 3 May 2023
A Latin square of size 
is an 
table filled with copies of each of the integers between 
and in such a way that each row and column contains exactly one copy of each integer.
The problem of counting the number of Latin squares of size seems to be extremely difficult.
Examples
The Sudoku puzzle is an example of a latin square This article is a stub. Help us out by expanding it.
