# wollega

draw flow chart & write pseudo code for greatest common divisor of two numbers

1. 👍 0
2. 👎 0
3. 👁 171

## Similar Questions

1. ### pseudo code and flow charts

how can write a pseudo code and a flow charts to solve these? 1 to find the greatest common divisor out of two positive integers. 2 to find the smallest common factor out of two positive intrgers. Write the flow of thinking just

asked by ravindu on June 8, 2007
2. ### cms

suppose in a positive numbers(including o) and the negative numbers are to be separately counted. a) draw a flow chart. write the pseudo code.

asked by osele madighi on November 16, 2016
3. ### fundamental to programing

design an algorithm that reads three numbers and prints that smallest number.using pseudo code and flow chart

asked by baikedagn on December 8, 2014
4. ### computer science

5. Calculation of tax in Ruritania In a fictitious country of Ruritania, which is in a fictitious continent called Afrisia, the tax system is highly simplified. They have system where all taxes are converted to one single value

asked by Bofelo on October 28, 2015
5. ### sheba universty collage

design an algorithm that keeps on reading numbers until the user enters-1and them determines and out puts the largest number .using pseudo codeand flow chart

asked by baikedagn on December 11, 2014
6. ### Math

What is the minimum value of N that will make this statement true: If we pick any N composite numbers from 1 to 1000, then we can find 2 numbers whose greatest common divisor is not 1.

asked by Andy on February 15, 2013
7. ### math

What is the greatest common divisor of the three numbers 675,375, and 1125

asked by rahul verma on May 16, 2013
8. ### Algorithm

write a pseudo code algorithm that will accept 20 numbers and finds their product

asked by chinna on July 16, 2012
9. ### college computer science

Write a pseudo code that allows a user to enter the names and phone numbers of up to 20 friends

asked by alhassan fuseini Baba on December 21, 2017
10. ### math

What is the minimum value of N that will make this statement true: If we pick any N composite numbers from 1 to 1000, then we can find 2 numbers whose greatest common divisor is not 1. Details and assumptions You may use the fact

asked by harsh on February 13, 2013

More Similar Questions