Whole Number Finding?

[mattpk]

How would i check if a number is a whole number through turing? I want to make a program that finds factors for you

[Tony]

Strictly speaking, you can check for

code:

num == intreal(round(num))

But really, you are looking for the modulo operator.

[OneOffDriveByPoster]

mattpk @ Mon Sep 21, 2009 7:52 pm wrote:

How would i check if a number is a whole number through turing? I want to make a program that finds factors for you

It looks like you are trying trial division. Turing provides "rem" which the remainder.

[mattpk]

i didnt one hundred percent understand you guys, but i was able to find out that i could do

Quote:

loop
if round(num / count) = num / count
then factor := count
put factor
end if

count -= 1
exit when count = 0
end loop

[Tony]

code:

if num mod count = 0 then    put count end if

[Kharybdis]

There's also a simple error check that you can do.

Turing:

var num : string get num if strintok (num) then     put "Whole number." else     put "Real number/Complex Number/Word" end if

[andrew.]

You can do this multiple ways. One way is to round it and see if it is different. If it is, then it wasn't an integer. Another way is to do what Kharybdis said and convert the number to a string (or get it as a string) and then see if it's okay for it to be an integer (strintok). If it is, then it is an integer, otherwise it's something else.