Re: Prime Number Finder

[NAstyed]

Well for the first time i can post some real code from my own, i hope that everything goes well.
This is my solution for the Prime number finder, i now that it has the bug some people says about calculating only with the half or less of the number. (i hope you understand my english to!)

#! perl
use strict;

my @list = 1..100;
foreach $a (@list){
     my@total=();    
    foreach $b(@list){
        if ((int($a/$b)==($a/$b))){
            push @total, $b;
        }
    }
    print "$a is prime\n" if ($#total == 1) ;
}

Zonaunderground.com is my Latinamerican underground music site, check it out!</font