Chapter 1: Problem 24
Find a general method for constructing a Latin square of order \(n\).
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 1: Problem 24
Find a general method for constructing a Latin square of order \(n\).
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Consider an \(n\) -by- \(n\) board and \(L\) -tetrominoes ( 4 squares joined in the shape of an L). Show that if there is a perfect cover of the \(n\) -by- \(n\) board with \(L\) -tetrominoes, then \(n\) is divisible by 4 . What about \(m\) -by- \(n\) -boards?
(a) Let \(f(n)\) count the number of different perfect covers of a 2 -by- \(n\) chessboard by dominoes. Evaluate \(f(1), f(2), f(3), f(4)\), and \(f(5) .\) Try to find (and verify) a simple relation that the counting function \(f\) satisfies. Use this relation to compute \(f(12)\). (b) * Let \(g(n)\) be the number of different perfect covers of a 3 -by-n chessboard by dominoes. Evaluate \(g(1), g(2), \ldots, g(6)\).
Show how to cut a cube, 3 feet on an edge, into 27 cubes, 1 foot on an edge, using exactly 6 cuts but making a nontrivial rearrangement of the pieces between two of the cuts.
Consider the following three-dimensional version of the chessboard problem: \(\mathrm{A}\) three-dimensional domino is defined to be the geometric figure that results when two cubes, one unit on an edge, are joined along a face. Show that it is possible to construct a cube \(n\) units on an edge from dominoes if and only if \(n\) is even. If \(n\) is odd, is it possible to construct a cube \(n\) units on an edge with a 1 -by- 1 hole in the middle? (Hint: Think of a cube \(n\) units on an edge as being composed of \(n^{3}\) cubes, one unit on an edge. Color the cubes alternately black and white.)
Let \(n\) be a positive integer divisible by 4 , say \(n=4 m\). Consider the following construction of an \(n\) -by-n array: (1) Proceeding from left to right and from first row to nth row, fill in the places of the array with the integers \(1,2, \ldots, n^{2}\) in order. (2) Partition the resulting square array into \(m^{2} 4\) -by-4 smaller arrays. Replace each number \(a\) on the two diagonals of each of the 4 -by-4 arrays with its "complement" \(n^{2}+1-a\). Verify that this construction produces a magic square of order \(n\) when \(n=4\) and \(n=8\). (Actually it produces a magic square for each \(n\) divisible by 4.)
What do you think about this solution?
We value your feedback to improve our textbook solutions.