In Euclid's algorithm, the remainder is always:

Type: MCQ • Marks: 1

A. Greater than divisor

B. Less than divisor

C. Equal to divisor

D. Negative

Correct answer is available inside the full test series attempt.

This page is indexed for search so students can find questions directly from Google.

Go Back Top

Welcome to TutorWale!