I have a series of numbers from 1.001 to 1.999. I need to determine
which are odd and which are even. I understand the Mod function does
this but so far I've not been able to get it to work on the numbers to
the right of the decimal point. Is there some other route I need to
pursue?

TIA
Tom Street

By definition, an odd number is an integer not evenly divisible by 2. So
technically, all of the values are odd.

I am guessing you want to know the numbers, in which the fractional part
ends in an even number.

In this case, why not multiply by 1000 first?

Mod ( n * 1000; 2)

equals 1 in the case of an "Odd" number, 0 in the case of an even one.

Bill

<tomstreet (AT) arkcda (DOT) org> wrote

In article <1130172384.774281.242340 (AT) g49g2000cwa (DOT) googlegroups.com>,
tomstreet (AT) arkcda (DOT) org says...
Uh... the terms odd and even are only defined on integers. No numbers
between 1.001 and 1.999 are odd or even.

Multiply your number by 1000 to make them integers.

-cheers,
Dave

Just being pedantic here...

In article <kcKdna_oyO6og8DeRVn-pA (AT) comcast (DOT) com>, wjm (AT) wjm (DOT) org says...
Yes!

No!

An odd number is an *integer*; these aren't integers, therefore they
can't be odd (or even for that matter).

-cheers
Dave

Right. The things I notice after I click Send

"42" <nospam (AT) nospam (DOT) com> wrote

I've learned something today. My mathematically challenged mind thought
that an even number was any number divisible by 2 and not any INTEGER.
Your suggestion works fine. Many thanks.

Tom Street

But no fraction is evenly divisible by 2

<tomstreet (AT) arkcda (DOT) org> wrote