#euclid's

New Post has been published on http://3bestfishoilsupplement.com/heath-euclid-elements-complete-3-volume-set-the-thirteen-books-of-euclids-elements-vol-1-books-i-and-ii-vol-2-books-iii-ix-vol-3-books-x-xiii/

New Post has been published on http://3bestfishoilsupplement.com/heath-euclid-elements-euclids-elements-book-one-with-questions-for-discussion/

New Post has been published on http://nerdgroupie.com/euclid-watch-featuring-euclids-proposition/

Euclid Watch - Featuring Euclid's Proposition

Rating:

List Price: Discount: 0.00 Sale Price: (as of 12/31/1969 16:00 PST)Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply to the purchase of this product.. Check Price Right Now!

Availability: Free Shipping: unspecified

Product Description

Details

#include <iostream>

//Euclid's algorithm int main() { //store 2 numbers int num1, num2;

std::cout<<"enter 1st value"<<std::endl; std::cin>> num1;

std::cout<<"enter 2nd value"<<std::endl; std::cin>> num2;

//check for smaller & bigger value int smallValue, bigValue;

if(num2 > num1) { smallValue = num1; bigValue = num2; } else { smallValue = num2; bigValue = num1; }

//do Euclid's algorithm

//get the reminder unsigned int reminder = bigValue % smallValue;

//check if reminder is 0, if not keep dividing while(reminder!=0) { bigValue = smallValue; smallValue = reminder;

reminder = bigValue % smallValue; }

//GCD is found std::cout<<"GCD is " << smallValue <<std::endl;