2. Show that any positive odd integer is of the form 6q+1, or 6q+3, or 6q+5, where q is some integer.
Solution:
Let a be any positive odd integer and b=6.
We can apply Euclid’s division algorithm on a and b=6.
Follow this blog and be one step ahead.
2. Show that any positive odd integer is of the form 6q+1, or 6q+3, or 6q+5, where q is some integer.
Solution:
Let a be any positive odd integer and b=6.
We can apply Euclid’s division algorithm on a and b=6.
1. Use Euclid’s division algorithm to find the HCF of:
(i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255
(i) 135 and 225
To use Euclid’s division algorithm, we apply Euclid’s division lemma to given numbers c and d, to find whole numbers q and r such that