Is Number Odd?

[Melanie]

	If num.0=1 then
		oddNum = true
		else
		oddNum = false
		endif

[sayzer]

GrandPa's way!

OddNum = True
IF Num // 2 = 0 THEN OddNum = False

Does Num = 1 work?
----------------------------

[T.Jackson]

OddNum = True
IF Num // 2 = 0 THEN OddNum = False

Do me a favour and refresh my memory with what "//" does?

Trent Jackson

[dhouston]

Page 32 of the PBP manual defines it as Remainder (Modulus). I believe Modulus or Modulo is the more generally used terminology. It's also more useful, generally, than the other methods suggested as you can use it to test whether any number is evenly divisible by any other number. See...

• http://en.wikipedia.org/wiki/Modulo_operation

[sayzer]

Page 32 of the PBP manual defines it as Remainder (Modulus). I believe Modulus is the more generally used terminology. It's also more useful, generally, as you can use it to test whether any number is evenly divisible by any other number.

Do me a favour and refresh my memory with what "//" does?

Trent Jackson

I knew it did something for sure; (well, at least at where I am it does).

--------------

[precision]

in VB

If ((Text1.Text Mod 2) = 0) Then
        MsgBox "Even"
    Else
        MsgBox "Odd"
    End If

.

[T.Jackson]

in VB

If ((Text1.Text Mod 2) = 0) Then
        MsgBox "Even"
    Else
        MsgBox "Odd"
    End If

That's pretty uncanny bud, because I just wrote this ...

Dim num As Integer
Dim oddNum As Boolean

num = 5

If num Mod 2 = 0 Then
   oddNum = False
Else
   oddNum = True
End If

I reckon that there's a recursive way of doing it too!

Trent Jackson

[precision]

I think only mod formula is easy way to find oddeven.

oddeven = number mod 2
if oddeven = 0 then page is even, otherwise odd

.

[skimask]

How about the most rediculous, long winded, round-about way to do it?

[T.Jackson]

So to sum it up so far we've got the following, verified to be working solutions.

1. AND Bitwise operator (My initial approach)
2. Direct bit checking (Melanie's approach)
3. Modulus remainder operator (Precision & Sayzer's approach)

The goal is 10 solutions -- can we do it?

Trent Jackson