Chapter 1: Problem 12
Use de la Loubère's method to construct a magic square of order \(9 .\)
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 12
Use de la Loubère's method to construct a magic square of order \(9 .\)
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
Let \(a\) and \(b\) be positive integers with \(a\) a factor of \(b .\) Show that an \(m\) -by- \(n\) board has a perfect cover by \(a\) -by-b pieces if and only if \(a\) is a factor of both \(m\) and \(n\) and \(b\) is a factor of either \(m\) or \(n .\) (Hint: Partition the \(a\) -by-b pieces into a 1-by-b pieces.)
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.
(a) Does there exist a magic hexagon of order 2 ? That is, is it possible to arrange the numbers \(1,2, \ldots, 7\) in the following hexagonal array so that all of the nine "line" sums (the sum of the numbers in the hexagonal boxes penetrated by a line through midpoints of opposite sides) are the same? (b) " Construct a magic hexagon of order 3 ; that is, arrange the integers \(1,2, \ldots, 19\) in a hexagonal array (three integers on a side) in such a way that all of the fifteen "line" sums are the same (namely, 38 ).
Construct a pair of orthogonal Latin squares of order \(4 .\)
A game is played between two players, alternating turns as follows: The game starts with an empty pile. When it is his turn, a player may add either 1,2, 3. or 4 coins to the pile. The person who adds the 100 th coin to the pile is the winner. Determine whether it is the first or second player who can guarantee a win in this game. What is the winning strategy?
What do you think about this solution?
We value your feedback to improve our textbook solutions.