Question

a shopkeeper allows a discount of 7 1/7% on the mp of a certain article and makes a profit of 15 2/3%. of the article cost the shopkeeper rs.1765 what must be the mp on the article

Answer 1

Answer:

cp1. What is the Euclid division algorithm?

Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

2. what is the HCF of 103, 156, 221?

Answer: HCF of 103, 156, 221 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 103, 156, 221 using Euclid's Algorithm?

Answer: For arbitrary numbers 103, 156, 221 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.

Step-by-step explanation: