Chapter 10: Problem 7
Compute the addition table and multiplication table for the integers mod 6 .
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 10: Problem 7
Compute the addition table and multiplication table for the integers mod 6 .
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
Construct a completion of the 3 -by- 7 Latin rectangle $$\left[\begin{array}{lllllll}0 & 1 & 2 & 3 & 4 & 5 & 6 \\ 2 & 3 & 0 & 6 & 5 & 4 & 1 \\\1 & 4 & 6 & 0 & 2 & 3 & 5 \end{array}\right] .$$
Let \(B\) be a BIBD with parameters \(b, v, k, r, \lambda\) whose set of varieties is \(X=\) \(\left\\{x_{1}, x_{2}, \ldots, x_{v}\right\\}\) and whose blocks are \(B_{1}, B_{2}, \ldots, B_{b} .\) For each block \(B_{i}\), let \(\overline{B_{i}}\) denote the set of varieties which do not belong to \(B_{i} .\) Let \(\mathcal{B}^{c}\) be the collection of subsets \(\overline{B_{1}}, \overline{B_{2}}, \ldots, \overline{B_{b}}\) of \(X\). Prove that \(\mathcal{B}^{\mathrm{c}}\) is a block design with parameters $$b^{\prime}=b, v^{\prime}=v, k^{\prime}=v-k, r^{\prime}=b-r, \lambda^{\prime}=b-2 r+\lambda$$ provided that we have \(b-2 r+\lambda>0 .\) The \(\mathrm{BIBD} B^{c}\) is called the complementary design of \(\mathcal{B}\).
Let \(A\) be a Latin square of order \(n\) for which there exists a Latin square \(B\) of order \(n\) such that \(A\) and \(B\) are orthogonal. \(B\) is called an orthogonal mate of \(A\). Think of the 0 in \(A\) as rooks of color red, the is as rooks of color white, the 2x as rooks of color blue, and so on. Prove that there are \(n\) nonattacking rooks in \(A\), no two of which have the same color. Indeed, prove that the entire set of \(n^{2}\) rooks can be partitioned into \(n\) sets of \(n\) nonattacking rooks each, with no twu rooks in the same set having the same color.
Let \(B\) be a difference set in \(Z_{n}\). Show that, for each integer \(k\) in \(Z_{n}, B+k\) is also a difference set. (This implies that we can always assume without loss ol generality that a difference set contains 0 for, if it did not, we can replace it by \(B+k\), where \(k\) is the additive inverse of any integer in \(B .\) )
Show that a \(\mathrm{BIBD}\), with \(v\) varieties whose block size \(k\) equals \(v-1\), does not have a complementary design.
What do you think about this solution?
We value your feedback to improve our textbook solutions.