In article <3CA032E7.16703.3A95CBA9@localhost>,
"Keith C. Ivey" <[EMAIL PROTECTED]> writes:
> Stephen Turner <[EMAIL PROTECTED]> wrote:
>
>> Task: Each line on stdin contains an integer in [2,10000]
>> in decimal notation followed by a newline. Copy to stdout
>> those lines for which the integer is prime, and no others.
>>
>> I could only manage 31, but Gareth has a 29-stroke solution. Can
>> anyone do better?
>
> I've got 29 also, but this is a problem that gives a huge
> advantage to people who've seen a certain famous (at least
> among the sort of people who read FWP) solution for finding
> primes.
>
mm, the standard golfers solution to this is 28 I'd say.
