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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|