Testing for prime-ness, the silly way

The following code takes a positive integer command-line argument (<306) and tests to see if it is prime. In a very, very, silly way.

eval or exit print "$n is not prime.\n" for
<@{$"=',',[$n=pop]}-1/(1${\("/{@{[2..1+$n/2]}}"x2)})|0>,'
print "$n is prime.\n"'
[download]

Edit:Modified code with |0 to stop it claiming 98 was prime.

Comment on Testing for prime-ness, the silly way Download Code

Replies are listed 'Best First'.
Re: Testing for prime-ness, the silly way by hopes (Friar) on Sep 28, 2002 at 15:01 UTC
Talking about the primes... I have to talk about Abigail's oneliner: `perl -wle 'print "Prime" if (1 x shift) !~ /^1?$\|^(11+?)\1+$/' [num]` [download] More details on http://montreal.pm.org/tech/neil_kandalgaonkar.shtml (from google) Hopes `perl -le '$_=$,=q,\,@4O,,s,^$,$\,,s,s,^,b9,s,$_^=q,$\^-]!,,print'`	[reply] [d/l] [select]