I\'m trying to do an exercise from this book: http://introcs.cs.princeton.edu/ja
ID: 3758062 • Letter: I
Question
I'm trying to do an exercise from this book: http://introcs.cs.princeton.edu/java/24percolation/
Write a program that takes N from the command line and creates an N- by-N matrix with the entry in row i and column j set to true if i and j are relatively prime, then shows the matrix on the standard drawing (see Exercise 1.4.13). Then, write a similar program to draw the Hadamard matrix of order N (see Exercise 1.4.25) and the matrix such with the entry in row N and column j set to true if the coefficient of x^k in (1+x)^N (binomial coefficient) is odd (see Exercise 1.4.322). You may be surprised at the pattern formed by the latter.
Explanation / Answer
String[] deck = new String[ranks.length * suits.length];