### Question Description

The greatest common divisor of two positive integers is the largest integer that evenly divides both numbers.The following algorithm will find the greatest common divisor of number1 and number2.

gcd := number1;

remainder := number2;

repeat

divident := gcd;

gcd := remainder

remainder := dividend mod gcd

until remainder = 0

Using the windows32 framework, write a program that uses dialog boxes to prompt for and input values for number1 and number2, implements the above design to find their greatest common divisor, and uses a message box to display the GCD.

**Extra Credit – 5 points**

Add loops to the program to verify that both numbers input are greater than 1.

### Unformatted Attachment Preview

Purchase answer to see full attachment

## Final Answer

Hi! Here is your program.Have a nice day.

;

;

;

;

;

;

Name:

Class and Section:

Assignment:

Due Date:

Date Turned in:

Program description:

.586

.MODEL FLAT

INCLUDE io.h

; header file for input/output

.STACK 4096

.DATA

number1

num...

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors