[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A105876 (Underlined text is an addition; strikethrough text is a deletion.)

newer changes | Showing entries 11-20 | older changes
A105876 Primes for which -4 is a primitive root.
(history; published version)
#26 by Jianing Song at Sat Dec 24 05:53:04 EST 2022
COMMENTS

An odd prime p is a term if and only if p == 3 (mod 4), and that the multiplicative order of 2 modulo p is p-1 or (p-1)/2 (p-1 is p == 3 (mod 8), (p-1)/2 if p == 7 (mod 8)).

{(a(n)-1)/2} is the sequence of indices of fixed points of A302141.

An odd prime p is a term if and only if p == 3 (mod 4), and that the multiplicative order of 2 modulo p is p-1 or (p-1)/2 (p-1 is p == 3 (mod 8), (p-1)/2 if p == 7 (mod 8)).

STATUS

proposed

editing

#25 by Jianing Song at Sat Dec 24 05:49:04 EST 2022
STATUS

editing

proposed

#24 by Jianing Song at Sat Dec 24 05:48:30 EST 2022
COMMENTS

Also primes p such that the multiplicative order of 16 modulo p is (p-1)/2. Proof: note that ord(16,p) = ord(-4,p)/gcd(ord(-4,p),2). If ord(-4,p) = p-1, then ord(16,p) = (p-1)/2. Conversely, if ord(16,p) = (p-1)/2, then ord(-4,p) = p-1, since otherwise ord(-4,p) = (p-1)/2 is odd, which is impossible since that -4 is not a quadratic residue modulo a prime p == 3 (mod 4).

CROSSREFS

Cf. A114564, A302141. A216371 is a supersequence.

STATUS

proposed

editing

#23 by Jianing Song at Sat Dec 24 05:39:43 EST 2022
STATUS

editing

proposed

Discussion
Sat Dec 24 05:41
Jianing Song: Why is 1 not included in A163778? By definition, 1 is an odd term in A054639!
#22 by Jianing Song at Sat Dec 24 05:38:57 EST 2022
COMMENTS

An odd prime p is a term if and only if p == 3 (mod 4), and that the multiplicative order of 2 modulo p is p-1 or (p-1)/2 (p-1 is p == 3 (mod 8), (p-1)/2 if p == 7 (mod 8)).

STATUS

proposed

editing

#21 by Jianing Song at Sat Dec 24 05:36:25 EST 2022
STATUS

editing

proposed

#20 by Jianing Song at Sat Dec 24 05:36:04 EST 2022
COMMENTS

From Jianing Song, Dec 24 2022: (Start)

Equivalently, primes p == 3 (mod 4) such that the multiplicative order of 4 modulo p is (p-1)/2 (a subsequence of A216371).

Proof of equivalence: Write ord(a,k) be the multiplicative of a modulo k. First we notice that all terms are congruent to 3 modulo 4, since -4 is a quadratic residue modulo p if p == 1 (mod 4). If ord(4,p) = (p-1)/2. Note that (p-1)/2 is odd, so it is coprime to ord(-1,p) = 2. As a result, ord(-4,p) = ((p-1)/2) * 2 = p-1. Conversely, If ord(-4,p) = p-1, we must have ord(4,p) = (p-1)/2 by noting that ord(-4,p) <= lcm(2,ord(4,p)).

It seems that a(n) = 2*A163778(n-1) + 1 for n >= 2. (End)

CROSSREFS

Cf. A114564. A216371 is a supersequence.

STATUS

approved

editing

#19 by Jon E. Schoenfield at Tue Jun 13 01:29:54 EDT 2017
STATUS

proposed

approved

#18 by Jon E. Schoenfield at Tue Jun 13 01:29:49 EDT 2017
STATUS

editing

proposed

#17 by Jon E. Schoenfield at Tue Jun 13 01:29:46 EDT 2017
COMMENTS

We will use the obvious fact that if a primitive root is a power of an otheranother element, then that other element is also a primitive root. So

STATUS

approved

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 09:12 EDT 2024. Contains 375511 sequences. (Running on oeis4.)