If the HCF of and is expressible in the form . Find .
Step : Find the HCF of and using Euclid's division algorithm
Using Euclid’s division algorithm,
Since the remainder has come to zero so the HCF of given numbers is .
Step : Find the required value:
Given that HCF is expressed as following
Hence, the value of is .