|
Search: id:A108573
|
|
|
| A108573 |
|
Least positive k such that k * [RSA-640]^n - 1 is prime, where RSA-640 is the 193 decimal digit unfactored RSA challenge number. |
|
+0
4
|
|
| 390, 1334, 136, 2058, 2710, 2082, 748, 2388, 3588, 1902, 988, 9170, 5076, 28778, 2112, 1800, 3082, 1238
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
LINKS
|
Wikipedia, RSA-640
|
|
CROSSREFS
|
Cf. A108375.
Sequence in context: A052353 A136153 A069477 this_sequence A158004 A160184 A035883
Adjacent sequences: A108570 A108571 A108572 this_sequence A108574 A108575 A108576
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 05 2005
|
|
|
Search completed in 0.002 seconds
|
