InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
Use Euclid Division algorithm to find the hcf |
| Answer» Let us state Euclid\'s division algorithm clearly.To obtain the HCF of two positive integers, say c and d, with c>d, follow the steps below:Step 1:-Aplly Euclid division lemma, to c and d ,with no. , q and r. such that c=dq+r,0 | |