if a matrix of order nxn is given for every elements of a given row or column we could arrange it in 2 way (i,e either 1 or -1),but as the product across rows and column is 1,so we cannot arrange at least one element,which will be depending on the product of rest n-1 elements......so finally we can arrange n-1 elements in rows and also n-1 elements in column with 2 possibilities.so for us (n-1)(n-1) elements with each possibility of 2 arrangements,so total arrangements is 2^((n-1)^2).
On Jul 28, 11:06 am, 석문기 <smgs2...@gmail.com> wrote: > The problem is finding the subspaces that satisfy two conditions in the 6*6 > total space? > > 2011/7/28 vetri <natarajananitha...@gmail.com> > > > given a 6x6 matrix with all the elements as either 1 or -1. > > find the number of ways the elements can b arranged such that > > > 1.the product of all elements of all columns is 1 > > 2.the product of all elements of all rows is 1 > > > can u pls post the answer if u no... > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
