Q. 33.7( 29 Votes )

Write the following rationales in decimal form using Theorem 1.1.

(i)

(ii)

(iii)

(iv)

(v)

Answer :

According to Euclid’s Division Algorithm,


For any two positive integers, ‘a’ and ‘b’, there exists a unique pair of integers ‘q’ and ‘r’ which satisfy the relation:


a = bq + r , 0 ≤ r ≤ b


(i)






(ii)







(iii)





(iv)






(v)






Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos
Interactive Quiz:Euclid's Division LemmaInteractive Quiz:Euclid's Division LemmaInteractive Quiz:Euclid's Division Lemma44 mins
Fundamental Theorem of Arithmetic-2Fundamental Theorem of Arithmetic-2Fundamental Theorem of Arithmetic-238 mins
NCERT | Imp. Qs. on Rational and Irrational NumbersNCERT | Imp. Qs. on Rational and Irrational NumbersNCERT | Imp. Qs. on Rational and Irrational Numbers44 mins
Fundamental Theorem of Arithmetic- 1Fundamental Theorem of Arithmetic- 1Fundamental Theorem of Arithmetic- 143 mins
Champ Quiz | Fundamental Principle Of ArithmeticChamp Quiz | Fundamental Principle Of ArithmeticChamp Quiz | Fundamental Principle Of Arithmetic41 mins
Quiz | Imp Qs on Real NumbersQuiz | Imp Qs on Real NumbersQuiz | Imp Qs on Real Numbers37 mins
Relation Between LCM , HCF and NumbersRelation Between LCM , HCF and NumbersRelation Between LCM , HCF and Numbers46 mins
Application of Euclids Division LemmaApplication of Euclids Division LemmaApplication of Euclids Division Lemma50 mins
Quiz | Fun with Fundamental Theorem of ArithmeticQuiz | Fun with Fundamental Theorem of ArithmeticQuiz | Fun with Fundamental Theorem of Arithmetic51 mins
Euclids Division LemmaEuclids Division LemmaEuclids Division Lemma49 mins
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation
caricature
view all courses
RELATED QUESTIONS :