Real Numbers - Assignment-1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Real Numbers – Assignment

1. Use the division algorithm to find the quotient q(y) and remainder r(y), when f(y) = 8y4 –
12y3 – 2y2 + 15y – 4 is divided by g(y) = 2y2 – 3y + 1. 2 Marks

2. State the following: 2 Marks


(i) Euclid’s Division Lemma with boundary conditions.
(ii) Fundamental Theorem of Arithmetic.

3. Find the least number that is divisible by all numbers between 1 and 10 (both inclusive).
2 Marks

4. Prove that if a and b are odd positive integers then a2+b2 is even integer. 2 Marks

5. Express the positive integers 72 and 90 as the product of its prime factors. 2 Marks

6. Find the HCF of 144 and 60 by prime factorisation method. 2 Marks

7. Find the LCM of 60 and 144 by prime factorisation method. 2 Marks

8. There is a circular path around a sports field. Ankit takes 18 minutes to drive one round
of the field, while Ankita takes 12 minutes for the same. Suppose they both start at the
same point, at the same time and go in the same direction. After how many minutes will
they meet again at the starting point? 2 Marks

9. Show that 5 – 3 is irrational. 3 Marks

10. Show that 3 2 is irrational. 3 Marks

11. Express 32760 as the product of its prime factors. 3 Marks

12. Prove that 2 is irrational number? 3 Marks

13. Find the HCF of 96 and 404 by the prime factorisation method. Hence, find their
LCM. 3 Marks

14. Find the HCF and LCM of 6, 72 and 120, using the prime factorisation method.
3 Marks
15. Theorem: If a and b are positive integers such that a = bq + r, then every common divisor
of a and b is a common divisor of b and r. 4 Marks

16. Prove that one of every three consecutive positive integers is divisible by 3. 4 Marks
17. Prove that if x and y are odd positive integers then x2+y2 is even but not divisible by 4.
4 Marks

18. Use Euclid’s division algorithm to find the HCF of 210 and 55. 4 Marks

19. Show that any positive integer is of the form 3q or 3q+1 or 3q+2 for some integer q.
4 Marks

20. Prove that n2-n is divisible by 2 for every positive integer n. 4 Marks

You might also like