No products in the cart.

What is the hcf of 13 …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

What is the hcf of 13 and 72 by Euclid's theorem
  • 2 answers

Denish Kotia 4 years, 4 months ago

Using Euclid's Division Lemma a=bq+r Where, 0<_ r<b a=72, b=13 72=13×5+7 a=13, b=7 13=7×1+6 a=7, b=6 7=6×1+1 a=6, b=1 6=1×6+0 Therefore, HCF of 72 and 13 is 1.

Shashank Sivaram 4 years, 4 months ago

The HCF (72, 13) by Euclid's algorithm/theorem is: a = bq + r (0<_r<b) 72 = 13 x 5 + 7 (a = 72, b = 13) 13 = 7 x 1 + 6 (a = 13, b = 7) 7 = 6 x 1 + 1 (a = 7, b = 6) 6 = 1 x 6 + 0 (a = 6, b = 1) So, HCF (72, 13) is 1.
http://mycbseguide.com/examin8/

Related Questions

(A + B )²
  • 1 answers
sin60° cos 30°+ cos60° sin 30°
  • 2 answers
X-y=5
  • 1 answers
Venu Gopal has twice
  • 0 answers
Prove that root 8 is an irration number
  • 2 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App