Ask your own question, for FREE!
Computer Science 24 Online
OpenStudy (anonymous):

How streamlined is this process? Given two positive integers, the second larger than the first, determine if the first integer is a divisor of the second.

OpenStudy (anonymous):

Step 1: Request the first and second positive integers. Call them Divisor and Dividend, respectively. Step 2: Divide Dividend by Divisor. Call the result Quotient; call the remainder Remainder. Step 3: Let Message read, “The first integer is” + Result + “a divisor of the second.” Step 4: If Remainder is zero, set Result to nothing. Otherwise, set Result to read, “not”. Step 5: Display Message.

OpenStudy (rsmith6559):

This is fairly generic: if( dividend % divisor != 0 ) print "not";

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!