Write the following rationales in decimal form using Theorem 1.1.
(i) ![]()
(ii) ![]()
(iii) 
(iv) 
(v) ![]()
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)
![]()
![]()
![]()
![]()
Couldn't generate an explanation.
Generated by AI. May contain inaccuracies — always verify with your textbook.



