Exist matrix A and matrix B. A=power(B, n). How can I found n?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Exist matrix A and matrix B. A=power(B, n). How can I found n?
Name |
---|
Auto comment: topic has been translated by NekoKarp (original revision, translated revision, compare)
Are A and B over real numbers or integers modulo a prime? If they are over integers modulo a prime then this is at least as hard to calculate as discrete logarithm modulo a prime, i.e. pretty hard.
I don't know a solution but here are some properties that would make this problem easy: