Timeline for Discrete logarithm and the sequence $a(n)=(g^n \bmod p)^{p-1} \bmod p^2$
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 9, 2021 at 14:59 | answer | added | Max Alekseyev | timeline score: 1 | |
| S Apr 29, 2021 at 13:07 | history | bounty ended | CommunityBot | ||
| S Apr 29, 2021 at 13:07 | history | notice removed | CommunityBot | ||
| Apr 23, 2021 at 13:16 | comment | added | joro | @DavidESpeyer I am mainly interested in the relation with the discrete logarithm modulo p. Also curious what part of the multiplicative structure survive mixing the moduli. | |
| Apr 23, 2021 at 11:42 | comment | added | David E Speyer | Why would you study that operation? | |
| Apr 23, 2021 at 8:19 | history | edited | joro | CC BY-SA 4.0 |
addressed comments, added link
|
| Apr 23, 2021 at 4:24 | comment | added | joro |
@DavidESpeyer By mod p I don't mean congruence, but the reduction modulo $p$ operator. $A \bmod p$ is integer in the range [0,p-1], which breaks your example.
|
|
| Apr 22, 2021 at 18:33 | comment | added | David E Speyer | What does $(x \bmod p)^{p-1} \bmod p^2$ mean?. If $x_1 \equiv x_2 \bmod p$, we do not necessarily have $x_1^{p-1} \equiv x_2^{p-1} \bmod p^2$. | |
| S Apr 21, 2021 at 10:55 | history | bounty started | joro | ||
| S Apr 21, 2021 at 10:55 | history | notice added | joro | Draw attention | |
| Apr 21, 2021 at 10:54 | comment | added | joro | @MaxAlekseyev for g=2 I have stronger conjecture, check: mathoverflow.net/questions/390761/… | |
| Apr 18, 2021 at 16:20 | comment | added | joro | @MaxAlekseyev For p=10^100+267 and 1000 random pairs D(n),D(n+1) the probability is about 1/2. | |
| Apr 18, 2021 at 15:11 | comment | added | joro | @MaxAlekseyev I don't have rigorous statistics. I fix $g=2$ and p random prime. Then I compute D(i) for i in the range of first few hundreds. It works for random $i$ too. | |
| Apr 18, 2021 at 14:48 | comment | added | Max Alekseyev | How do you measure probability in 4? Over $n$ or $p$, or both? | |
| Apr 18, 2021 at 14:40 | history | edited | joro | CC BY-SA 4.0 |
DL modulo p
|
| Apr 18, 2021 at 11:56 | history | edited | LSpice | CC BY-SA 4.0 |
\mod -> \bmod (better spacing)
|
| Apr 18, 2021 at 11:44 | history | asked | joro | CC BY-SA 4.0 |