Skip to main content

Research Repository

Advanced Search

A higher-rank Mersenne problem

Everest, G.; Rogers, P.; Ward, T.

A higher-rank Mersenne problem Thumbnail


Authors

G. Everest

P. Rogers

T. Ward



Contributors

C. Fieker
Editor

D. Kohel
Editor

Abstract

The classical Mersenne problem has been a stimulating challenge to number theorists and computer scientists for many years. After briefly reviewing some of the natural settings in which this problem appears as a special case, we introduce an analogue of the Mersenne problem in higher rank, in both a classical and an elliptic setting. Numerical evidence is presented for both cases, and some of the difficulties involved in developing even a heuristic understanding of the problem are discussed.

Citation

Everest, G., Rogers, P., & Ward, T. (2002). A higher-rank Mersenne problem. In C. Fieker, & D. Kohel (Eds.), Algorithmic number theory (95-107). Springer Verlag. https://doi.org/10.1007/3-540-45455-1_8

Publication Date 2002
Deposit Date Oct 12, 2012
Publicly Available Date Oct 17, 2012
Publisher Springer Verlag
Pages 95-107
Series Number 2369
Book Title Algorithmic number theory.
DOI https://doi.org/10.1007/3-540-45455-1_8

Files

Accepted Book Chapter (239 Kb)
PDF

Copyright Statement
The original publication is available at www.springerlink.com





You might also like



Downloadable Citations