Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 1 - Section 1.8 - Proof Methods and Strategy - Supplementary Exercises - Page 112: 19

Answer

$\bigwedge_{i=1}^{16} \wedge_{n=1}^{16} \vee_{j=1}^{16} p(i, j, n)$ $\bigwedge_{i=1}^{16} \wedge_{n=1}^{16} \vee_{j=1}^{16} p(i, j, n)$ $\bigwedge_{r=0}^{4} \wedge_{s=0}^{4} \wedge_{n=1}^{16} \mathrm{V}_{i=1}^{4} \mathrm{V}_{j=1}^{4} p(4 r+i, 4 s+j, n)$ $p(i, j, n) \rightarrow \neg p\left(i, j, n^{\prime}\right)$

Work Step by Step

Given: $16$ x $16$ Sudoku puzzle (which contains every integer from $1$ to $16$ in each row, column, and $4$ x block). Let $p (i, j, n)$ represent the cell in row $i$ and column $j$ and that has the value $n$ ($n$ is thus an integer between $1$ and $16$, inclusive). Every row needs to contain every number between $1$ and $16$.There are $16$ rows and $16$ columns. $\bigwedge_{i=1}^{16} \wedge_{n=1}^{16} \vee_{j=1}^{16} p(i, j, n)$ Every column needs to contain every number between $1$ and $16$.There are $16$ rows and $16$ columns. $\bigwedge_{i=1}^{16} \wedge_{n=1}^{16} \vee_{j=1}^{16} p(i, j, n)$ Every $4 x 4$ block contains every number between $1 $and$ 4$. $\bigwedge_{r=0}^{4} \wedge_{s=0}^{4} \wedge_{n=1}^{16} \mathrm{V}_{i=1}^{4} \mathrm{V}_{j=1}^{4} p(4 r+i, 4 s+j, n)$ Finally, no cells contain more than one number: $p(i, j, n) \rightarrow \neg p\left(i, j, n^{\prime}\right)$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.