Menu Close

A-matrix-has-N-rows-and-2k-1-columns-Each-column-is-filled-with-M-ones-and-N-M-zeros-A-given-row-j-is-cool-if-and-only-if-i-1-2k-1-a-ji-k-Find-the-minimum-and-the-maximum-number-of-c




Question Number 19547 by dioph last updated on 12/Aug/17
A matrix has N rows and 2k−1   columns. Each column is filled with  M ones and N−M zeros.  A given row j is “cool” if and only if  Σ_(i=1) ^(2k−1) a_(ji)  ≥ k. Find the minimum and  the maximum number of cool rows  for given N, k and M.
AmatrixhasNrowsand2k1columns.EachcolumnisfilledwithMonesandNMzeros.Agivenrowjiscoolifandonlyif2k1i=1ajik.FindtheminimumandthemaximumnumberofcoolrowsforgivenN,kandM.
Commented by dioph last updated on 12/Aug/17
For instance, if N=5, k=2, M=2   [(1,0,0),(1,0,0),(0,1,0),(0,1,1),(0,0,1) ]has 1 cool row (min)   [(1,1,0),(1,0,1),(0,1,1),(0,0,0),(0,0,0) ]has 3 cool rows (max)
Forinstance,ifN=5,k=2,M=2[100100010011001]has1coolrow(min)[110101011000000]has3coolrows(max)
Commented by dioph last updated on 31/Aug/17
anyone?
anyone?

Leave a Reply

Your email address will not be published. Required fields are marked *