Number System Maths Formula

Question

Learn Class 6, Class 9 and Class 10 Maths Formula Number System here and know all about real numbers easily?

Answer 1

Real Number

One of the fact you must know about real number is “It is named as real number because it is not imaginary.” It is a part of imaginary number.

Formally real number is defined as the number which can be expressed on number line. Any number you are thinking beyond is real number except zero and neglecting Imaginary number.

There is a unique real number corresponding to every point on the number line. Also, corresponding to each real number, there is a unique point on the number line.

There are some types of real numbers:

1. Natural Number
2. Whole Number
3. Integers
4. Rational Number
5. Irrational Number
6. Fraction

Formulas Related to Real Number:

1. \(\sqrt{ab}\:=\: \sqrt{a}\sqrt{b}\)
2. \(\sqrt{\frac{a}{b}} \:=\:\frac{\sqrt{a}}{\sqrt{b}}\)
3. \((\sqrt{a}\:+\:\sqrt{b})(\sqrt{a}\:-\:\sqrt{b})\) = a - b
4. (a + \(\sqrt{b}\))(a - \(\sqrt{b}\)) = a² – b
5. (\(\sqrt{a}\:+\:\sqrt{b})\)² = a + 2\(\sqrt{ab}\) + b
6. To rationalise the denominator of \(\frac{1}{\sqrt{a}\:+\:b}\) multiply it by \(\frac{\sqrt{a}\:-\:b}{\sqrt{a}\:-\:b}\), where a and b are integers.
7. a^p . b^q = a^p+q
8. (a^p)^q = a^pq
9. \(\frac{a^{p}}{a^{q}}\) = a^p-q
10. a^pb^p = (ab)^p

Euclid’s division lemma:

[A lemma is a proven statement used for proving another statement].

If there are two positive integers a and b, there exist whole numbers q and r satisfying
a = bq + r   [0 ≤ r < b].

Euclid’s division algorithm:

[An algorithm is a series of well-defined steps which gives a procedure for solving a type of problem].

This algorithm provided the way to calculate HCF.It is based on on Euclid’s division lemma.

According to this algorithm, the HCF of any two positive integers a and b, with a > b, is obtained as follows:

Step 1: Apply the division lemma to find q and r where a = bq + r, 0 ≤ r < b.

Step 2: If r = 0, the HCF is b. If r ≠ 0, apply Euclid’s lemma to b and r.

Step 3: Continue the process until the remainder is zero. The divisor at this stage will be HCF (a, b). Also, HCF(a, b) = HCF(b, r).

Fundamental Theorem of Arithmetic:

It is also known as “unique factorization theorem” or “unique prime factorization theorem”.

Every composite number can be expressed (factorised) as a product of prime numbers, and this factorisation is unique, apart from the order in which the prime factors occur.