Am Sonntag 25 April 2010 17:49:05 schrieb mitch...@kaplan2.com:
> Hi David,
>
> Thanks for the suggestion. I took a quick look at your article, and
> I'll have to spend a little more time on it. "Delicious Primes?" Great
> name.
And it's a good read.
"I find this definition of prime numbers ab
r constantly is one of my pet peeves.
Mitchell
-Original Message-
From: David Anderson [mailto:d...@natulte.net]
Sent: Sunday, April 25, 2010 11:18 AM
To: mitch...@kaplan2.com
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] I need help getting started
On Sun, Apr 25,
.is.fisc...@web.de]
Sent: Sunday, April 25, 2010 4:47 AM
To: haskell-cafe@haskell.org
Cc: mitch...@kaplan2.com
Subject: Re: [Haskell-cafe] I need help getting started
Am Sonntag 25 April 2010 06:34:32 schrieb mitch...@kaplan2.com:
Luke already explained the type error, so I'll focu
l-cafe@haskell.org
Subject: Re: [Haskell-cafe] I need help getting started
writes:
> I'm just starting to learn, or trying to learn Haskell. I want to write a
> function to tell me if a number's prime. This is what I've got:
Have you read through any tutorials?
Do you need to writ
ll-cafe] I need help getting started
Mitchell
You might also be interested in the beginners mailing list. I've been
enjoying for about a month now!
http://www.haskell.org/mailman/listinfo/beginners
On Sat, Apr 24, 2010 at 9:57 PM, Luke Palmer wrote:
On Sat, Apr 24, 2010 at 10
l.org
Subject: Re: [Haskell-cafe] I need help getting started
On Sat, Apr 24, 2010 at 10:34 PM, wrote:
> Hi,
>
>
>
> Im just starting to learn, or trying to learn Haskell. I want to write a
> function to tell me if a numbers prime. This is what Ive got:
>
>
>
> f
On Sun, Apr 25, 2010 at 6:34 AM, wrote:
> Hi,
>
>
>
> I’m just starting to learn, or trying to learn Haskell. I want to write a
> function to tell me if a number’s prime. This is what I’ve got:
>
>
>
> f x n y = if n>=y
>
> then True
>
> else
>
> if gcd x n == 1
>
Am Sonntag 25 April 2010 06:34:32 schrieb mitch...@kaplan2.com:
Luke already explained the type error, so I'll focus on the implementation.
> Hi,
>
>
>
> I'm just starting to learn, or trying to learn Haskell. I want to write
> a function to tell me if a number's prime. This is what I've got:
>
Mitchell
You might also be interested in the beginners mailing list. I've been
enjoying for about a month now!
http://www.haskell.org/mailman/listinfo/beginners
On Sat, Apr 24, 2010 at 9:57 PM, Luke Palmer wrote:
> On Sat, Apr 24, 2010 at 10:34 PM, wrote:
> > Hi,
> >
> >
> >
> > I’m just sta
On Sat, Apr 24, 2010 at 10:34 PM, wrote:
> Hi,
>
>
>
> I’m just starting to learn, or trying to learn Haskell. I want to write a
> function to tell me if a number’s prime. This is what I’ve got:
>
>
>
> f x n y = if n>=y
>
> then True
>
> else
>
> if gcd x n == 1
>
writes:
> I'm just starting to learn, or trying to learn Haskell. I want to write a
> function to tell me if a number's prime. This is what I've got:
Have you read through any tutorials?
Do you need to write this prime detection function yourself (if so, is
this homework?) or can you use a pre
Hi,
I'm just starting to learn, or trying to learn Haskell. I want to write a
function to tell me if a number's prime. This is what I've got:
f x n y = if n>=y
then True
else
if gcd x n == 1
then f x (n+1) y
else False
primeQ x
12 matches
Mail list logo
