Checking if the result is a natural number

[Diablo117]

What is it you are trying to achieve?
After dividing a number, I want to see if it really IS divisible by finding out if the number outputted was natural, or decimal

What is the problem you are having?
Don't know if turing can do that or not

Please specify what version of Turing you are using
4.0.5

[syntax_error]

look up, the term mod.

That should be more then enough for you.

And, yes it can.

[Diablo117]

wow, I feel as if I've been hit over the hit with an unusually large club for me not even thinkin of using mod in that way...lol

[saltpro15]

Turing:

if num mod 2 = 0 then ... end if

[apomb]

saltpro15 @ Wed Jul 08, 2009 9:48 am wrote:

Turing:

if num mod 2 = 0 then ... end if

wouldnt that just check if the number is even?

[DtY]

apomb @ Wed Jul 08, 2009 12:17 pm wrote:

saltpro15 @ Wed Jul 08, 2009 9:48 am wrote:

Turing:

if num mod 2 = 0 then ... end if

wouldnt that just check if the number is even?

num mod 2 would test if it's divisible by two. You'd replace two with whatever number you need to check if you can divide by.

[Insectoid]

Another way,,

code:

if num div X = num/X then    ... end if

[DtY]

insectoid @ Wed Jul 08, 2009 1:41 pm wrote:

Another way,,

code:

if num div X = num/X then    ... end if

Although that method is slower and makes less sense..

[saltpro15]

thanks for correcting that guys

[Zren]

I like my method.

Turing:

if num = floor(num) then put "Integer" else put "Real Number" end if

[syntax_error]

Zren @ Wed Jul 08, 2009 11:03 pm wrote:

I like my method.

Turing:

if num = floor(num) then put "Integer" else put "Real Number" end if

Hmm, seems like the smallest amount of code to me, nice.