m1q=89873960570712084732829528260849073549900665278240478747684257744366000579315782083148000591
for(k=9000,10000,n=m1q+2+3*k;n6=n%6;prim=0;if(0==n6,prim=isprime(n/6));print("k=",k," gives ",prim,"=isprime(n/6)");if(prim>0,break))
Sample output for loop starting k=9000
k=9000 gives 0=isprime(n/6)
k=9001 gives 0=isprime(n/6)
...
k=9250 gives 0=isprime(n/6)
k=9251 gives 1=isprime(n/6)
Here is a slightly improved loop:
for(k=9000,10000,n=m1q+2+3*k;n6=n%6;prim=0;if(0==n6,print("k=",k," 0==n/6");prim=isprime(n/6));print(" gives ",prim,"=isprime(n/6)");if(prim>0,break))
k=9249
0==n/6
gives 0=isprime(n/6)
gives 0=isprime(n/6)
k=9251 0==n/6
gives 1=isprime(n/6)
m1q is prime and has the following construction:
t=193;m1=((-1+(3^(t))*37));m1q=m1/50