Exist matrix A and matrix B. A=power(B, n). How can I found n?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
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: