#!/usr/bin/perl
use strict;
my $file = $ARGV[0] or print "Usage: ./Moore-Helkenberg-Sieve.pl FILENAME\n" and exit;
open(FILE, ">>$file") or die "cannot open file $ARGV[0]";
for (my $x = 0; $x <= 100000000; $x = $x + 10) {
foreach my $mod10 ( 8, 10, 12, 14 ) {
my $row = $x + $mod10;
my $base = $row * 9 + 1;
my $one = $base;
my $two = $base + 10;
my $four = $base + 30;
my $five = $base + 40;
my $seven = $base + 60;
my $eight = $base + 70;
print(FILE "$one,$two,,$four,$five,,$seven,$eight,\n");
}
}
close(FILE);
FIND THE MISSING PRIME(S) CHALLENGE!!!!
$500 PRIZE FOR FIRST PERSON TO DISCOVER A
PRIME NUMBER not recovered by the Moore-Helkenberg-Sieve.
The authors believe the above perl script is sufficient to recover
all prime numbers greater than 109 out to infinity, and challenge
all comers to find a prime number missing from the list.*
Please submit your guesses to:
primecash@yahoo.com
* The perl script above has a range limited to 900000197, but
this range can be extended by modifying the content of
(my $x = 0; $x <= 100000000; $x = $x + 10)
$x <= (any counting number larger than 100000000)
NOTE: The algorithm reproduces approximately 1/9 of the counting numbers.
CLICK HERE TO DOWN LOAD PDF
