Primes by Trial Division - perl

26 September 2016

For perl5 only,

use strict;
use vars qw(@primes);

All versions:

my $n = shift;
my $count = 2;
while (scalar(@primes) < $n) {
	print("$count\n");
	push(@primes, $count);
	$count++;
	for ( my $i = 0 ; $i < scalar(@primes) ; $i++ ) {
		if ($count % $primes[$i] == 0) {
			$count++;
			$i = 0;
			redo;
		}	
	}
}

Typewritten Software • bear@typewritten.org • Edmonds, WA 98026

Museum

Home

Lab Overview

Retrotechnology Articles

⇒ Primes Benchmark Source

Media Vault

Software Library

Restoration Projects

Artifacts Sought

Related Articles

Primes Benchmark Results

Other Implementations

BCPL

perl

REXX

ruby

Tcl