This works:
cfif (40 mod 4) is 0
divisible!
cfelse
not divisible!
/cfif
HTH,
Howie Hamlin - inFusion Project Manager
On-Line Data Solutions, Inc.
www.CoolFusion.com
631-737-4668 x101
inFusion Mail Server (iMS) - the World's most configurable mail server
- Original Message -
From:
On 12/27/00, Jon Hall penned:
Maybe I should have paid attention in math, but here is my problem.
I have 2 numbers, for example 40 and 4. All I need to do is find out if (40
/ 4) has a remainder.
For some reason, (40 MOD 4) does not seem to be working.
Two ways you could write a cfif:
CFIF 40
cfif 40 MOD 4
!--- Has remainder - evaluates to some
--- positive numeric value (a.k.a. TRUE) ---
cfelse
!--- Does not have a remainder - evaluates
--- to 0 (a.k.a. FALSE) ---
/cfif
-Original Message-
From: Jon Hall [mailto:[EMAIL PROTECTED]]
Sent:
Thanks...I must have not had enough caffeine yet.
jon
- Original Message -
From: "Bud" [EMAIL PROTECTED]
To: "CF-Talk" [EMAIL PROTECTED]
Sent: Wednesday, December 27, 2000 2:42 PM
Subject: Re: MOD math function?
On 12/27/00, Jon Hall penned:
Maybe I should have pa
4 matches
Mail list logo
