Real Numbers

Question 1

Euclid’s Division Lemma (Algorithm)

Answer 1

a = bq + r, where, 0 = r < b.

Question 2

Algorithm

Answer 2

A series of well defined steps which gives a procedure for solving a type of problem.

Question 3

Lemma

Answer 3

A proven statement used for proving another statement.

Question 4

Fundamental Theorem of Arithmetic

Answer 4

Every composite number can be expressed as the product of primes, and this factorization is unique to every number, apart from the order in which the prime factors occur.

Question 5

HCF

Answer 5

Product of the smallest power of each common prime factor in the numbers.

Question 6

LCM

Answer 6

Product of the greatest power of each prime factor, involved in the numbers.

Question 7

Terminating Decimal

Answer 7

Let x be a number whose fraction is in the form of p/q such that q in in the form of 2^n*5^m where, m and n are two non-negative integers, Then x will have a decimal expansion which terminates.

Question 8

HCF (a,b) * LCM (a,b)

Answer 8

a * b