At 01:31 PM 11/22/2006, Artur wrote: >I'm looking for members which have Mathematica Programme and can help in >finding the first number such that >(PrimeQ[2(n) + 1] == True) && (PrimeQ[4( > n) + 1] == True) && (PrimeQ[6(n) + 1] == True) && (PrimeQ[8( > n) + 1] == True) && (PrimeQ[10(n) + 1] == True) && (PrimeQ[12( > n) + 1] == True) && (PrimeQ[14(n) + 1] == True) && (PrimeQ[16( > n) + 1] == True) && (PrimeQ[18(n) + 1] == True) && (PrimeQ[20( > n) + 1] == True) && (PrimeQ[22(n) + 1] == True) >these n is bigger than 4850000000000 >I have Mathematica procedure which is 4000 much more quickest as above but >for as big numbers PrimeQ working slow and will be good divided range of >searching on few subranges and run each other on different computer. >If somebody can help let me know. I need information how long time >computer can run without reset.
Hi Artur, Don Reble recently submitted this value, as well as the next two in the sequence, to the Online Encyclopedia of Integer Sequences: http://www.research.att.com/~njas/sequences/A071576 . The least such n is 946622690475--curiously, this is about one fifth of the lower bound you give. -- Fred W. Helenius [EMAIL PROTECTED] _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
