# Number system

## 01 NUMBER SYSTEM

#### Euclid’s Division Algorithm:

It is application of Euclid’s Division Lemma

It gives us steps to find the HCF of two whole numbers as follows.

Given two whole numbers c and d, (c > d)

$\phantom{\rule{0ex}{0ex}}$

#### Theorem 3:

Proof:

$\therefore {a}^{2}={{p}_{1}}^{2}{{p}_{2}}^{2}{{p}_{3}}^{2}........{{p}^{2}}_{n}$
$\therefore a={p}_{1}{p}_{2}{p}_{3}.....{p}_{n}$

#### Theorem 4:

From and is common divisor of p and q.

#### Probability

Start your learning Journey !