Advertisements
Advertisements
प्रश्न
What do you mean by Euclid’s division algorithm?
उत्तर
Euclid’s division algorithm states that for any two positive integers a and b, there exit unique integers q and r, such that a = bq + r. where 0 ≤ r ≤ b.
APPEARS IN
संबंधित प्रश्न
Define HOE of two positive integers and find the HCF of the following pair of numbers:
155 and 1385
Show that every positive integer is either even or odd?
Find the smallest number which when divides 28 and 32, leaving remainders 8 and 12 respectively.
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `17 /320`
Express each of the following as a rational number in its simplest form:
(i) ` 0. bar(365)`
What do you mean by Euclid’s division algorithm.
If a and b are two prime numbers then find the HCF(a, b)
The HCF to two numbers is 16 and their product is 3072. Find their LCM.
Show that \[2 - \sqrt{3}\] is an irrational number.
In Q.No. 7, HCF (a, b) is
