Question

Consider n^(2) unit squares in the xy -plane centred at point (i j) with integer coordinates 1<=i<=n 1<=j<=n .It is required to colour each unit square in such a way that when ever 1<=i<j<=n and 1<=k<ell<=n the three squares with centres at (i k) (j k) (j ell) have distinct colours.What is the least possible number of colours needed? Suppose that in the Cartesian plane n^(2) इकाई-वर्ग (प्रत्येक Area of 1 है) Whose centers are given (i j ) हैं जहाँ 1<=i<=n

​

Answer 1

Answer:

I don't understand................................