mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 3 of 3 Search took 0.00 seconds. Search: Posts Made By: science_man_88
 2018-09-22, 00:12 Replies: 7 Views: 6,107 Posted By science_man_88 If the order of 3 has to divide both, then it... If the order of 3 has to divide both, then it divides their gcd . Which means factors of p-1 coprime with n, need to divide ord(-k) mod p to be the ord(3) mod p. Which for someone stupid like me...
 2018-09-19, 17:30 Replies: 7 Views: 6,107 Posted By science_man_88 here's how I got what I did: 3^n+k\equiv 0... here's how I got what I did: 3^n+k\equiv 0 \bmod p; 3^n\equiv -k \bmod p; (3^n)^{ord(-k)}\equiv 3^{n* ord(-k)}\equiv -k^{ord(-k)}\equiv 1\bmod p I realize now this needs to divide by the order of...
 2018-09-19, 15:42 Replies: 7 Views: 6,107 Posted By science_man_88 https://primes.utm.edu/notes/proofs/MerDiv.html ... https://primes.utm.edu/notes/proofs/MerDiv.html allows us to use the first step 3^n\equiv -k \bmod p which gets us that the order of -k mod p times n either divides or is divisible by the order of 3...
 Showing results 1 to 3 of 3

All times are UTC. The time now is 09:34.

Fri Dec 3 09:34:04 UTC 2021 up 133 days, 4:03, 0 users, load averages: 1.52, 1.30, 1.23

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.