Question

FUNDAMEN
EXERCISE 1A
expressed
factors oca
1. What do you mean by Euclid's division lemma?
Examples
2. A number when divided by 61 gives 27 as quotient and 32 as remainder
Find the number.
3. By what number should 1365 be divided to get 31 as quotient and 32 as
remainder?
4. Using Euclid's division algorithm, find the HCF of
(i) 405 and 2520 (ii) 504 and 1188 (iii) 960 and 1575.
5. Show that every positive integer is either even or odd.
6. Show that any positive odd integer is of the form (6m + 1) or (671 +3)
or (6m+5), where m is some integer.
7. Show that any positive odd integer is of the form (4m2 + 1) or (4m + 3),
SOLUT
where m is some integer.
8. For any positive integer n prove that n - n is divisible by 6.
9. Prove that if x and y are both odd positive integers then x +y is even
but not divisible by 4.
10. Use Euclid's algorithm to find HCF of 1190 and 1445. Express the HCF
in the form 119
EXAMPL​

Answer 1

Answer:

gtozxhuz ncitsf0Yohau4fyouarfouhshsausygysjctfysigygusuYea75ditwuoaurzkgekgsiyvirduo