http://www.perlmonks.org?node_id=67395

#!/usr/bin/perl # This is one of my favorite algorithms, put to perl use. # Run it on command line with no arguments to see what i # mean. Feed it numbers for a bit of a spoiler. # NOTE: start with small numbers(500,1000,etc) as it's not optimized! $==$ARGV[0]||67;($j,@p)=(0,1,2);while($=>=@p-1){$h=1;{$p=$h**2+$h+$p[$ +j]; @p=b(@p,$p)if i($p);$h++;redo if $h<$p[$j]-1;}$j++}shift @p;unless(@AR +GV){ @f=@p[1,2,6,23,24,25,27];@f=($f[2]+$f[3],$f[4],$f[1]+$f[6],$f[0]+$f[5] +); $f[$_]=chr($f[$_])foreach(0..$#f);$.=join '',@f;$..=$/;die $.}foreach( +@p){ print "$_ ";print "\n" unless(++$t%10)}print "\n";sub i{($%,$*,$n)= (+shift,1,1);{($n-- and last) unless $%%$p[$*];last if $p[$*]**2>$%-1; $*++ and redo}$n}sub b{$_{$_}++ foreach(@_);sort{$a<=>$b}keys %_} #nuf evah, #jynx # # PS please tell me what you think, areas of improvement, etc...