Everest, G. and Rogers, P. and Ward, T. (2002) 'A higher-rank Mersenne problem.', in Algorithmic number theory. Berlin: Springer-Verlag, pp. 95-107.
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.
|Item Type:||Book chapter|
|Full text:||PDF - Accepted Version (234Kb)|
|Publisher Web site:||http://dx.doi.org/10.1007/3-540-45455-1_8|
|Publisher statement:||The original publication is available at www.springerlink.com|
|Record Created:||12 Oct 2012 12:20|
|Last Modified:||17 Oct 2012 10:28|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|