.
.
Math Central - mathcentral.uregina.ca
Quandaries & Queries
Q & Q
. .
topic card  

Topic:

euclidean algorithm

list of
topics
. .
start over

6 items are filed under this topic.
 
Page
1/1
Express the HCF of 1232 and 573 as 1232x + 573y = 1 2009-02-22
From Anonymous:
Express the HCF of 1232and 573 as 1232x + 573y = 1.
Answered by Victoria West.
Greatest common divisor 2007-03-14
From Marie:
How do I prove this? Let h be the greatest common divisor of the positive integers a and b. Show that there exist integers p and q (not necessarily positive) such that pa + qb = h. Thanks
Answered by Penny Nom.
Show that 3k+2 and 5k+3 are relatively prime 2007-01-15
From Andrea:
show that if k is a positive integer, then 3k+2 and 5k+3 are relatively prime
Answered by Penny Nom.
How many children were there? 2006-05-14
From Geecee:
At a local village gala, the entire population turned up, 500 people. The event raised £3,000. Tickets were priced as follows: £7.48 men, £7.12 women and £0.45 children. How many children were there?
Answered by Stephen La Rocque.
The Euclidean Algorithm 2002-01-31
From Murray:
Can you please explain to me why the euclidean algorithm works?
Answered by Penny Nom.
Reduce 79,537/3,623,420 2001-12-13
From Eliana:
How do you reduce 79,537/3,623,420.
Answered by Claude Tardif.
 
Page
1/1

 

 


Math Central is supported by the University of Regina and the Imperial Oil Foundation.

CMS
.
* Registered trade mark of Imperial Oil Limited. Used under license.

 

Home Resource Room Home Resource Room Quandaries and Queries Mathematics with a Human Face About Math Central Problem of the Month Math Beyond School Outreach Activities Teacher's Bulletin Board Canadian Mathematical Society University of Regina Imperial Oil Foundation