2010
DOI: 10.1090/s0025-5718-10-02324-0
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian Mersenne and Eisenstein Mersenne primes

Abstract: Abstract. The Biquadratic Reciprocity Law is used to produce a determin-

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 12 publications
0
10
0
Order By: Relevance
“…) and so we obtain the presentation (7). This presentation shows that J ′ is a homomorphic image of the cyclically presented…”
Section: Proof Of Theoremmentioning
confidence: 81%
See 2 more Smart Citations
“…) and so we obtain the presentation (7). This presentation shows that J ′ is a homomorphic image of the cyclically presented…”
Section: Proof Of Theoremmentioning
confidence: 81%
“…The presentations (6), (7) suggest generalizing the concept of cyclically presented groups, defined at (1), to bicyclically presented groups G r (w, v) defined by the presentation Then for n = 4 or 6 the presentations (6), (7) give…”
Section: Proof Ofmentioning
confidence: 99%
See 1 more Smart Citation
“…Then or depending on whether is a quadratic nonresidue or a quadratic residue modulo p. [1,2]; if(isprime(k)==0, return("is composite"); ); if((p+1)/(2^k)!=1, return("The number is not Merssene prime"); ); if(k<3, return("k is not on the condition k>=3"); ); x=3; for(i=1,k-1,z=Mod(x^3-6*x,p);g=gcd(lift(z),p); if(g>1, return("Is Composite"); ); x1=Mod(4*(x^3-6*x),p); if(x1==0, return("Is Composite"); ); x=Mod((x^4+12*x^2+36)/(x1),p); ); z=Mod(x^3-6*x,p); if(z!=0, return("Is Composite");, return("Is Prime") );}…”
Section: Theorem23: If Is Prime Andmentioning
confidence: 99%
“…In both the papers the concept of Mersenne primes is used to give a valid definition of even-perfect numbers. Recently Pedro Berrizbeitia and Boris Iskra studied Mersenne primes over Gaussian integers and Eisenstein integers [3]. The primality of Gaussian Mersenne numbers and Eisenstein Mersenne numbers are tested using biquadratic reciprocity and cubic reciprocity laws respectively.…”
Section: Introductionmentioning
confidence: 99%