A113932 - OEIS

This site is supported by donations to The OEIS Foundation.

A113932

(RSA-2048)-10^n = prime where RSA-2048 is the 617 decimal digit unfactored RSA challenge number.

107, 848, 871, 966, 1110 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`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 integer.`
	EXAMPLE	`(RSA-2048)- 10^107 = prime`
	MATHEMATICA	`Position[PrimeQ[Table[ \` `251959084756578934940271832400483985714292821262040320277771378360436620207075\` `955562640185258807844069182906412495150821892985591491761845028084891200728449\` `926873928072877767359714183472702618963750149718246911650776133798590957000973\` `304597488084284017974291006424586918171951187461215151726546322822168699875491\` `824224336372590851418654620435767984233871847744479207399342365848238242811981\` `638150106748104516603773060562016196762561338441436038339044149526344321901146\` `575444541784240209246165157233507787077498171257724679629263863563732899121548\` `31438167899885040445364023527381951378636564391212010397122822120720357 - \` `10^n, {n, 1617}]], True]`
	PROG	`(PARI) \\ Set N to RSA-2048` `for(n=1, 617, if(ispseudoprime(N-10^n), print1(n", ")))`
	CROSSREFS	`Sequence in context: A069759 A183057 A059258 * A185677 A114356 A160488` `Adjacent sequences: A113929 A113930 A113931 * A113933 A113934 A113935`
	KEYWORD	`nonn,base,fini,full`
	AUTHOR	`Joao da Silva (zxawyh66(AT)yahoo.com), Jan 30 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 12 21:29 EST 2012. Contains 205433 sequences.