how to find gcd by flow chart
To create a flowchart for finding the Greatest Common Divisor (GCD) of two numbers, you can follow these steps:
1. Start with two input numbers A and B, for which you want to find the GCD.
2. Draw a diamond-shaped decision box with the question "Are A and B equal?"
3. If A and B are equal, then the GCD is A (or B). Draw a rectangle-shaped process box labeled "GCD = A" (or "GCD = B").
4. If A and B are not equal, draw an arrow pointing down from the decision box to a rectangle-shaped process box labeled "Find the smaller number".
5. Inside the "Find the smaller number" process box, write the formula "SmallerNumber = min(A, B)", indicating that you should determine the smaller of the two numbers.
6. Draw an arrow pointing from the "Find the smaller number" process box to another decision box.
7. In the new decision box, ask the question "Is A divisible by SmallerNumber?"
8. If A is divisible by SmallerNumber (Remainder of A divided by SmallerNumber is 0), draw an arrow pointing down from the decision box to a rectangle-shaped process box labeled "GCD = SmallerNumber".
9. If A is not divisible by SmallerNumber, draw an arrow pointing from the decision box to another decision box.
10. In the new decision box, ask the question "Is B divisible by SmallerNumber?"
11. If B is divisible by SmallerNumber, draw an arrow pointing down from the decision box to a rectangle-shaped process box labeled "GCD = SmallerNumber".
12. If B is not divisible by SmallerNumber, draw an arrow pointing from the decision box back to the "Find the smaller number" process box.
13. Repeat steps 5 to 12 until you find a number that is divisible by both A and B.
14. The final rectangle-shaped process box will have the GCD value.
By following this flowchart, you can systematically find the GCD of any two numbers.
Please type your subject in the School Subject box. Any other words, including obscure abbreviations, are likely to delay responses from a teacher who knows that subject well.
http://www.aaamath.com/
Click on fractions at the left and then find what you need.
There are different algorithms to find GCD. The one that has least steps in a flow chart and least work in programming is by Euclid's algorithm. The one we usually work with by finding factors and comparing factors is a more complex algorithm to make a flow-chart, and involves a more complex algorithm (meaning more decisions to make).
Your flow-chart will depend on the algorithm you choose, and you can start with writing pseudocode, since we do not support graphics at this forum.