If s is not even you can do nothing right? And your s is the exponent of the first element, where the mod is the same as for a previous element, correct? so for a=2 the mod series would be (start with s=0) 1,2,4,8,1 -> s = 4
2 роки тому+1
If s is not even, we need to change our "a" since it is determined by us with no methodology. We can find an "a" which has a period of "s" whose even.
If s is not even you can do nothing right?
And your s is the exponent of the first element, where the mod is the same as for a previous element, correct? so for a=2 the mod series would be (start with s=0) 1,2,4,8,1 -> s = 4
If s is not even, we need to change our "a" since it is determined by us with no methodology. We can find an "a" which has a period of "s" whose even.
It is not clear. you don't explain why it works. just the algorithm. not how it is accelerated by the quantum computing,