I was wondering a problem: Is it possible to construct a n*n matrix (call it A) such that each number from 0 to n-1 appears exactly n times and the result of A*A is a zero matrix. I know it is obvious for odd n but how about even n?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
An interesting matrix problem
I was wondering a problem: Is it possible to construct a n*n matrix (call it A) such that each number from 0 to n-1 appears exactly n times and the result of A*A is a zero matrix. I know it is obvious for odd n but how about even n?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en10 |
|
anothermousey | 2023-01-24 18:10:52 | 8 | ||
| en9 |
|
anothermousey | 2023-01-24 18:10:13 | 0 | (published) | |
| en8 |
|
anothermousey | 2023-01-24 18:09:59 | 2 | (saved to drafts) | |
| en7 |
|
anothermousey | 2023-01-24 16:50:28 | 0 | (published) | |
| en6 |
|
anothermousey | 2023-01-24 16:50:09 | 2 | ||
| en5 |
|
anothermousey | 2023-01-24 14:42:32 | 1555 | (saved to drafts) | |
| en4 |
|
anothermousey | 2023-01-12 12:14:08 | 24 | Tiny change: 'lt of A*A is a zero' -> 'lt of A*A (matrix multiplication) is a zero' | |
| en3 |
|
anothermousey | 2023-01-12 12:09:40 | 4 | Tiny change: 'mber from 0 to n-1 appears e' -> 'mber from 1 to n appears e' | |
| en2 |
|
anothermousey | 2023-01-12 12:00:32 | 44 | ||
| en1 |
|
anothermousey | 2023-01-12 11:24:31 | 261 | Initial revision (published) |
| Name |
|---|


