|
| |
|
|
A108573
|
|
Least positive k such that k * [RSA-640]^n - 1 is prime, where RSA-640 is the 193 decimal digit RSA challenge number.
|
|
3
| |
|
|
390, 1334, 136, 2058, 2710, 2082, 748, 2388, 3588, 1902, 988, 9170, 5076, 28778, 2112, 1800, 3082, 1238, 12916
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Other terms are a(25)=1558 and a(43)=5718. All values in the sequence are Fermat and Lucas PRPs except for the first two which were proved with ECM. The larger values won't be easily provable until RSA-640 is factored, which has a prize of $20,000 for its factorization. This sequence is based on a suggestion of Jens Kruse Andersen.
RSA-640 was factored in 2005; see the Wikipedia link. [D. S. McNeil, November 26 2010]
|
|
|
LINKS
| Wikipedia, RSA-640
|
|
|
CROSSREFS
| Cf. A108375.
Sequence in context: A205920 A136153 A069477 * A206653 A202429 A158004
Adjacent sequences: A108570 A108571 A108572 * A108574 A108575 A108576
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Jul 05 2005
|
|
|
EXTENSIONS
| Edited and a(19) added by D. S. McNeil (mcneil(AT)hku.hk), Nov 25 2010
|
| |
|
|
