Browse by Stream
-
Engineering and Architecture
Exams
Colleges
Predictors
Resources
-
Computer Application and IT
Quick Links
Colleges
-
Pharmacy
Colleges
Resources
-
Hospitality and Tourism
Colleges
Resources
Diploma Colleges
-
Competition
Other Exams
Resources
-
School
Exams
Ranking
Products & Resources
-
Study Abroad
Top Countries
Student Visas
-
Arts, Commerce & Sciences
Exams
Colleges
Upcoming Events/Predictors
Resources
-
Management and Business Administration
Exams
Colleges & Courses
Predictors
-
Learn
Online Courses
Products
Engineering Preparation
-
Online Courses and Certifications
Top Streams
Specializations
- Digital Marketing Certification Courses
- Cyber Security Certification Courses
- Artificial Intelligence Certification Courses
- Business Analytics Certification Courses
- Data Science Certification Courses
- Cloud Computing Certification Courses
- Machine Learning Certification Courses
- View All Certification Courses
Resources
-
Medicine and Allied Sciences
Colleges
Predictors
Resources
-
Law
Resources
Colleges
-
Animation and Design
Animation Courses
Colleges
Resources
-
Media, Mass Communication and Journalism
Exams
Colleges
Resources
-
Finance & Accounts
Top Courses & Careers
Colleges
Get Answers to all your Questions
Use Euclid’s division algorithm to find the HCF of : 135 and 225
Answers (1)
225 > 135. Applying Euclid's Division algorithm we get
since remainder 0 we again apply the algorithm
since remainder 0 we again apply the algorithm
since remainder = 0 we conclude the HCF of 135 and 225 is 45.
View full answer
Crack JEE Main with "AI Coach"
- HD Video Lectures
- Unlimited Mock Tests
- Faculty Support
Similar Questions
- Three coins are tossed simultaneously 200 times with the following frequencies of different outcomes:If the three coins are simultaneously tossed again, compute the probability of 2 heads coming up
- Use Euclid' s division algorithm to find the HCF of :196 and 38220
- Show that any positive odd integer is of the form 6q + 1, or 6q + 3 or 6q + 5, where q is some integer.
