|
%I #13 May 13 2013 01:48:36
%S 70,129,178,263,337,545,708,714,867,1317,1587,1961,19415
%N (RSA-768)+10^n = prime where RSA-768 is the 232 decimal digit RSA challenge number.
%C This sequence shows that the difference between a composite number and a prime rests on the modification of a single decimal digit of the given composite number.
%e (RSA-768) + 10^70 is prime.
%t Position[PrimeQ[Table[ \
%t 123018668453011775513049495838496272077285356959533479219732245215172640050726\
%t 365751874520219978646938995647494277406384592519255732630345373154826850791702\
%t 6122142913461670429214311602221240479274737794080665351419597459856902143413 \
%t + 10^n, {n, 1232}]], True]
%o (PARI) \\ Set N to RSA-768
%o for(n=1,1e5,if(ispseudoprime(N+10^n),print1(n", "))) \\ _Charles R Greathouse IV_, Oct 03 2011
%K nonn
%O 1,1
%A Joao Carlos Leandro da Silva (zxawyh66(AT)yahoo.com), Jan 30 2006
%E a(10)-a(12) from _Charles R Greathouse IV_, Oct 03 2011
%E a(13) from _Charles R Greathouse IV_, Oct 05 2011
%E No more terms below 30,000.
| 