mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2018-04-14, 05:21   #1
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

5108 Posts
Post Higher order Wierferich prime pairs

Suppose odd primes p and q are Wierferich prime pairs of order k if and only if:

p^(q-1) = 1 modulo q^k

q^k = 1 modulo p

where p ≠ 1 modulo q, q ≠ 1 modulo p, or equivalent restriction k > 1.

The first such pair (p,q) of order k = 2 is (3,11) because

3^10 = 1 modulo 11^2 and 11^2 = 1 modulo 3

The first pair of order k = 3 is (19,7) because

19^6 = 1 modulo 7^3 and 7^3 = 1 modulo 19

Which is the first such prime pair (p,q) or order k = 4, in other words primes p, q such that

p^(q-1) = 1 modulo q^4 and q^4 = 1 modulo p

It is easy to find any such primes p, q obviously is it not, but what are the smallest such primes?

What about orders k = 5, 6, 7 and so on?

It doesn't seem that easy to find such pairs as (3,11) k = 2 and (19,7) k = 3 are rare cases.
carpetpool is offline   Reply With Quote
Old 2018-04-14, 12:36   #2
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

23·103 Posts
Default

The more general case of b^(q-1)=1 mod q^k (that is, not requiring b to be prime and not requiring the second congruence) is studied under the name Fermat Quotients (among other names). Have you tried mining tables of these results for cases that satisfy your additional constraints? Google led me to this stackexchange post, from which I soon came to this list. If not directly useful, perhaps searching this subject will turn up additional ideas to help you.
wblipp is offline   Reply With Quote
Old 2018-04-15, 00:28   #3
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by carpetpool View Post
Suppose odd primes p and q are Wierferich prime pairs of order k if and only if:

p^(q-1) = 1 modulo q^k

q^k = 1 modulo p
When p and q are odd, we get the equivalents:

p^(q-1)= 1 mod 2(q^k)

and

q^k= 1 mod 2p

plugging the second into the first we have

p^(2jp-2)= 1 mod 2((2jp-2)^k)= (2l+1) mod 2p
So 0= 2l+1 mod 2p where p^(2jp-2)=2l((2jp-2)^k)+1. EDIT: yes I'm partially wrong, I originally assumed q=1 mod p contrary to carpetpools rules.

Last fiddled with by science_man_88 on 2018-04-15 at 11:18
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Counting Goldbach Prime Pairs Up To... Steve One Miscellaneous Math 8 2018-03-06 19:20
Article: First proof that infinitely many prime numbers come in pairs Paulie Twin Prime Search 46 2015-11-17 09:22
Order of 3 modulo a Mersenne prime T.Rex Math 7 2009-03-13 10:46
Conjecture about multiplicative order of 3 modulo a Mersenne prime T.Rex Math 9 2007-03-26 17:35
decimal-binary prime pairs ixfd64 Math 2 2003-10-16 13:40

All times are UTC. The time now is 20:25.


Fri Dec 3 20:25:45 UTC 2021 up 133 days, 14:54, 0 users, load averages: 1.00, 1.17, 1.13

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.