Question

state Euclid's division algorithm​

Answer 1

Answer:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

Answer 2

Answer:

by Euclid division algorithm,

for example:- if p² is divisible by 2 then p is divisible by 2.

this help to prove any no. irrational.

hope it helps you.....