PARI's commands

[science_man_88]

yeah on the kbb(a,x,m) idea I apparently forgot I was doing something in Pari and I didn't realize it even though by the time it gives it should of been at 3 in the morning when I was asleep this started.

a=1;for(m=1,10,for(x=1,m^m-1,kbb(a,x,m)))

*** print1: user interrupt after 10h, 40mn, 54,500 ms.
(13:11) gp > a=1;for(m=1,10,for(x=1,m^m-1,kbb(a,x,m)))


oh and the highest I see in the last few lines before I stopped it:

65390961287 which is over 65 billion

stand corrected:

98418329759 over 98 billion found.

[3.14159]

I'm currently looking for a record k-b-b. (b = 28657), and that will also be the largest prime I ever found,. (Expected digits: 127737)

[3.14159]

I have now commenced testing for k * 2³²⁸⁷⁵⁰ + 1 and k * 28657²⁸⁶⁵⁷ + 1.

Here are the odds for each:

For the base 2 search: 1 in 4283.
For the base 28657 search: 1 in 5812.

Time taken for each test: 3 minutes for base 2.
Expected time for base 2 completion: Approx. 9 days.
Expected time for base 28657 completion: .. 81 days.

[science_man_88]

Originally Posted by 3.14159

I have now commenced testing for k * 2³²⁸⁷⁵⁰ + 1 and k * 28657²⁸⁶⁵⁷ + 1.

Here are the odds for each:

For the base 2 search: 1 in 4283.
For the base 28657 search: 1 in 5812.

Time taken for each test: 3 minutes for base 2.
Expected time for base 2 completion: Approx. 9 days.
Expected time for base 28657 completion: .. 81 days.

well you're k range for your expected length is 10^114477-10^114478 how many candidates in that range ?

[3.14159]

Originally Posted by science_man_88

well you're k range for your expected length is 10^114477-10^114478 how many candidates in that range ?

For b = 2, there are approximately 4880 candidates. For b = 28657, there are approx. 9289 candidates.

Therefore, I will expect only one prime for each, in 9 and 81 days, respectively.

[3.14159]

I'll report back in November for b = 28657.

[science_man_88]

(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

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

[axn]

Originally Posted by science_man_88

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

ifprime(p, s)=if(isprime(p), eval(s));
ifprime(100, "print(p)");
ifprime(101, "print(p)");
101

[science_man_88]

Originally Posted by axn

ifprime(p, s)=if(isprime(p), eval(s));
ifprime(100, "print(p)");
ifprime(101, "print(p)");
101

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.

[science_man_88]

(14:28) gp > ifprime(p,u,s)=if(isprime(p) && eval(u), eval(s))
%42 = (p,u,s)->if(isprime(p)&&eval(u),eval(s))
(14:29) gp > ifprime(100,"p%9==1","print(100)")
(14:29) gp > ifprime(101,"p%9==1","print(100)")
(14:29) gp > ifprime(101,"p%9==2","print(100)")
100
(14:29) gp > ifprime(101,"p%9==2","print(p)")
101

thank you axn

[science_man_88]

Originally Posted by science_man_88

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.

okay maybe not but it's at least as small as what it equals.