- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Find the HCF of the following pair of numbers:
70 and 30
Given: 70 and 30.
To find: Here we have to find the HCF of the given numbers.
Solution:
Using Euclid's division algorithm to find HCF:
Using Euclid’s lemma to get:
- $70\ =\ 30\ \times\ 2\ +\ 10$
Now, consider the divisor 30 and the remainder 10, and apply the division lemma to get:
- $30\ =\ 10\ \times\ 3\ +\ 0$
The remainder has become zero, and we cannot proceed any further.
Therefore the HCF of 70 and 30 is the divisor at this stage, i.e., 10.
So, HCF of 70 and 30 is 10.
Advertisements