Primes p such that p*10[sup]2[/sup] + 1 is also prime: 701, 1301, 1901, 3701, 6101, 6701, 7901, 10301, 13901, 15101, 16301, 19301, 21101, 22901, 27701, 42101, 46301, 52301, 54101, 60101, 64301, 70901, 72701, 81101, 82301, 87701, 88301, 93701, 102101, 112901, 115301, 117101, 123701, 132701, 138101, 139901, 144701, 148301, 157901, 159701, 165701, 166301, 174101, 178301, 186701, 193301, 198701, 201101, 201701, 217901, 220301, 226901, 237701, 243701, 247301, 250301, 252101, 253901, 270701, 285101, 291701, etc...

Submitted to OEIS.

[QUOTE=3.14159;228701]Primes p such that p*10[sup]2[/sup] + 1 is also prime: 701, 1301, 1901, 3701, 6101, 6701, 7901, 10301, 13901, 15101, 16301, 19301, 21101, 22901, 27701, 42101, 46301, 52301, 54101, 60101, 64301, 70901, 72701, 81101, 82301, 87701, 88301, 93701, 102101, 112901, 115301, 117101, 123701, 132701, 138101, 139901, 144701, 148301, 157901, 159701, 165701, 166301, 174101, 178301, 186701, 193301, 198701, 201101, 201701, 217901, 220301, 226901, 237701, 243701, 247301, 250301, 252101, 253901, 270701, 285101, 291701, etc...

There should only be two sequences: One for p * 10[sup]n[/sup] + 1, when n is any integer, and for 100.[/QUOTE]

so in other words p*10[SUP]n[/SUP]+1 and p*10[SUP]100[/SUP] +1 ?

or

p*10[SUP]n[/SUP]+1 and p*100[SUP]n[/SUP]+1 ?

Former.

[QUOTE=3.14159;227558]There are no redundancies.

Not every square number is a fourth power. Fourth powers are a subset of squares.

Nevermind. This is getting me nowhere. Fine, you win. You can keep the smug expression on your face.[/QUOTE]

what CRG was saying is:

[COLOR="Red"]1[/COLOR],4,9,[COLOR="Red"]16[/COLOR],25,36,49,64,[COLOR="Red"]81[/COLOR],100,121,144,169,196,225,[COLOR="Red"]256[/COLOR],....

[COLOR="Red"]1,16,81,256,[/COLOR]........

1) n[SUP]2[/SUP]
2) n[SUP]4[/SUP]
Red) the members in both sequences

see how all the n[SUP]4[/SUP] are Red ? since it includes all fourth powers only then it can be stated: within the set of fourth powers, instead of in the set of squares and the set of fourth powers, so the redundancy stays.

Sent the b-file for the first 20000 terms. The 20000th term is 284727701.

[QUOTE=science_man_88;228683][CODE](13:45) gp > ifprime(x,p)=if(isprime(x),p)
%11 = (x,p)->if(isprime(x),p)
(13:47) gp > ifprime(100,print(100))
100[/CODE]

I was trying something like this but I can't get it to work. why ? is my best question.[/QUOTE]

[QUOTE=axn;228687][CODE]ifprime(p, s)=if(isprime(p), eval(s));
ifprime(100, "print(p)");
ifprime(101, "print(p)");
101
[/CODE][/QUOTE]

[QUOTE=science_man_88;228690]I should of known this by now lol thank you though in a way this is useless but it is useful in the fact that it could create shorter code when typing it in. as by the look of it it saves 10 characters I was also thinking of one where you can do a && part in the if I think I'll try that next.[/QUOTE]

Hats off to axn for understanding the request!

Another way to do it -- the way I'd prefer -- is to pass a closure rather than a string. So
[code]ifprime(p, s)=if(isprime(p), s(p));
ifprime(100, p -> print(p));
ifprime(101, p -> print(p));[/code]
or even
[code]ifprime(p, s)=if(isprime(p), s(p));
printme(n)=print(n);
ifprime(100, printme);
ifprime(101, printme);[/code]

[QUOTE=3.14159;228701]Primes p such that p*10[sup]2[/sup] + 1 is also prime: 701, 1301, 1901, 3701, 6101, 6701, 7901, 10301, 13901, 15101, 16301, 19301, 21101, 22901, 27701, 42101, 46301, 52301, 54101, 60101, 64301, 70901, 72701, 81101, 82301, 87701, 88301, 93701, 102101, 112901, 115301, 117101, 123701, 132701, 138101, 139901, 144701, 148301, 157901, 159701, 165701, 166301, 174101, 178301, 186701, 193301, 198701, 201101, 201701, 217901, 220301, 226901, 237701, 243701, 247301, 250301, 252101, 253901, 270701, 285101, 291701, etc...

Submitted to OEIS.[/QUOTE]

"Primes p such that p*10[sup]2[/sup] + 1 is also prime" are 7,13,19,37,61,67,79,103,.... "Primes p such that (p*10)[sup]2[/sup] + 1 is also prime" are 2,11,13,17,23,43,47,89,101,.... I'm not sure what your sequence is!

You should probably discuss your sequences here before submitting so we can iron out the wording and so forth.

[QUOTE=CRGreathouse;228717]"Primes p such that p*10[sup]2[/sup] + 1 is also prime" are 7,13,19,37,61,67,79,103,.... "Primes p such that (p*10)[sup]2[/sup] + 1 is also prime" are 2,11,13,17,23,43,47,89,101,.... I'm not sure what your sequence is!

You should probably discuss your sequences here before submitting so we can iron out the wording and so forth.[/QUOTE]

he's using p*10[SUP]n[/SUP]+1 I believe for one thing he's checking and p*10[SUP]100[/SUP] +1 for another I'm unsure about what he's posted as well for once.

No, he gave the values for p*10^2+1, but as stated "Primes p such..." should list the p-values and not the p*10^2+1 results!

The sequence as submitted is false!

[QUOTE=kar_bon;228722]No, he gave the values for p*10^2+1, but as stated "Primes p such..." should list the p-values and not the p*10^2+1 results!

The sequence as submitted is false![/QUOTE]

so in other terms:

[CODE]forprime(p=1,1500,if(isprime(p*10^2+1),print(p*10^2+1)))[/CODE]

instead of :

[CODE]forprime(p=1,1500,if(isprime(p*10^2+1),print(p)))[/CODE]