I have a slow computer that won't be of much help to the PSP project, so I am working on this problem on that computer. If anyone has any computers that won't be of much help to PSP can consider to help with this

66741 is the smallest number (k) that is a multiple of 3 and k*4^n+1 is never prime!

THe following k and n are left: (20), Please eliminate. Use Newpgen and LLR 3.5. Remember to enter base 4 than 2.

Post below to reserve a k. The aim is to take all the k's to 100,000 and then stop.

Scores

Mark 3

Footmaster 3

Citrix 0

Jean Penne 1

Mystwalker 1

masser 1

k Upper limit Relative weight Reserved by

5886 10000 92 Citrix

8139 10000 86 Citrix

18534 50000 80 Citrix

23451 46000 332 Mystwalker

23799 10000 268

33771 10000 142 Jean Penne

33879 20000 716 Mystwalker

34914 10000 455

35874 10000 448

41709 10000 410 Geoff

42717 10000 622 Geoff

49386 10000 319

51171 10000 731 masser

53226 10000 177 Carlos

55611 20000 536

60849 10000 387

60891 10000 275

63411 10000 316

64494 10000 272 Keller

66741 Sierpinski number for base 4

9 primes found so far!

15441*2^20584+1 is prime! Time: 1.172 sec. by Footmaster

21069*2^23006+1 is prime! Time: 1.751 sec. by Footmaster

21699*2^72874+1 is prime! Time: 21.318 sec. by Footmaster

14661*2^91368+1 is prime! Time: 42.331 sec. by Jean Penne

58791*2^79420+1 is prime! Time: 27.092 sec. by Mystwalker

52839*2^32558+1 is prime! Time: 2.640 sec. by masser

50166*4^12490+1 is prime! by Mark

45306*4^14484+1 is prime! by Mark

30579*4^24297+1 is prime! by Mark

Have fun eliminating these!