🚀 go-pugleaf

Robert Andrews (robandrews@easynet.co.uk) wrote:
: Please give help to a Pascal beginner.

: I'm using TPW 1.5  and I need to write a program that checks whether a
: given number is exactly divisible by three or not.
: I will need to input a number and get a report back on if it is or
: isn't.
: I can't figure out how I am going to get the program to test this.

: A program will not be essential from you, but I would like to know the
: algorithm for the calculation. E-mail would be preferred.

hmmm...  just MOD the number by 3.  if the result is 0, then it's
divisible by 3, i.e. no remainders.   if you are not familiar with the
MOD function, it does the same thing as the division function, except
MOD returns the modulus or the remainder (another fancy term...).

in case your compiler doesn't have a MOD function, it's time to get a
new one... 8-))  but seriously, the long way to do this is to subtract
the INT (y/x) from just (y/x).  if the result = 0 then the number is
divisble by 3, exactly...
--
later days...

leo d.
ldivinag@s1.csuhayward.edu forward to ldivinag@barney.sbe.csuhayward.edu